-
I use LC time tracking to keep track of how many times I solves a question and how long I spent each time. Once I finish non-trivial medium LC questions 3 times, I have absolutely no issues solving them in actual interviews (sometimes within 8-10 minutes). It makes a big difference. A better way is to use LeetPlug chrome extension here
-
This Leetcode post combines 36 tips and tricks in improving Leetcode problem solving skills.
-
You can to solve Medium question within 20 minutes with little to no bug and clean code.
-
You can solve medium question with 2,3 different solutions (recursive, top-down DP with memorization, bottom-up DP, bfs/dfs).
-
You can estimate time complexity for your algorithm correctly.
-
Leetcode by topics for beginnier: https://leetcode.com/discuss/career/448024/Topic-wise-problems-for-Beginners
-
Leetcode list by topics (more comprehensive): https://protegejj.gitbook.io/oj-practices/chapter1/dynamic-programming
- 75 Sort Colors
- 80 Remove Duplicates from Sorted Array II
- 88 Merge Sorted Array
- 457 Circular Array Loop
- 713 Subarray Product Less Than K
- 845 Longest Mountain in Array
- 904 Fruit into baskets
- 925 Long Pressed name
- 986 Interval list intersections
- 33 Search in rotated sorted array
- 69 Sqrt(x)
- 153 Find min in rotated sorted array
- 349 Intersection of two arrays
- 441 Arranging coins
- 475 Heaters
- 658 Find K closest elements
- 911 Online Election
- Divide two integers
- Find in sorted array
- Search in rotated array
- 463 Island Perimeter
- 535 Encode and decode TinyURL
- 575 Distribute Candies
- 739 Daily Temperatures
- 748 Shortest Completing Word
- 811 Subdomain visit count
- 884 Uncommon words from Twos sentences
- 953 Verifying an Alien Dictionary
- 961 N-Repeated Element in Size 2N Array
- 1160 Find words that can be formed by characters
- 1078 Occurences after bigram
- 496 Next Greater Element I
- 682 Baseball Game
- 856 Score of Parentheses
- 946 Validate Stack Sequences
- 1190 Reverse Substrings Between Each Pair of Parentheses
- 1209 Remove All Adjacent Duplicates in String II
- 468 Validate IP Address
- 522 Longest Uncommon Subsequence II
- 539 Minimum Time Difference
- 553 Optimal Division
- 791 Custom Sort String
- 833 Find and replace in String
- 835 Image Overlap
- 893 Groups of Special-Equivalent Strings
- 1156 Swap For Longest Repeated Character Substring
- 424 Longest Repeating Character Replacement
- 1040 Moving Stones Until Consecutive II
- 101 Symmetric Tree
- 108 Convert Sorted Array to Binary Search Tree
- 226 Invert Binary Tree
- 538 Convert BST to Greater Tree
- 543 Diameter of a Binary Tree
- 637 Average of Levels in Binary Tree
- 654 Maximum Binary Tree
- 669 Trim a Binary Search Tree
- 589 N-ary Tree Preorder Traversal
- 894 All Possible Full Binary Trees
- 979 Distribute Coins in Binary Tree
- 993 Cousins in a Binary Tree
- 1022 Sum of Root To Leaf Binary Numbers
- 1104 Path In Zigzag Labelled Binary Tree
- 1110 Delete Nodes And Return Forest
- Ser/deser tree
- Distributed coins in tree
- Course schedule ii
- Rotting oranges
- Maximum depth of tree
- Maximum differences between node and ancestor
- Lowest common ancestor in binary tree
- Critical connections
- Task scheduler
- Coin change
- Word break ii
- Word search ii
- Combination sum iv
- Frog jump
- Number of islands
- Permutations
- Subset ii
- Contrary to popular belief, no body really asked LinkedList questions during the interview. There is one exception where you need to use LinkedList to implement LRU. Copy list with random pointer
- If you're interested to learn more about paid ML system design course with more examples, click here.
- If you find this helpful, you can Sponsor this project. It's cool if you don't.