Solving 5-10 random Leetcode Cheatsheets will only take you so far in your coding interview preparation.
The best thing to do after you’ve prepared your skills is to constantly test yourself and simulate interview conditions.
From this list:
- Pick 2 random problems (1 Hard + 1 Medium)
- Give yourself 50 mins, set up your system like an interview
- Solve and talk out loud how you’re solving, record yourself
- Timing yourself will help you solve under pressure
- Recording yourself will make you see the gaps in your communication
Hard Problems:
- Word Search (Leetcode)
- Largest Rectangle in Histogram (Leetcode)
- Count of Smaller Numbers After Self (Leetcode)
- Flatten Nested List Iterator (Leetcode)
- Unique Binary Search Trees II (Leetcode)
- All Nodes Distance K in Binary Tree (Leetcode)
- Sum of Distances in Tree (Leetcode)
- Binary Tree Cameras (Leetcode)
- Minimum Cost to Hire K Workers (Leetcode)
- Minimum Cost to Merge Stones (Leetcode)
- Remove K Digits (Leetcode)
Medium Problems:
- Add Two Numbers II (Leetcode)
- Path Sum III (Leetcode)
- Construct Binary Tree from Preorder and Postorder Traversal (Leetcode)
- Unique Binary Search Trees (Leetcode)
- Lowest Common Ancestor of a Binary Tree (Leetcode)
- Time Needed to Inform All Employees (Leetcode)
- Vertical Order Traversal of a Binary Tree (Leetcode)
- Knight Dialer (Leetcode)
- Longest Increasing Subsequence (Leetcode)
- Longest Repeating Character Replacement (Leetcode)
- Unique Paths III (Leetcode)
- Making a Large Island (Leetcode)
- Longest Increasing Path in a Matrix (Leetcode)
- Preorder to Postorder (GFG)
- Product Array Puzzle (GFG)
- Check if Reversing Subarray Makes Array Sorted (GFG)
- Minimum Cost to Avoid Repeating Letters (Leetcode)
- Minimum Sum of Two Numbers Formed from Digits Array (GFG)
- Find the Maximum of Minimums for Every Window Size (GFG)
- LRU Cache Implementation (GFG)
- Radix Sort (GFG)
- Make Array Elements Equal – Minimum Cost (GFG)
- Smallest Positive Missing Number (GFG)
- Largest Subarray with 0 Sum (GFG)
- Cutted Segments (GFG)
- Mobile Numeric Keypad (GFG)
- Best Time to Buy and Sell Stock IV (Leetcode)
- Minimum Cost for Acquiring All Coins (GFG)
- Bipartite Graph (GFG)
- Implementing Floyd Warshall (GFG)
- Prims Minimum Spanning Tree (GFG)
- Find Paths from Corner Cell to Middle Cell in Maze (GFG)
Repost this to help others.
This post was originally shared by on Linkedin.