#pythonDSA

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

LeetCode 81 – Search in Rotated Sorted Array II Solved: Like LC33 but with duplicates Modified Binary Search Skip duplicates if nums[left] == nums[mid] == nums[right] Still O(log n) in best case, O(n) worst case due to duplicates #LeetCode #100DaysOfCode #PythonDSA #BinarySearch

Suggest me some best algorithms that can help me to crack a 20 LPA job !! #pythonDSA

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 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

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 1283 – Find the Smallest Divisor Given a Threshold Find the smallest divisor so that sum of [num/div]≤threshold Used binary search on divisor range[1…max(nums)] For each mid, compute sum If sum-threshold:increase divisor Else:shrink search space #LeetCode #PythonDSA

*yesterday Day 6 of #60DaysOfPython and #66DaysOfData It has been a tough day today, so I’m taking things easy. Haven’t made too many changes to my model - but I’m currently waiting for it to finish training - prefect time to tweet! #womanwhocode

Day 7 of #60DaysOfPython and #66DaysOfData Re-did Assignment 1 for the @JovianML Data Structures & Algorithms course. It was another day taking things slow. #pythondsa #womenintech #Python

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

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 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

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

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 557 – Reverse Words in a String III Solved: Reverse each word in the string, keep word order Split → reverse each → join Clean string + array manipulation in Python! Great practice for string traversal & logic! #LeetCode #PythonDSA #StringProblems

LeetCode 118 – Pascal’s Triangle Solved: Generate Pascal’s Triangle up to numRows Built each row from the previous using simple math Classic pattern-building problem — clean & recursive! Loved the structure & symmetry! #LeetCode #PythonDSA #Patterns

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

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 705 – Design HashSet Solved: Build a basic HashSet from scratch Implemented with a list of buckets (chaining method) Covered add(), remove(), contains() Solid intro to DS design & hashing logic #LeetCode #DataStructures #PythonDSA #HashSet

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