#pythonDSA

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

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

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

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

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

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

LeetCode 941 – Valid Mountain Array Solved: Check if the array forms a valid mountain shape Strictly increasing, then strictly decreasing Used two-pointer climb + descent logic Edge cases = key here Great mix of condition checks & pointer flow! #LeetCode #PythonDSA #ArrayProblems

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 706 – Design HashMap Solved: Implement a basic HashMap from scratch Used array of buckets + handled collisions with chaining (lists) Implemented put(), get(), and remove() Great practice for building core data structures! #LeetCode #PythonDSA #basics

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 540 – Single Element in a Sorted Array Find element that appears once in sorted array Binary search with index parity logic Pairs start at even index before single element Shift search space based on mid’s pairing O(log n) time, O(1) space #BinarySearch #DSA #PythonDSA

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 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 1051 – Height Checker Solved: Count students not in the correct height order Compared original array with its sorted version Counted mismatched positions Simple but highlights sorting + comparison logic! #LeetCode #PythonDSA #SortingProblems

Contains Duplicate Problem: Check if any value appears at least twice in the array. Sounds simple, but it’s a great warm-up for understanding hashing. Explored: Brute: O(n²) – nested loops Optimal: O(n) – used set() to track seen values #LeetCode #PythonDSA #AkshaySaini

LeetCode 49 – Group Anagrams Solved: Group strings that are anagrams of each other Used hashmap with sorted string as key Collected anagrams into lists based on character signature. Great use of hashmaps + sorting combo! #LeetCode #PythonDSA #HashMap #LearnInPublic

LeetCode 796 – Rotate String Solved: Check if one string is rotation of another Trick: s2 must be a substring of s1 + s1 Simple check with in operator O(n²) worst-case, O(1) extra space Neat and elegant string trick! #LeetCode #100DaysOfCode #PythonDSA #Strings #DSA

LeetCode 125 – Valid Palindrome Solved: Check if a string is a valid palindrome (ignore cases & non-alphanumerics) Cleaned string using regex + .lower() Two-pointer check from both ends Classic string + pointer logic! #LeetCode #PythonDSA #StringProblems #DSA

LeetCode 151 – Reverse Words Task: Reverse the order of words, not characters. Input: " hello world " → Output: "world hello" Used: split(), reverse(), join() Focus: Clean strings, trim spaces, reverse logic. #LeetCode #PythonDSA #StringManipulation #LearnInPublic