Indeed Coding Interview Questions
25 Indeed coding interview problems with full optimal solutions — 16 easy, 6 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 Indeed interviewer values, and a FAQ section.
Showing 16 problems of 25
- #1easyfoundational
1. Two Sum
Find two array indices whose values sum to a target — Indeed's warmup before scaling to candidate-to-job matching where complement lookups dominate.
- #2easyfoundational
2. Valid Parentheses
Validate that bracket pairs are properly nested and closed — Indeed uses it to gauge stack fluency before resume-parser and search-query syntax problems.
- #3easyfoundational
3. Merge Two Sorted Lists
Merge two sorted linked lists into one sorted list — the linked-list merge that underpins Indeed's job-feed combination from multiple syndication sources.
- #4easyfoundational
4. Remove Duplicates from Sorted Array
Compact a sorted array in place so each unique value appears once — Indeed's dedup warmup before scaling to duplicate job-posting suppression.
- #5easyfoundational
5. Remove Element
Strip all instances of a target value from an array in place and return the new length — Indeed uses it to test in-place filtering before sponsored-listing removal problems.
- #6easyfoundational
6. Search Insert Position
Find the index to insert a target into a sorted array — Indeed's binary-search warmup before ranked-results bisection problems.
- #7easyfoundational
7. Plus One
Increment a number represented as a digit array — Indeed's carry-handling warmup before pagination-counter and impression-id problems.
- #8easyfoundational
8. Merge Sorted Array
Merge two sorted arrays in place — Indeed's two-pointer pattern that maps directly to combining ranked job lists from multiple shards.
- #9easyfoundational
9. Binary Tree Inorder Traversal
Return the inorder traversal of a binary tree — Indeed's tree-walk warmup that maps to traversing taxonomy nodes in a job-category tree.
- #10easyfoundational
10. Same Tree
Check if two binary trees are structurally and value-wise identical — Indeed uses it as a building block for duplicate-posting tree comparison.
- #11easyfoundational
11. Symmetric Tree
Decide whether a binary tree is a mirror of itself — Indeed's mirror-recursion warmup before bidirectional graph matching problems.
- #12easyfoundational
12. Maximum Depth of Binary Tree
Compute the maximum depth of a binary tree — Indeed's recursive-base-case warmup before facet-tree depth limits in category browse.
- #13easyfoundational
13. Balanced Binary Tree
Determine whether a binary tree is height-balanced — mirrors how Indeed validates hierarchical job-category trees before indexing them.
- #14easyfoundational
14. Path Sum
Check whether a root-to-leaf path in a binary tree sums to a target — a building block for Indeed's skill-weight aggregation in job-fit scoring.
- #15easyfoundational
15. Pascal's Triangle
Generate the first numRows rows of Pascal's triangle — tests iterative 2D array construction that mirrors Indeed's incremental ranking coefficient tables.
- #16easyfoundational
16. Single Number
Find the element that appears exactly once in an array where every other element appears twice — the XOR trick appears in Indeed's deduplication pipelines for job listings.