Daily DSA | Day 67 | LeetCode150 Solved: Partition List (LC86) Idea: Create two separate lists—one for nodes less than x and another for nodes greater or equal to x, then connect them while maintaining relative order. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney

Daily DSA | Day 66 | LeetCode150 Solved: Rotate List (LC61) Idea: Find the length of the list, make it circular, then break it at the correct position based on k to get the rotated list. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #100DaysOfCode #ProblemSolving

Daily DSA | Day 65 | LeetCode150 Solved: Remove Duplicates from Sorted List II (LC 82) Idea: Traverse the sorted list and skip all nodes that have duplicate values, keeping only distinct elements in the result list. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney

Daily DSA | Day 64 | LeetCode150 Solved:Reverse Nodes in k-Group (LC 25) Idea: Reverse nodes in groups of k using pointer manipulation.After reversing one group,recursively process the remaining list and connect them. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney

Daily DSA | Day 63 | LeetCode150 Solved: Remove Nth Node From End of List (LC 19) Idea: Use two pointers. Move the fast pointer n steps ahead, then move both fast and slow together until fast reaches the end. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #100Days

Daily DSA | Day 62 | LeetCode150 Solved: Reverse Linked List II (LC92) Idea: Traverse to the left position, reverse the sublist between left and right, and reconnect the reversed part with the remaining list. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #cricket

Daily DSA | Day 60 | LeetCode150 Solved: Copy List with Random Pointer (LC 138) Idea: First create all nodes, then assign next and random pointers using the map. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #100DaysOfCode #ProblemSolving

Daily DSA | Day 59 | LeetCode150 Solved: Merge Two Sorted Lists (LC 21) Idea: Traverse both lists and compare nodes, attaching the smaller one to the result list. Continue until one list ends, then append the remaining nodes. #LeetCode #LeetCode150 #DSA #CPP #Algorithms

Daily DSA | Day 58 | LeetCode150 Solved: Add Two Numbers (LC 2) Idea: Traverse both linked lists while maintaining a carry. Add corresponding digits and create a new node for each sum, updating the carry accordingly. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney

Daily DSA | Day 57 | LeetCode150 Solved: Linked List Cycle (LC 141) Update: Completed Stack problems and started Linked List section. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #100DaysOfCode #ProblemSolving

Daily DSA | Day 55 | LeetCode150 Solved: Basic Calculator (LC 224) #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #100DaysOfCode #ProblemSolving

Daily DSA | Day 54 | LeetCode150 Solved: Evaluate Reverse Polish Notation (LC150) Idea: Use a stack.when an operator appears, pop the top two numbers, apply the operation, and push back. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #100DaysOfCode #ProblemSolving

Daily DSA | Day 52 | LeetCode150 Solved: Valid Parentheses (LC 20) Progress Update: Completed HashMap problems and starting the Stack section today. #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #100DaysOfCode #ProblemSolving

Daily DSA | Day 51 | LeetCode150 Solved: Minimum Number of Arrows to Burst Balloons (LC 452) Idea: Sort balloons by start position and track the current overlapping end. If the next balloon overlaps, update the minimum end; otherwise, shoot a new arrow. #LeetCode #LeetCode150

Daily DSA | Day 50 | LeetCode150 Solved: Insert Interval (LC 57) Idea: Traverse intervals, add non-overlapping ones, merge overlaps with the new interval, then append remaining intervals #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #100DaysOfCode #ProblemSolving

Daily DSA | Day 49 | LeetCode150 Solved: Merge Intervals (LC 56) Idea: Sort intervals by start time, then merge overlapping ones while traversing #LeetCode #LeetCode150 #DSA #CPP #Algorithms #CodingJourney #100DaysOfCode #ProblemSolving

Daily DSA | Day 48 | LeetCode150 Solved: Summary Ranges (LC 228) Idea: Traverse the sorted array and group consecutive numbers into ranges. Concepts practiced: • Array traversal • Two pointers Language: C++ #LeetCode #LeetCode150 #DSA #CPP #CodingJourney #100DaysOfCode

Daily DSA | Day 47 | LeetCode150 Solved: Longest Consecutive Sequence (LC 128) Concepts practiced: • Hashing concepts • Handling duplicates • Sequence detection logic #LeetCode #LeetCode150 #DSA #HashMap #CPP #CodingJourney #100DaysOfCode #ProblemSolving

Daily DSA | Day 44 | LeetCode150 Solved: Two Sum (LC 1) Approach used: HashMap This reduces the time complexity from O(n²) to O(n). #LeetCode #LeetCode150 #DSA #HashMap #CPP #CodingJourney #ProblemSolving #InterviewPrep

Daily DSA | Day 43 | LeetCode150 Solved: Group Anagrams (LC 49) Concepts used: • Sorting as a key • HashMap for grouping • String manipulation • STL vectors & maps HashMap section getting stronger day by day #LeetCode #LeetCode150 #DSA #HashMap #Strings #CPP #CodingJourney