Day 85 ✅ | #geekstreak2025
Solved: Boundary Traversal of Binary Tree — collected left boundary, leaf nodes, and reversed right boundary as per constraints.
#GFG160#DSA@geeksforgeeks
Day 83 ✅ | #geekstreak2025
Solved: Construct Binary Tree from Inorder and Preorder Traversal — built the tree recursively using hashmap and index pointers, returned the tree in postorder traversal.
#GFG160#DSA@geeksforgeeks
Day 84 ✅ | #geekstreak2025
Solved: In-Order Traversal of Binary Tree — implemented iterative approach and explored Morris traversal for O(1) space optimization.
#GFG160#DSA@geeksforgeeks
Day 82 ✅ | #geekstreak2025
Solved: Mirror of Binary Tree — implemented recursive function to swap left and right subtrees for all nodes and generate the mirror tree.
#GFG160#DSA@geeksforgeeks
Day 81 ✅ | #geekstreak2025
Solved: Diameter of Binary Tree — applied postorder traversal with depth tracking to compute the longest path between any two leaf nodes.
#GFG160#DSA@geeksforgeeks
Day 80 ✅ | #geekstreak2025
Solved: Height of Binary Tree — used recursive DFS to calculate the number of edges in the longest root-to-leaf path.
#GFG160#DSA@geeksforgeeks
Day 79 ✅ | #geekstreak2025
Solved: Level Order Traversal of Binary Tree — implemented breadth-first traversal using a queue to explore nodes level by level from top to bottom.
#GFG160#DSA@geeksforgeeks
Day 78 ✅ | #geekstreak2025
Solved: Word Search in 2D Matrix — tackled a classic DFS + Backtracking problem to check if a word exists in a grid using adjacent horizontal and vertical cells without reusing any cell.
#GFG160#DSA@geeksforgeeks
Day 77 ✅ | #geekstreak2025
Solved: Sudoku Solver — used backtracking to fill in the 9×9 Sudoku grid where blanks were represented by 0s.
Ensured each row, column, and 3×3 sub-grid satisfies the uniqueness constraint for digits 1–9.
#GFG160#DSA#Backtracking@geeksforgeeks
Day 76 ✅ | #geekstreak2025
Solved: N-Queens Puzzle — implemented a backtracking algorithm to generate all valid placements of n queens on an n×n chessboard such that no two queens attack each other.
#GFG160#DSA#Backtracking#NQueens@geeksforgeeks
Day 75 ✅ | #geekstreak2025
Solved: Exponentiation by Squaring — implemented the power(b, e) function to efficiently compute beb^ebe using divide-and-conquer approach, reducing time complexity from O(e) to O(log e).
#GFG160#DSA#Maths#DivideAndConquer@geeksforgeeks
Day 74 ✅ | #geekstreak2025
Solved: Unique String Permutations — used backtracking with a set to avoid generating duplicate permutations. Handled repeated characters and ensured only distinct permutations were returned.
#GFG160#DSA#Backtracking#Strings@geeksforgeeks
Day 72 ✅ | #geekstreak2025
Solved: Remove loop from a singly linked list — used Floyd’s Cycle Detection Algorithm to detect the loop and then identified the node before the start of the loop to break the cycle.
#GFG160#DSA#LinkedList@geeksforgeeks
Day 71 ✅ | #geekstreak2025
Solved: Find the starting node of a loop in a singly linked list — used Floyd’s Cycle Detection Algorithm to detect the loop, then moved pointers to locate the first node where the cycle begins.
#GFG160#DSA#LinkedList@geeksforgeeks
Day 70 ✅ | #geekstreak2025
Solved: Detect Loop in Linked List — implemented Floyd’s Cycle Detection Algorithm (Tortoise and Hare) to efficiently identify if a cycle exists in the linked list using constant space.
#GFG160#DSA#LinkedList@geeksforgeeks
Day 68 ✅ | #geekstreak2025
Solved: Add Two Numbers Represented by Linked Lists . Managed carry-over and removed leading zeros from the result. Practiced edge cases like unequal lengths and trailing zeros.
#GFG160#DSA@geeksforgeeks
Day 69 ✅ | #geekstreak2025
Solved: Clone a Linked List with Random and Next Pointers — used constant extra space technique by interweaving copied nodes with original ones.
Ensured the original list remained unmodified.
#GFG160#DSA#LinkedList@geeksforgeeks