LeetCode Challenge: Subsets II with Duplicates

Day 102 Backtracking patterns are starting to repeat. #Day102 🧩 90. Subsets II How today went: • Similar to the basic Subsets problem • Key difference: handling duplicates • Sorting the array is important • While iterating, skip duplicates to avoid repeating subsets What clicked: Backtracking becomes easier when you: • Recognize the base pattern • Add constraints like duplicate handling Same structure, new rule. That’s how patterns build. #LeetCode #DSA #Python #Backtracking #Recursion #LearningInPublic #Consistency

Day 117 Same pattern, one important tweak. #Day117 🧩 90. Subsets II How today went: • Same base as Subsets • First step: sort the array • While iterating, skip duplicates to avoid repeating subsets • Use the same pattern: append → recurse → pop What I learned: It’s not a new problem — it’s the same pattern with a duplicate filter. Small condition. Big impact. Backtracking is starting to feel predictable. #LeetCode #DSA #Python #Backtracking #Recursion #LearningInPublic #Consistency

🚀 Day [21] of #Geekstreak60 Today’s #POTD was Two Equal Sum Subarrays — a neat exercise in prefix sums, binary search, and validation logic. I solved it in Python using multiple approaches: ✅ Direct prefix sum check ✅ Hash set tracking for generalized detection ✅ Binary search on prefix array for efficient lookup Each method reinforces how different strategies can converge on the same solution, sharpening problem‑solving skills and adaptability. #Coding #Python #Geekstreak60 #ProblemSolving #DSA #GeeksforGeeks #Geekstreak2026 Problem Link : https://lnkd.in/gzdaVpnr Solution Link : https://lnkd.in/gvdHSgwR

Day 106 Some problems feel simple when the pattern clicks. #Day106 🧩 17. Letter Combinations of a Phone Number How today went: • Used a digit → letters map • Built combinations using backtracking • Maintained a string path at each step • One recursive call per choice — no need for complex state handling What I realized: Once you understand the pattern: → choose a letter → move to next digit → build the path Backtracking becomes very natural. Simple problem, but great for building confidence. #LeetCode #DSA #Python #Backtracking #Recursion #LearningInPublic #Consistency

Python Clarity Series – Episode 24 Topic: Late Binding in Loops (Functions) ⚠️ Advanced pitfall: Late binding in loops funcs = [] for i in range(3): funcs.append(lambda: i) for f in funcs: print(f()) Output: 2 2 2 ❗ 👉 Expected: 0 1 2 👉 Got: same value 💡 Reason: Lambda captures variable, not value. 💡 Fix: funcs.append(lambda i=i: i) 💡 Rule: Default arguments capture current value. This is a classic interview trap. #PythonAdvanced #CodingPitfalls #DeveloperLevel #python #clarity

Beyond String Concatenation  When I started, I used to concatenate strings the old-school way. It was messy, prone to errors, and hard to read The Problem: Using + requires manual type conversion (like str(21)) and gets confusing with all the extra quotes and spaces Solution: F-strings Introduced in Python 3.6, F-strings makes your code: ✅ Readable: You see the full sentence structure ✅ Fast: They are more efficient than older methods ✅ Flexible: You can perform math or call methods directly inside { } It’s a small concept, but it’s one of the easiest ways to make code look 10x more professional. #Python #30DaysOfCode #BCA #LearningInPublic #Day21 #JECRC Day 21/30

🚀 Day 17 of My Python + DSA Journey Today’s problem was about finding patterns in sequences 👇 ✅ Longest Consecutive Sequence (#128) 💡 Longest Consecutive Sequence Find the length of the longest consecutive elements sequence 🔍 Approach: Sorted the array → counted consecutive elements while tracking max length ⏱ O(n log n) time | O(1) space 🔥 What I learned today: • Sorting can simplify sequence problems • Handling duplicates is important • Tracking streaks helps solve consecutive patterns Understanding sequences better with each problem ⚡ #Day17 #LeetCode #Python #DSA #CodingJourney #100DaysOfCode

Day 23/100 – DSA Journey Problem: Remove Duplicates from Sorted Linked List A sorted linked list keeps duplicates next to each other, which makes it easy to remove them in one pass. Used simple traversal and pointer updates to skip duplicate nodes without extra space. Key Learning: Always use the structure of the data to simplify the solution. #Day23 #100DaysOfCode #DSA #LinkedList #Python #LeetCode

🔁 Exploring Sorting Algorithms in Python Today I practiced two fundamental sorting techniques: ✅ Bubble Sort ✅ Selection Sort 💡 Key Learnings: * Bubble Sort repeatedly swaps adjacent elements to push larger elements to the end * Selection Sort selects the minimum element and places it in the correct position * Understanding time complexity becomes clearer when you count operations manually #Python #DataStructures #Algorithms #CodingJourney #100DaysOfCode #LearningInPublic

🚀 Solved today’s GeeksforGeeks Problem of the Day: Segregate 0s and 1s using Python 🐍 Problem: Given a binary array, rearrange it in-place such that all 0s come before 1s. Approach: Used the efficient Two Pointer Technique. ✔ Left pointer → finds misplaced 1 ✔ Right pointer → finds misplaced 0 ✔ Swap and move pointers inward 💡 Key Insight: No need for extra space or sorting — we can solve this in O(n) time and O(1) space using pointers. 💡 Concepts Used: Two Pointers | Array Manipulation | In-place Algorithm Sometimes, the simplest problems reinforce the most important techniques used in complex scenarios 🔁 #geekstreak60 #geeksforgeeks #dsa #python #coding #problemSolving #arrays #twopointers