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 6 problems of 25
- #17mediumfoundational
17. Longest Substring Without Repeating Characters
Find the length of the longest substring without repeating characters — the sliding window pattern powers Indeed's query tokenizer deduplication.
- #18mediumfoundational
18. Group Anagrams
Cluster strings that are anagrams of each other — directly models how Indeed groups near-duplicate job titles before deduplication and canonical-name resolution.
- #19mediumfoundational
19. Number of Islands
Count connected land regions in a grid — Indeed uses this pattern to identify clusters of related job listings in geographic heat-map generation.
- #20mediumfoundational
20. Product of Array Except Self
Compute each element's product of all other elements without using division — a prefix/suffix scan Indeed applies to confidence-score normalization across job recommendations.
- #21mediumfoundational
21. Top K Frequent Elements
Return the k most frequent elements — a core primitive in Indeed's trending search query and popular job-title surfacing pipelines.
- #22mediumfoundational
22. Subarray Sum Equals K
Count contiguous subarrays whose sum equals k — the prefix-sum hash map approach models Indeed's click-window aggregation in A/B test signal computation.