Squarespace Coding Interview Questions
25 Squarespace coding interview problems with full optimal solutions — 12 easy, 10 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Squarespace interviewer values, and a FAQ section.
Showing 12 problems of 25
- #1easyfoundational
1. Two Sum
Find two indices whose values sum to a target; Squarespace uses it as a phone-screen warm-up to gauge JS hash-map fluency.
- #2easyfoundational
2. Valid Parentheses
Validate that brackets in a string are balanced; Squarespace screens use it to test stack reasoning relevant to nested template blocks.
- #3easyfoundational
3. Merge Two Sorted Lists
Merge two sorted linked lists into one; Squarespace uses it to verify pointer hygiene with dummy heads.
- #4easyfoundational
4. Remove Duplicates from Sorted Array
Dedup in-place on a sorted array and return the new length; Squarespace uses it to test two-pointer fluency.
- #5easyfoundational
5. Remove Element
Remove all occurrences of a value in-place; Squarespace screens use it to test in-place mutation discipline.
- #6easyfoundational
6. Search Insert Position
Find the index where a target should be inserted into a sorted array; Squarespace uses it to test bounded binary-search.
- #7easyfoundational
7. Best Time to Buy and Sell Stock
Compute the maximum single-trade profit in a price series; Squarespace uses it to probe whether you reach for a one-pass min-tracker before reaching for nested loops.
- #8easyfoundational
8. Single Number
Find the one element that appears once when every other element appears twice; Squarespace uses it to test whether you reach for XOR over a hash set.
- #9easyfoundational
9. Linked List Cycle
Detect whether a singly linked list contains a cycle; Squarespace uses it to gauge whether you know Floyd's two-pointer technique versus building a visited set.
- #10easyfoundational
10. Reverse Linked List
Reverse a singly linked list in place; Squarespace uses it as a fundamentals check before harder block-ordering problems.
- #11easyfoundational
11. Maximum Depth of Binary Tree
Return the longest root-to-leaf path length of a binary tree; Squarespace uses it to check whether you reach for a clean recursion or unnecessary state.
- #12easyfoundational
12. Valid Palindrome
Decide whether a string is a palindrome after stripping non-alphanumeric characters and lowercasing; Squarespace uses it to gauge two-pointer fluency on cleaned input.