30 Days of LeetCode Challenge: 3Sum Problem

🚀 Python Learning Journey – Revision Day Today, I revised Day 7, Day 8, and Day 9 topics to strengthen my fundamentals. Here’s what I revised: ✅ Functions (def, arguments, return values) ✅ Built-in string functions ✅ List built-in methods and functions Revision helped me understand concepts more clearly and confidently. Practicing consistently and building a strong foundation 💪 Small steps every day lead to big results. #Python #LearningJourney #Revision #Functions #Strings #Lists #KeepLearning

Day 20/100 – #100DaysOfCode 🚀 Solved LeetCode #448 – Find All Numbers Disappeared in an Array (Python). Today I worked on an array problem to find all the numbers in the range [1, n] that are missing from the given array. Approach: 1) Convert the array into a set for quick lookup. 2) Traverse numbers from 1 to n. 3) Check if each number exists in the set. 4) If not present, add it to the result list. 5) Return the final list of missing numbers. Time Complexity: O(n) Space Complexity: O(n) Learning how sets help in fast lookup and simplify problems 💪 #LeetCode #Python #DSA #Arrays #HashSet #ProblemSolving #100DaysOfCode

Day 37 of #100DaysOfCode 🚀 Built a Sorting Algorithm Visualizer using Python and Tkinter. It visually demonstrates how Bubble Sort works by animating the comparisons and swaps step by step. A fun way to understand algorithmsms, sometimes seeing the logic move makes learning much clearer. #Python #DSA #Algorithms #Tkinter #LearningInPublic #100DaysOfCoding

Day 15 of Python Learning 💻🐍 Today’s focus: input() and print() functions 🐍 These core concepts make programs interactive and meaningful. Building strong fundamentals, one day at a time. Consistency over everything. #Python #LearningPython #PythonBasics #CodingJourney #100DaysOfCode

Learn in Public — Day 14 Today I solved the Subset Array Problem using three different approaches in Python. Problem: Check whether array b is a subset of array a. Approaches I implemented: 1️⃣ Brute Force Check each element of b in a Time Complexity: O(m × n) 2️⃣ Sorting + Two Pointers Sort both arrays and compare Time Complexity: O(m log m + n log n) 3️⃣ Hash Set (Optimal) Convert array a into a set Check membership in O(1) Time Complexity: O(m + n) Key Learning: Whenever fast lookup is needed, hashing is often the best approach. #LearnInPublic #Python #DSA #CodingJourney

“Something new I learned in Python today” Even a correct mathematical function can misbehave because of floating-point precision. Replacing: math.ceil(x / d) with (x + d - 1) // d made the solution both safer and faster :) Love how debugging often turns into unexpected learning ;) #Python #CodingJourney #Debugging #LeetCode

🚀 Day 38/50 – LeetCode Challenge (Python) Continuing the 50-day challenge with a bit manipulation problem that focuses on binary representation and shifting operations. 📌 Problem: Reverse Bits 🧠 Approach: Extract each bit using bitwise operations and rebuild the number in reverse order ✨ Key Learning: Understanding binary operations makes low-level optimizations much clearer and more intuitive. Bit manipulation might look tricky, but patterns make it powerful. 💪 #LeetCode #Python #DSA #BitManipulation #Consistency #LearningInPublic

Day 75 Back to revisiting tree fundamentals. #Day75 🧩 100. Same Tree Solved it again today. What made it easier this time: • Convert the tree structure into string representation • Compare the left and right serialized strings • Python makes this approach very straightforward This problem is simple, but it reinforces an important idea: Sometimes a representation trick can simplify the comparison logic. Small revisions like this keep the patterns fresh. #LeetCode #DSA #Python #BinaryTree #Recursion #LearningInPublic #Consistency

Day 14 | Problem-Solving Practice Back to practice and worked on number system conversions today: • Binary to Decimal conversion • Decimal to Binary conversion Implemented both mathematical logic and built-in approaches to understand the underlying concept as well as practical shortcuts. Continuing to rebuild momentum step by step. GitHub: https://lnkd.in/g35tV9Gj #ProblemSolving #Python #LearningInPublic

🚀 Week 5 of My DSA Journey This week I focused on understanding the fundamentals of Recursion while continuing with Striver’s A2Z DSA Sheet using Python. 🔹 Concepts Covered • What is Recursion • Base Condition • Stack Overflow • Advantages & Disadvantages of Recursion 🔹 Problems Solved • Print Name N times using Recursion • Print numbers from 1 → N (forward recursion) • Print numbers from N → 1 • Sum of first N numbers using recursion • Factorial of a number • Reverse an array (Two Pointer + Recursion approach) • Check if a string is Palindrome using Recursion ✨ Recursion initially felt tricky, but understanding the role of the base condition and recursive calls made the flow much clearer. 📌 Code implementations available here: 👉 https://lnkd.in/d4xbyXKb #DSA #Python #LearningJourney #Consistency #StriverA2Z #ProblemSolving