Interview Prep Tools

No problems tracked yet. Click "Add Problem" to start building your log.

No stories yet. Build your bank of 6-8 STAR stories to cover the most common behavioral questions.

• Tell me about a time you disagreed with a teammate.

  BehavioralMediumAmazonGoogleMetaMicrosoft
• Tell me about a time you failed.

  BehavioralMediumAmazonGoogleMicrosoft
• Tell me about a time you led a project.

  BehavioralMediumAmazonMetaApple
• Why do you want to work here?

  BehavioralEasyAmazonGoogleMetaMicrosoftApple
• Tell me about a time you worked under pressure.

  BehavioralMediumAmazonMetaApple
• Tell me about a time you influenced without authority.

  BehavioralHardGoogleAmazonMicrosoft
• Tell me about a time you received difficult feedback.

  BehavioralMediumMicrosoftGoogle
• Describe a time you went above and beyond your role.

  BehavioralMediumAmazonApple
• Tell me about a time you dealt with ambiguity.

  BehavioralHardAmazonGoogleMeta
• Tell me about a time you mentored someone.

  BehavioralMediumGoogleMicrosoft
• Design a URL shortener like bit.ly.

  System DesignMediumGoogleAmazonMeta
• Design a news feed system like Facebook or Twitter.

  System DesignHardMetaGoogle
• Design a chat system like WhatsApp.

  System DesignHardMetaAmazonMicrosoft
• Design a rate limiter.

  System DesignMediumGoogleAmazon
• Design a notification system.

  System DesignMediumAmazonMetaApple
• Design a file storage system like Google Drive.

  System DesignHardGoogleMicrosoftApple
• Design a search autocomplete system.

  System DesignMediumGoogleAmazon
• Design a video streaming platform like YouTube.

  System DesignHardGoogleAmazonMeta
• Two Sum — find two numbers that add to a target.

  CodingEasyAmazonGoogleMetaMicrosoftApple
• Merge Intervals — merge overlapping intervals in an array.

  CodingMediumGoogleMetaAmazon
• LRU Cache — design a data structure with O(1) get and put.

  CodingMediumAmazonGoogleMetaMicrosoft
• Number of Islands — count connected components in a grid.

  CodingMediumAmazonGoogleMeta
• Binary Tree Level Order Traversal — return values level by level.

  CodingMediumAmazonMicrosoftMeta
• Longest Substring Without Repeating Characters.

  CodingMediumAmazonGoogleMetaMicrosoft
• Valid Parentheses — check if brackets are balanced.

  CodingEasyAmazonGoogleMeta
• Coin Change — minimum coins to make a target amount.

  CodingMediumAmazonGoogleMicrosoft
• Course Schedule — detect cycle in a directed graph.

  CodingMediumAmazonGoogleMeta
• Median of Two Sorted Arrays.

  CodingHardGoogleAmazon
• Serialize and Deserialize Binary Tree.

  CodingHardGoogleMetaAmazon
• Word Search — find a word in a 2D grid.

  CodingMediumAmazonMicrosoft

• Two PointersMedium

  Use two pointers to traverse an array or string from different positions. Common for sorted arrays and palindrome problems.

  Practice:Two Sum II - Input Array Is Sorted
• Sliding WindowMedium

  Maintain a window that slides through a sequence. Used for subarray/substring problems with constraints.

  Practice:Longest Substring Without Repeating Characters
• Fast & Slow PointersEasy

  Two pointers moving at different speeds. Detects cycles in linked lists and finds middle elements.

  Practice:Linked List Cycle
• Merge IntervalsMedium

  Sort intervals by start time and merge overlapping ones. Common in scheduling and calendar problems.

  Practice:Merge Intervals
• Cyclic SortEasy

  Place each number at its correct index. Efficient for finding missing or duplicate numbers in 1-to-n ranges.

  Practice:Find All Numbers Disappeared in an Array
• In-place Reversal of Linked ListEasy

  Reverse a linked list in place by manipulating pointers. Foundation for many linked list problems.

  Practice:Reverse Linked List
• BFS (Breadth-First Search)Medium

  Level-by-level traversal using a queue. Used for shortest path, level order traversal, and graph exploration.

  Practice:Binary Tree Level Order Traversal
• DFS (Depth-First Search)Medium

  Explore as deep as possible before backtracking. Used for tree/graph traversal, path finding, and connected components.

  Practice:Number of Islands
• Two HeapsHard

  Maintain a max-heap and min-heap simultaneously. Used to find medians in streaming data.

  Practice:Find Median from Data Stream
• Subsets / BacktrackingMedium

  Generate all subsets, permutations, or combinations. Recursive exploration with backtracking.

  Practice:Subsets
• Modified Binary SearchMedium

  Apply binary search to sorted or rotated arrays. Also used for search space problems (min/max optimization).

  Practice:Search in Rotated Sorted Array
• Top K ElementsMedium

  Use a heap to efficiently find top/bottom K elements. Better than sorting when K << N.

  Practice:Top K Frequent Elements
• K-way MergeHard

  Merge K sorted lists using a min-heap. Efficiently combines multiple sorted data streams.

  Practice:Merge k Sorted Lists
• Topological SortMedium

  Order vertices in a DAG so every edge goes from earlier to later. Used for dependency resolution and scheduling.

  Practice:Course Schedule
• Dynamic ProgrammingMedium

  Break problems into overlapping subproblems. Build solutions bottom-up or top-down with memoization.

  Practice:Coin Change

Add up to 3 offers to compare total compensation side by side. Click "Add Offer" to start.