Day 39/50 of the DSA Grind!
Problem: Combination Sum II
Technique: Backtracking + Pruning Duplicates
Status: 13 ms | 16.36 MB Accepted
Sorting candidates and pruning duplicate branches on the fly to build unique combinations!
#50DaysOfDSA #LeetCode #CPP
Problem: Combination Sum II
Technique: Backtracking + Pruning Duplicates
Status: 13 ms | 16.36 MB Accepted
Sorting candidates and pruning duplicate branches on the fly to build unique combinations!
#50DaysOfDSA #LeetCode #CPP
1
0
2
53
Day 39/50 of the DSA Grind!
Problem: Combination Sum
Technique: Backtracking & Recursion
Status: 8 ms | 17.03 MB (Beats 23.57%)
Exploring all valid candidate combinations using recursive backtracking to hit the target sum. Clean execution!
#50DaysOfDSA #LeetCode #CPP
Problem: Combination Sum
Technique: Backtracking & Recursion
Status: 8 ms | 17.03 MB (Beats 23.57%)
Exploring all valid candidate combinations using recursive backtracking to hit the target sum. Clean execution!
#50DaysOfDSA #LeetCode #CPP
2
0
3
93
Day 37/50 of the DSA Grind!
Problem: Container With Most Water
Technique: Two Pointers
Status: 1 ms (Beats 46.05%) | 62.68 MB (Beats 99.49%)
Maximizing area by shrinking pointers inward based on the minimum height. Clean optimal execution!
#50DaysOfDSA #LeetCode #CPP
Problem: Container With Most Water
Technique: Two Pointers
Status: 1 ms (Beats 46.05%) | 62.68 MB (Beats 99.49%)
Maximizing area by shrinking pointers inward based on the minimum height. Clean optimal execution!
#50DaysOfDSA #LeetCode #CPP
1
0
2
64
Day 36/50 of the DSA Grind!
Problem: Two Sum II - Input Array Is Sorted
Technique: Two Pointer
Status: 2 ms | 25.52 MB Accepted
Leveraging the sorted property with a two-pointer approach to shrink search space efficiently!
#50DaysOfDSA #LeetCode #CPP
Problem: Two Sum II - Input Array Is Sorted
Technique: Two Pointer
Status: 2 ms | 25.52 MB Accepted
Leveraging the sorted property with a two-pointer approach to shrink search space efficiently!
#50DaysOfDSA #LeetCode #CPP
1
0
4
103
Day 35/50 of the DSA Grind!
Problem: Valid Palindrome
Technique: Two Pointers
Status: 0 ms | 9.86 MB (Beats 75.92% Memory)
Filtering non-alphanumeric chars on the fly & comparing from both ends. Clean linear scan!
#50DaysOfDSA #LeetCode #CPP
Problem: Valid Palindrome
Technique: Two Pointers
Status: 0 ms | 9.86 MB (Beats 75.92% Memory)
Filtering non-alphanumeric chars on the fly & comparing from both ends. Clean linear scan!
#50DaysOfDSA #LeetCode #CPP
1
0
2
54
Day 33/50 of the DSA Grind!
Problem: Merge Intervals
Technique: Sorting + Linear Scan
Status: 6 ms | 23.66 MB
Sorting start times and merging overlapping intervals in one pass. Clean execution!
#50DaysOfDSA #LeetCode #CPP
Problem: Merge Intervals
Technique: Sorting + Linear Scan
Status: 6 ms | 23.66 MB
Sorting start times and merging overlapping intervals in one pass. Clean execution!
#50DaysOfDSA #LeetCode #CPP
2
0
2
103
Day 33/50 of the DSA Grind
Problem: Merge Intervals
Technique: Sorting + Linear Scan
Status: 6 ms | 23.66 MB (Beats 94.65% Memory)
Sorting start times and merging overlapping intervals in one pass. Clean execution!
#50DaysOfDSA #LeetCode #CPP
Problem: Merge Intervals
Technique: Sorting + Linear Scan
Status: 6 ms | 23.66 MB (Beats 94.65% Memory)
Sorting start times and merging overlapping intervals in one pass. Clean execution!
#50DaysOfDSA #LeetCode #CPP
0
0
2
101
Day 32/50 of the DSA Grind!
Concept: Pattern Printing practice
Technique: Nested Loop Logic & Indexing Manipulation
Status: Executed & Verified
Sharpening core loop controls with pattern building! Clean execution step-by-step.
#50DaysOfDSA #LeetCode #CPP
Concept: Pattern Printing practice
Technique: Nested Loop Logic & Indexing Manipulation
Status: Executed & Verified
Sharpening core loop controls with pattern building! Clean execution step-by-step.
#50DaysOfDSA #LeetCode #CPP
1
0
3
76
Day 31/50 of the DSA Grind!
Problem: Find Min in Rotated Sorted Array
Result: 0 ms (Beats 100%) | 14.04 MB
Hunting down the inflection point using modified binary search in O(log N) time!
#50DaysOfDSA #LeetCode #CPP
Problem: Find Min in Rotated Sorted Array
Result: 0 ms (Beats 100%) | 14.04 MB
Hunting down the inflection point using modified binary search in O(log N) time!
#50DaysOfDSA #LeetCode #CPP
2
0
6
159
Day 30/50 of the DSA Grind!
Problem: Maximum Subarray
Technique: Kadane's Algorithm (O(N)Time)
Status: 0 ms (Beats 100%) | Beats 80.75% Memory
Hit Day 30 with a classic! Resetting negative sums keeps it super efficient.
#50DaysOfDSA #LeetCode #CPP
Problem: Maximum Subarray
Technique: Kadane's Algorithm (O(N)Time)
Status: 0 ms (Beats 100%) | Beats 80.75% Memory
Hit Day 30 with a classic! Resetting negative sums keeps it super efficient.
#50DaysOfDSA #LeetCode #CPP
2
0
3
129
Day 29/50 of the DSA Grind!
Concept: Product of Array Except Self
Technique: Prefix and Suffix Product Optimization
Status: Executed & Verified (Accepted)
#50DaysOfDSA #DSA #CPP
Concept: Product of Array Except Self
Technique: Prefix and Suffix Product Optimization
Status: Executed & Verified (Accepted)
#50DaysOfDSA #DSA #CPP
2
0
7
212
Day 28/50 of the DSA Grind!
Concept: Contains Duplicate
Technique: Hash Map Frequency Check (O(N) Time)
Status: Executed & Verified (0 ms)
Keeping the momentum alive by blending foundational array reviews with new problem-solving challenges!
#50DaysOfDSA #LeetCode #DSA #CPP
Concept: Contains Duplicate
Technique: Hash Map Frequency Check (O(N) Time)
Status: Executed & Verified (0 ms)
Keeping the momentum alive by blending foundational array reviews with new problem-solving challenges!
#50DaysOfDSA #LeetCode #DSA #CPP
3
0
5
139
Day 27/50 of the DSA Grind!
Concept: Best Time to Buy and Sell Stock
Technique: Single-Pass Greedy Traversal
Status: Executed & Verified (0 ms, Beats 100%)
Concept: Best Time to Buy and Sell Stock
Technique: Single-Pass Greedy Traversal
Status: Executed & Verified (0 ms, Beats 100%)
1
0
7
71
Day 26/50 of the DSA Grind!
Concept: Two Sum & Hash Map Lookup
Status: Executed & Verified (65/65 passed)
Started today by blending core fundamentals from old questions with fresh challenges to keep the problem-solving reflexes razor-sharp.
#50DaysOfDSA #LeetCode #DSA #CPP
Concept: Two Sum & Hash Map Lookup
Status: Executed & Verified (65/65 passed)
Started today by blending core fundamentals from old questions with fresh challenges to keep the problem-solving reflexes razor-sharp.
#50DaysOfDSA #LeetCode #DSA #CPP
1
0
4
100
Day 25/50 of the DSA Grind!
Concept: 0/1 Knapsack Problem
Technique: 2D DP Tabulation
Status: Executed & Verified
Halfway milestone reached!
#50DaysOfDSA #LeetCode #DSA #CPP
Concept: 0/1 Knapsack Problem
Technique: 2D DP Tabulation
Status: Executed & Verified
Halfway milestone reached!
#50DaysOfDSA #LeetCode #DSA #CPP
1
0
4
70
Day 24/50 of the DSA Grind!
Problem: Min Cost Climbing Stairs
Technique: Space-Optimized Tabulation DP
Result: 0 ms runtime (Beats 100%)
Status: Accepted
Nearly halfway through the entire challenge!
#50DaysOfDSA #LeetCode #DSA #CPP
Problem: Min Cost Climbing Stairs
Technique: Space-Optimized Tabulation DP
Result: 0 ms runtime (Beats 100%)
Status: Accepted
Nearly halfway through the entire challenge!
#50DaysOfDSA #LeetCode #DSA #CPP
2
0
4
120
Day 23/50 of the DSA Grind!
Problem: House Robber II
Technique: Range-Split Dynamic Programming (Circular Houses)
Result: 0 ms runtime (Beats 100%)
Status: Accepted
Maintaining peak momentum through the DP arc!
#50DaysOfDSA #LeetCode #DSA #CPP
Problem: House Robber II
Technique: Range-Split Dynamic Programming (Circular Houses)
Result: 0 ms runtime (Beats 100%)
Status: Accepted
Maintaining peak momentum through the DP arc!
#50DaysOfDSA #LeetCode #DSA #CPP
2
0
7
159
Day 22/50 of the DSA Grind!
Problem: House Robber
Technique: Dynamic Programming (State Transition Optimization)
Status: Accepted
Keeping the DP momentum going strong!
#50DaysOfDSA #LeetCode #DSA #CPP
Problem: House Robber
Technique: Dynamic Programming (State Transition Optimization)
Status: Accepted
Keeping the DP momentum going strong!
#50DaysOfDSA #LeetCode #DSA #CPP
1
0
4
84