Coding problems
Pick a problem to open the workspace. Difficulty and topics will expand as we grow the library.
Array (300) Simulation (203) Hash Table (197) String (164) Sorting (121) Design (95) Math (77) Graph Theory (73) Recursion (63) Greedy (62) Depth-First Search (57) Breadth-First Search (50) Dynamic Programming (47) Heap (Priority Queue) (40) Matrix (37) Tree (37) Counting (34) Two Pointers (32) Memoization (29) Backtracking (27) Binary Search (26) Sliding Window (26) Enumeration (23) Queue (22) Prefix Sum (20) Stack (15) Bit Manipulation (14) Trie (14) Data Stream (12) Shortest Path (11) Union-Find (10) Bitmask (9) Binary Tree (8) Randomized (8) Sweep Line (8) Topological Sort (8) String Matching (7) Combinatorics (6) Iterator (6) Ordered Set (6) Divide and Conquer (5) Concurrency (4) Geometry (4) Hash Function (4) Linked List (4) Segment Tree (4) Binary Indexed Tree (3) Interactive (3) Doubly-Linked List (2) Merge Sort (2) Probability and Statistics (2) Quickselect (2) Rolling Hash (2) Brainteaser (1) Database (1) Eulerian Circuit (1) Game Theory (1) Monotonic Queue (1) Number Theory (1) Strongly Connected Component (1) Suffix Array (1)
| # | Title | Companies | Interview stages | Job roles | Difficulty | Status |
|---|---|---|---|---|---|---|
| 321 | — | |||||
| 322 | — | |||||
| 323 | — | |||||
| 324 | — | |||||
| 325 | — | |||||
| 326 | — | |||||
| 327 | — | |||||
| 328 | — | |||||
| 329 | — | |||||
| 330 | — | |||||
| 331 | — | |||||
| 332 | — | |||||
| 333 | — | |||||
| 334 | — | |||||
| 335 | — | |||||
| 336 | — | |||||
| 337 | — | |||||
| 338 | — | |||||
| 339 | — | |||||
| 340 | — |
Showing 321 – 340 of 456 problems