#pythonDSA

LeetCode 54 – Spiral Matrix Solved: Return all elements of a matrix in spiral order Used boundaries: top, bottom, left, right Moved layer by layer inward while collecting elements Great for mastering 2D traversal logic! #100DaysOfCode #LeetCode #PythonDSA #MatrixProblems

LeetCode 704 – Binary Search Solved: Classic binary search on sorted array Kept adjusting low, high till target found or not Time complexity: O(log n) Foundations of efficient search algorithms! #LeetCode #PythonDSA #100DaysOfCode #BinarySearch

Day 2 of #60DaysOfPython and #66DaysOfData Bonus questions for Assignment 1 are complete and started using LeetCode for the first time. I'll be taking a look at LinkedLists as my bedtime read haha #WomenWhoCode

Day 9 of #60DaysOfPython and #66DaysOfData Completed Assignment 2 of @JovianML DS&A Course. Started watching Lecture 3. #pythondsa #Jovian

Day 10 of #60DaysOfPython and #66DaysOfData Up to date with my tweets! 😅 Today was another day of doing the minimum, but I continued watching Lecture 3 of the @JovianML DS&A Course. #Pythondsa #Jovian #MergeSort #DataStructures #Algorithms

I need a DSA partner to study it from the very beginning in python. #100DaysOfCode #pythondsa

LeetCode 242 – Valid Anagram Solved: Check if two strings are anagrams Used frequency counting (hashmap) to compare characters. Sorted method works too, but hashmap = more efficient. A neat test of clean string logic! #LeetCode #PythonDSA #LearnInPublic

Day 73 ✅ | #gfg160 Challenge @geeksforgeeks 🔁 Solved: Remove Loop in Linked List ⚙️ Approach: Floyd’s Cycle Detection + Loop Breaker ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(1) ALT = Detailed breakdown below ⬇️ #LinkedList #PythonDSA #GeeksForGeeks #100DaysOfCode

LeetCode 1089 – Duplicate Zeros Solved: Duplicate each zero in the array in-place, shifting elements right Used two passes: Count how many zeros can be duplicated Fill from the back using reverse two-pointer Great for tricky in-place logic! #LeetCode #PythonDSA #ArrayProblems

LeetCode 75 – Sort Colors Solved: Sort an array of 0s, 1s, and 2s in-place Used Dutch National Flag Algorithm Three pointers to sort in one pass → O(n) time, O(1) space Loved how elegant & efficient this approach is! #LeetCode #PythonDSA #SortingAlgorithms

Day 72 ✅ | #gfg160 Challenge @geeksforgeeks 🔁 Solved: Find the First Node of Loop in a Linked List 📌 Approach: Extended Floyd’s Cycle Detection Algorithm ⏱️ Time : O(n) 📦 Space : O(1) ALT = Detailed explanation 👇 #PythonDSA #100DaysOfCode #LinkedList #GeekStreak2025

LeetCode 1021 – Remove Outermost Parentheses Solved: Remove outermost parentheses of every primitive group Used a counter to track depth Built result only when depth > 1 Great practice for stack logic without stack! #LeetCode #PythonDSA #ParenthesesProblem

The best Python dictionary tricks for elegant coding #Python #pythead #pythondsa #pythonlearning #python3

LeetCode 53 – Maximum Subarray Solved: Find the subarray with the maximum sum Applied Kadane’s Algorithm Track running sum, reset if it drops below 0 Time: O(n), Space: O(1) Perfect to build prefix thinking & subarray mastery! #PythonDSA #LeetCode #Kadane #LearnInPublic

LeetCode 31 – Next Permutation Solved: Rearrange array to next lexicographically greater permutation Found dip,swapped with next greater,then reversed suffix Tricky but powerful for mastering permutations Classic problem with smart inplace logic! #LeetCode #PythonDSA #TwoPointers

LeetCode 219 – Contains Duplicate II Solved: Check if duplicate exists within k distance Used a hashmap to store last seen index Compared i - prev_index <= k for match Perfect use of sliding window + hashing combo! #LeetCode #PythonDSA #HashMapLogic

LeetCode 414 – Third Maximum Number Solved: Find the 3rd distinct max number in the array Used a set to track unique values Handled edge case: return max if < 3 distinct numbers Cleans up logic around max tracking & uniqueness! #LeetCode #PythonDSA #ArrayProblems

LeetCode 1299 – Replace Elements with Greatest on Right Solved: Replace each element with the greatest on its right Traversed from right to left, tracked max so far O(n) time, O(1) space — clean in-place solution! Nice reverse traversal practice #LeetCode #PythonDSA #ArrayLogic

LeetCode 724 – Find Pivot Index Solved: Find index where left sum = right sum Calculated total sum, then used running left sum If left == total - left - current, it’s the pivot Great intro to prefix sum logic! #LeetCode #PythonDSA #PrefixSum

LeetCode 35 – Search Insert Position Solved: Find the index to insert target in sorted array Binary Search approach → O(log n) If found, return index. If not, return where it should be inserted. Clean & classic binary search twist! #PythonDSA #LeetCode #BinarySearch

LeetCode 1614 – Maximum Nesting Depth of Parentheses Solved: Find max depth of nested parentheses Traverse string, increment on '(',decrement on ')' Track maximum depth reached O(n) time, O(1)space Simple yet useful stack-like logic! #LeetCode #100DaysOfCode #PythonDSA #Strings

LeetCode 15 – 3Sum Solved: Find all unique triplets that sum to 0 Sorted the array + used two pointers inside a loop Handled duplicates carefully to avoid repeat triplets A solid test of logic, edge cases & efficiency! #LeetCode #PythonDSA #TwoPointers