Open
Description
This study plan is for those who want to prepare for technical interviews but are uncertain which problems they should focus on. The problems have been carefully curated so that levels 1 and 2 will guide beginner and intermediate users through problems that cover the data structures and algorithms necessary to succeed in interviews with most mid-tier companies. While level 3 provides material to help users whose targets are top-tier companies.
Level 1
Day 1: Prefix Sum
- 1480. Running Sum of 1d Array
- 724. Find Pivot Index
Day 2: String
- 205. Isomorphic Strings
- 392. Is Subsequence
Day 3: Linked List
- 21. Merge Two Sorted Lists
- 206. Reverse Linked List
Day 4: Linked List
- 876. Middle of the Linked List
- 142. Linked List Cycle II
Day 5: Greedy
- 121. Best Time to Buy and Sell Stock
- 409. Longest Palindrome
Day 6: Tree
- 589. N-ary Tree Preorder Traversal
- 102. Binary Tree Level Order Traversal