Day 51/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Add Two Numbers using a Linked List
Β»β Approach
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 51/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Add Two Numbers using a Linked List
Β»β Approach
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 51/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Add Two Numbers using a Linked List
Β»β Approach
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 50/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Check Palindrome in Linked List
Β»β Brute Force Approach
Β»π Optimized Approach
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 50/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Check Palindrome in Linked List
Β»β Brute Force Approach
Β»π Optimized Approach
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 50/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Check Palindrome in Linked List
Β»β Brute Force Approach
Β»π Optimized Approach
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 49/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Sort 0's, 1's and 2's in a Linked List
Β»βοΈ Merge Two Sorted Linked List
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 49/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Sort 0's, 1's and 2's in a Linked List
Β»βοΈ Merge Two Sorted Linked List
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 49/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Sort 0's, 1's and 2's in a Linked List
Β»βοΈ Merge Two Sorted Linked List
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 48/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Remove Duplicates from a Sorted Linked List
Β»βοΈ Remove Duplicates from an Unsorted Linked List
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 48/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Remove Duplicates from a Sorted Linked List
Β»βοΈ Remove Duplicates from an Unsorted Linked List
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 48/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Remove Duplicates from a Sorted Linked List
Β»βοΈ Remove Duplicates from an Unsorted Linked List
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 47/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Detect Cycle in a Linked List
Β»βοΈ Floyd's Cycle Detection / Hare-Tortoise Algorithm
Β»π Find starting node of loop in Linked List
Β»π Remove loop from Linked List
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 47/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Detect Cycle in a Linked List
Β»βοΈ Floyd's Cycle Detection / Hare-Tortoise Algorithm
Β»π Find starting node of loop in Linked List
Β»π Remove loop from Linked List
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Day 47/140: Data Structures & Algorithms
Learnings/Practice:
Β»π Detect Cycle in a Linked List
Β»βοΈ Floyd's Cycle Detection / Hare-Tortoise Algorithm
Β»π Find starting node of loop in Linked List
Β»π Remove loop from Linked List
#100DaysOfCode#DSA#GeeksforGeeks#gfg160
Problem #14: Binary Tree Inorder Traversal (LC #94)
Concept: Inorder Traversal + Recursion
Core Logic: Used recursive DFS to visit nodes in left-root-right order and store values in the result list.
#LeetCode#DSA#CPlusPlus#GeeksForGeeks#gfg160#BinaryTree#Recursion