Explore tweets tagged as #gfg160daysofcode
🔁 Day2of #GFG160DaysOfCode.📌 Problem: Reverse an Array.👨💻 Language: Java.💡 Logic: Two-pointer technique — swap from both ends till middle.📈 Lesson: Efficient in-place array manipulation without extra space!.#Java #DSA #100DaysOfCode
0
0
4
✅ Day 2 of #GFG160DaysOfCode.📌 Problem: Move All Zeroes to End.📊 Status: Solved using in-place logic in Java.📈 Learned how to maintain relative order without extra space. Practicing daily to improve array manipulation skills!.#100DaysOfCode #Java #CodingChallenge. Screenshot
0
0
4
Day 4 of #GFG160DaysOfCode ✅.Solved Left Rotate an Array by d Places (In-Place) 🔄.👉 No extra space used, mastered array reversal trick! 💡.Every day, a new level unlocked! 🚀 .#gfg160Day .@geeksforgeeks
0
0
3
Day 6 of #GFG160DaysOfCode ✅.Solved Majority Element II 🔍.👉 Found all elements appearing more than ⌊n/3⌋ times using Boyer-Moore Voting Algorithm 💡.Loving the algorithmic depth! 🚀.#gfg160Day.@geeksforgeeks
0
0
1
Day 5 of #GFG160DaysOfCode ✅.Solved Next Permutation 🔢.👉 Implemented in-place algorithm to rearrange numbers into the next lexicographical order! 💡.Getting better at mastering tricky logic! 🚀.#gfg160Day.@geeksforgeeks
0
0
4
🚀 Day 53 of #gfg160DaysOfCode #GFG #DSA.✅ Solved: Find the Pair with Sum Closest to Target.🧠 Logic: Sorted array, used two-pointer approach.🔁 Time: O(n log n) | Space: O(1).💻 Python | 🧪 1115/1115.⚡ 0.22 sec | 🎯 1/1 | 💯 2/2.📈 Total Score: 189.@geeksforgeeks
0
0
2
DAY 98.Approach : Find median in a stream.TC:O(n logn).SC:O(n).#gfg160 #GFG #gfg160daychallenge #gfg160daysofcode
1
0
24
Day 92 of #GFG160DaysOfCode 🌳.Problem: Find LCA of two nodes in BST.🔍 Traverse down based on node values.First split point = LCA!.#BST #LCA #Python #DSA
0
0
0
Day 42 /160 👨💻 @geeksforgeeks #160days .Question🙋. Two Sum Pair with Given Sum. Easy✅. #gfg160 #geeksstreak2025 #GFG2025 .#DSA #CPP25 #CodingChallenge .#gfg160daysofcode
0
0
1
Day 4/160✅ @geeksforgeeks .Problem: Rotate Array .Test Cases Passed: 1115/1115.Time Taken: 0.19s.#gfg160 #GFG160DaysOfCode #DSA #CodeDaily
0
0
2
Day 3/160✅ @geeksforgeeks .Problem: Reverse an Array.Test Cases Passed: 1115/1115.Time: 0.08s.#gfg160 #GFG160DaysOfCode #DSA #CodeDaily
0
0
2
Day 1/160 ✅ @geeksforgeeks .Problem: Second Largest.Test Cases Passed: 1120/1120.Time: 0.29s.#GFG160DaysOfCode #DSA #CodeDaily
0
0
2
Day 2/160✅ @geeksforgeeks .Problem: Move All Zeros to End.Test Cases Passed: 1115/1115.Time: 0.2s.#GFG160DaysOfCode #gfg160 #DSA #CodeDaily
0
0
4
Day 81 of #GFG160DaysOfCode 🌲.Problem: Height of a Binary Tree.#BinaryTree #TreeHeight #Recursion #DSA #Python #GFGPractice #100DaysOfCode
0
0
0
Day 83 of #GFG160DaysOfCode 🌲.Problem: Construct Binary Tree from Inorder & Preorder Traversal.#BinaryTree #TreeConstruction #Python #DSA #GFGPractice #100DaysOfCode
0
0
0
Day 82 of #GFG160DaysOfCode 🌳.Problem: Diameter of a Binary Tree.#BinaryTree #DFS #TreeDiameter #DSA #Python #GFGPractice #100DaysOfCode
0
0
0
Day 86 of #GFG160DaysOfCode 🌳.Problem: Maximum Path Sum in Binary Tree.✔️ Finds the max sum of any path (can start & end at any node).✔️ Uses recursion & post-order traversal.Classic tree DP problem!.#BinaryTree #MaxPathSum #DSA #Python #GFGPractice #100DaysOfCode
0
0
1
Day 87 of #GFG160DaysOfCode 🌲.Problem: Count Paths with Sum K in Binary Tree.✔️ Uses Prefix Sum + HashMap.✔️ Efficient O(N) solution with recursion.A classic path sum counting trick!.#BinaryTree #PrefixSum #DSA #Python #GFGPractice #100DaysOfCode
0
0
1
Day 85 of #GFG160DaysOfCode 🌿.Problem: Boundary Traversal of Binary Tree.🔸 Left Boundary ➡️ Leaves ➡️ Right Boundary (in reverse).🔸 Avoids duplicate leaves.🔸 Classic tree interview question.#BinaryTree #BoundaryTraversal #Python #DSA #GFGPractice #100DaysOfCode
1
0
1