6.2 KiB
| id | title |
|---|---|
| best-practice-questions | Best Practice Questions |
Here is a suggested schedule for revising and practicing algorithm questions on LeetCode. Sign up for an account if you don't already have one, it's critical to your success in interviewing!)
Week 1
In week 1, we will start off easy and do a mix of easy and medium questions on arrays and strings. Arrays and strings are the most common types of questions to be found in interviews; gaining familiarity with them will help in building strong fundamentals to better handle tougher questions.
- Two Sum
- Contains Duplicate
- Best Time to Buy and Sell Stock
- Valid Anagram
- Valid Parentheses
- Product of Array Except Self
- Maximum Subarray
- 3Sum
- Merge Intervals
- Group Anagrams
Optional
Week 2
The focus of week 2 is on Linked List, string and matrix-based questions.
- Reverse a Linked List
- Detect Cycle in a Linked List
- Container With Most Water
- Find Minimum in Rotated Sorted Array
- Longest Repeating Character Replacement
- Longest Substring Without Repeating Characters
- Number of Islands
- Remove Nth Node From End Of List
- Pacific Atlantic Water Flow
- Merge K Sorted Lists
Week 3
The focus of week 3 is on non-linear data structures like trees, graphs and heaps.
- Validate Binary Search Tree
- Invert/Flip Binary Tree
- Palindromic Substrings
- Non-overlapping Intervals
- Serialize and Deserialize Binary Tree
- Minimum Window Substring
- Construct Binary Tree from Preorder and Inorder Traversal
- Top K Frequent Elements
- Clone Graph
- Course Schedule
- Binary Tree Maximum Path Sum
Optional
- Maximum Depth of Binary Tree
- Same Tree
- Binary Tree Level Order Traversal
- Encode and Decode Strings (Leetcode Premium)
Week 4
Week 4 builds up on knowledge from previous weeks but questions are of increased difficulty. Expect to see such level of questions during interviews.
- Add and Search Word
- Implement Trie (Prefix Tree)
- Subtree of Another Tree
- Kth Smallest Element in a BST
- Lowest Common Ancestor of BST
- Merge K Sorted Lists
- Find Median from Data Stream
- Insert Interval
- Longest Consecutive Sequence
- Word Search II
Optional
- Meeting Rooms (Leetcode Premium)
- Meeting Rooms II (Leetcode Premium)
- Alien Dictionary (Leetcode Premium)
- Graph Valid Tree (Leetcode Premium)
- Number of Connected Components in an Undirected Graph (Leetcode Premium)
Week 5
Week 5 focuses on Dynamic Programming questions.