Solvarch
DSA ProblemsProgressPlanRoadmapsReviewCheat SheetsCompaniesSystem DesignCS FundamentalsQuestion Bank
Theme
All companies

Google question bank

Emphasis on clean reasoning from brute force to optimal, graph/DP depth, and follow-ups that mutate the problem.

14 DSA problems · 3 system-design prompts · compiled from publicly shared interview experiences; exact questions vary between loops.

Two SumEasyArraysVery common
Warm-up in phone screens; expect the follow-up variants.arrayhash-table
Longest Substring Without Repeating CharactersMediumStringsVery common
stringsliding-windowhash-table
Number of IslandsMediumGraphsVery common
Often extended with follow-ups (diagonals, streaming grid).graphbfsdfsmatrix
Merge IntervalsMediumArraysVery common
arrayintervalssorting
Design a Web CrawlerVery common
The canonical Google system-design prompt.
Median of Two Sorted ArraysHardBinary SearchCommon
Classic onsite hard — binary search partition.binary-searcharraydivide-and-conquer
Trapping Rain WaterHardTwo PointersCommon
two-pointersarraystackdynamic-programming
Course ScheduleMediumGraphsCommon
Topological sort; be ready to detect and print a cycle.graphtopological-sortbfsdfs
Word BreakMediumTriesCommon
triedynamic-programmingstringhash-table
Decode StringMediumStacks & QueuesCommon
Stack simulation; recursion follow-up is common.stackstringrecursion
Kth Largest Element in an ArrayMediumHeaps & Priority QueuesCommon
Discuss heap vs quickselect trade-offs.heapquickselectsorting
Design Typeahead / AutocompleteCommon
Search-suggestions design shows up across levels.
Edit DistanceMediumDynamic ProgrammingOccasional
dynamic-programmingstring
Unique PathsMediumDynamic ProgrammingOccasional
Usually a lead-in to obstacle/DP variants.dynamic-programmingmathcombinatorics
Network Delay TimeMediumGraphsOccasional
Dijkstra with a twist in senior loops.graphdijkstrashortest-pathheap
Generate ParenthesesMediumBacktrackingOccasional
backtrackingstringrecursion
Design Google DocsOccasional
Collaborative editing for senior rounds.