Explore tweets tagged as #pythonDSA
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
0
0
12
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
0
0
9
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.
0
0
2
0
0
1
0
0
1
Day 26 . 71. Find Only Repetitive Element from 1 to n-1. #DSA #PYTHON #CODING #PYTHONDSA . Break - 2 days
0
1
0
0
0
1
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.
0
0
4
0
0
0
0
0
0
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.
1
0
2
0
0
0
0
0
0
0
0
0
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.
1
0
4
0
0
0
0
0
0