Study Plan for Coding Interviews
Inspired by this article
Week 1: Arrays and Strings
Sunday
- Reading - Interview Cake (All readings under #1)
- Easy: Valid ()
Monday
- Easy : Reverse Vowels in a string
- Medium: Longest Substring
Tuesday
- Easy : Isomorphic Strings
- Medium - Container with Most water
Wednesday
-
Easy - Count and say
-
Medium - longest substring
Thursday
- Easy - Remove Duplicates from sorted array
- Medium - Next Permutation
Friday
- Medium - Max product subarray
- Medium - Longest palindrome
Saturday
- Hard - Median of Two Sorted Arrays
Week 2 Binary Trees and Linked Lists
Sunday
Monday
- Easy : Balanced binary tree
- Medium: K smallest element in BST
Tuesday
- Easy : Palindrome Linked Lists
- Medium Remove Nth Node from List
Wednesday
Thursday
- Easy Same tree
- Medium: Partition list
Friday
- Medium: Unique Binary search trees 2
- Medium Copy list with random pointer
Saturday
- Hard: Reverse Nodes in k-Group
Week 3 Dynamic Programming & Greedy Algorithms | Focusing on Optimizations
Sunday
Monday
- Easy : Best time to buy and sell stock
- Medium Longest palindromic substring
Tuesday
- Easy : House robber
- Medium Coin change
Wednesday
-
Easy Maximum Subarray
-
Medium: Triangle
Thursday
- Easy Best Time to Buy and Sell Stock II
- Medium Jump Game
Friday
- Medium Word Break
- Medium Wiggle Subsequence
Saturday
Week 4- Review Review Review
Sunday
- Reading : tbd
- Decide which problems to review (previous incorrect ones)
Monday + Tuesday tbd
- Review problems
Wednesday
-
Medium Rotate Image
-
Medium Course Schedule
- Medium:validate BST
Thursday
- Medium Merge Intervals
- Medium Delete Node BST
Thursday
- Hard
- Hard
Friday
- Hard
- Hard
Saturday
- Hard
- Hard