This will be a daily journal on my progress through the Neetcode 150.
I will update this repository everyday, no matter my progress on the 150. If there are days where I make no progress, I will still update to show that I have no progress. As taken advice from reddit, I plan to have some rules for myself throughtout this journey. Rule #1: Have Fun :) Rule #2: Spend max an hour on each problem, and look up solutions if I'm not close to a solution. Rule #3: Do at least 2 problems a day. So with rule 2, this will be 2 hours a day on neetcode. Could potentially solve more if time spent is less than an hour on each problem. These are the 3 rules I have so far, and may update them in the future if need be.
| # | Category | Problem | Problem Link | Optimal TSC? | Solved? |
|---|---|---|---|---|---|
| 1 | 1 Arrays And Hashing | 1 Contains Duplicate | 1_Contains_Duplicate.py | β | β |
| 2 | 1 Arrays And Hashing | 2 Valid Anagram | 2_Valid_Anagram.py | β | β |
| 3 | 1 Arrays And Hashing | 3 Two Sum | 3_Two_Sum.py | β | β |
| 4 | 1 Arrays And Hashing | 4 Group Anagrams | 4_Group_Anagrams.py | β | β |
| 5 | 1 Arrays And Hashing | 5 Top K Frequent Elements | 5_Top_K_Frequent_Elements.py | β | β |
| 6 | 1 Arrays And Hashing | 6 Encode And Decode Strings | 6_Encode_and_Decode_Strings.py | β | β |
| 7 | 1 Arrays And Hashing | 7 Products Of Array Except Self | 7_Products_of_Array_Except_Self.py | β | β |
| 8 | 1 Arrays And Hashing | 8 Valid Sudoku | 8_Valid_Sudoku.py | β | β |
| 9 | 1 Arrays And Hashing | 9 Longest Consecutive Sequence | 9_Longest_Consecutive_Sequence.py | β | β |
| 10 | 2 Two Pointers | 10 Valid Palindrome | 10_Valid_Palindrome.py | β | β |
| 11 | 2 Two Pointers | 11 Two Integer Sum Ii | 11_Two_Integer_Sum_II.py | β | β |
| 12 | 2 Two Pointers | 12 3Sum | 12_3Sum.py | β | β |
| 13 | 2 Two Pointers | 13 Container With Most Water | 13_Container_With_Most_Water.py | β | β |
| 14 | 2 Two Pointers | 14 Trapping Rain Water | 14_Trapping_Rain_Water.py | β | β |
| 15 | 3 Sliding Window | 15 Best Time To Buy And Sell Stock | 15_Best_Time_to_Buy_and_Sell_Stock.py | β | β |
| 16 | 3 Sliding Window | 16 Longest Substring Without Repeating Characters | 16_Longest_Substring_Without_Repeating_Characters.py | β | β |
| 17 | 3 Sliding Window | 17 Longest Repeating Character Replacement | 17_Longest_Repeating_Character_Replacement.py | β | β |
| 18 | 3 Sliding Window | 18 Permutation In String | 18_Permutation_in_String.py | β | β |
| 19 | 3 Sliding Window | 19 Minimum Window Substring | 19_Minimum_Window_Substring.py | β | β |
| 20 | 3 Sliding Window | 20 Sliding Window Maximum | 20_Sliding_Window_Maximum.py | β | β |
| 21 | 4 Stack | 21 Valid Parentheses | 21_Valid_Parentheses.py | β | β |
| 22 | 4 Stack | 22 Minimum Stack | 22_Minimum_Stack.py | β | β |
| 23 | 4 Stack | 23 Evaluate Reverse Polish Notation | 23_Evaluate_Reverse_Polish_Notation.py | β | β |
| 24 | 4 Stack | 24 Generate Parentheses | 24_Generate_Parentheses.py | β | β |
| 25 | 4 Stack | 25 Daily Temperatures | 25_Daily_Temperatures.py | β | β |
| 26 | 4 Stack | 26 Car Fleet | 26_Car_Fleet.py | β | β |
| 27 | 4 Stack | 27 Largest Rectangle In Histogram | 27_Largest_Rectangle_In_Histogram.py | β | β |
Check out Journal/ for daily progress logs.
- Python 3.10+
- Neetcode.io
- PyCharm
- Git + GitHub
- β± Solve 2+ problems every day
- π§Ό Write clean, understandable code
- βοΈ Reflect in daily journal entries