Sumit G

I just published The Perfect Structure for a Large, Production-Ready FastAPI App medium.com/p/the-perfect-…

Day 137 of LeetCode 🧠 Rotting Oranges (BFS) Queue all rotten oranges first, then spread level by level. Multi-source BFS pattern. #LeetCode #Python #DSA

Day 136 of LeetCode 🧠 Clone Graph (DFS) DFS + hashmap for original → cloned nodes. Tracking references is the main trick. #LeetCode #Python #DSA

Day 135 of LeetCode 🧠 Max Area of Island (BFS) Same traversal pattern as Number of Islands, but track max area instead of count. #LeetCode #Python #DSA

Day 134 of LeetCode 🧠 Number of Islands (BFS) Traverse grid → BFS on land → count islands. Graph journey begins 🌊 #LeetCode #Python #DSA

Day 133 of LeetCode 🧠 Binary Tree Level Order Traversal Revision day. Using deque for BFS traversal level by level. #LeetCode #Python #DSA

Day 132 of LeetCode 🧠 N-Queens Row-wise placement + column/diagonal checks. Constraints guide the solution. Needs more revision. #LeetCode #Python #DSA

Day 131 of LeetCode 🧠 Letter Combinations of a Phone Number Mapping + backtracking (i+1). Same pattern, cleaner execution. #LeetCode #Python #DSA

Day 130 of LeetCode 🧠 Palindrome Partitioning (Backtracking) Check s[i:j+1] → if palindrome, pick & continue. Partitioning + validation. #LeetCode #Python #DSA

Day 129 of LeetCode 🧠 Word Search (Backtracking) Grid traversal + visited tracking. Feels like Rat in a Maze. Short session, still showed up. #LeetCode #Python #DSA

Day 128 of LeetCode 🧠 Generate Parentheses (Backtracking) Track open/close → only valid moves. Constraints guide the solution. #LeetCode #Python #DSA

Day 127 of LeetCode 🧠 Permutations (Backtracking) Pick element → mark visited → backtrack. Classic pattern. #LeetCode #Python #DSA

Day 126 of LeetCode 🧠 Letter Case Permutation (Backtracking) Feels like subsets + upper/lower choice. Patterns are getting familiar. #LeetCode #Python #DSA

Day 125 🔁 Combination Sum II Sort + i+1 Skip duplicates carefully Trap: nums[i] == nums[i-1] ❌ i > start && nums[i] == nums[i-1] ✅ Details matter. #LeetCode #Python #DSA

Day 124 🔁 Combination Sum Pick → track total == target → store > target → stop Pop → try next. Clean backtracking flow. #LeetCode #Python #DSA

Day 123 🔁 Subsets II Pick / not pick Sort + skip duplicates Same pattern, better control. #LeetCode #Python #DSA

Day 122 🔁 Subsets Pick / not pick i+1 both sides Simple recursion, clean logic. #LeetCode #Python #DSA

Day 121 🔁 Generate Parentheses open < n → '(' close < open → ')' Follow rules → valid strings. #LeetCode #Python #DSA

Day 120 🔁 Permutations Use visited[] Pick unused → recurse → unmark Try all choices at each level. #LeetCode #Python #DSA

Day 119 🔁 Combination Sum II Sort + no reuse (i+1) Skip duplicates Same pattern, new rule. #LeetCode #Python #DSA

Day 118 🔁 Combination Sum Stay at i → reuse i+1 → move Track total → backtrack Pattern clearer now. #LeetCode #Python #DSA