Day 37/75 #75HardCoding | Intersection II
Two approaches for LeetCode 350:
• Sorting 2-Pointer: O(NlogN MlogM) TC | O(1) SC
• Hash Map Frequency: O(N M) TC | O(min(N, M)) SC
Optimizing frequencies cleanly!
#DSA #LeetCode #Cpp #100DaysOfCode #Programming #Consistency
1
10
Good Girl Kate💗 retweeted
Jun 13
Day 36/75 #75HardCoding
Bypass heavy hash set overhead by sorting inputs and sweeping them simultaneously with a coordinated dual-ptr layout.
349. Intersection of Two Arrays
• Complexity: O(n log n m log m) TC | O(1) Aux SC
#DSA #LeetCode #CPP #DataStructures #Consistency
1
5
7
61
Jun 12
Day 35/75 #75HardCoding
Solving digit array carry logic optimally by processing the integer sequence in reverse to handle radix boundary shifts.
Problem: 66. Plus One
• Optimal: O(n) Time Complexity | O(1) Auxiliary Space
#DSA #LeetCode #CPP #DataStructures #Consistency
1
4
56
Jun 11
Day 34/75 #75HardCoding | Divide&Conquer
Built a clean Merge Sort framework from scratch to satisfy strict sub-quadratic limits without relying on library shortcuts.
Problem: 912. Sort an Array
• Optimal: O(n log n) TC | O(n) SC
#DSA #CPP #LeetCode #BinarySearch #Consistency
1
1
18
Jun 10
Day 33/75 #75HardCoding
Optimized a complex resource-matching problem by swapping a linear timeline loop for a binary range sweep.
Problem: 1482. Min Days to Make m Bouquets
• Brute: O((max-min) * n) TC
• Optimal: O(n * log(max-min)) TC
#DSA #LeetCode #CPP #100DaysOfCode
1
1
21
Jun 9
Day 32/75 #75HardCoding
Conquered the inversion counting ceiling by modifying the Merge Sort structure to track element pairs natively.
• Problem: 493. Reverse Pairs
• Brute: O(n²) TC | O(1) SC
• Optimal: O(n log n) TC | O(n) SC
Breakdown below 👇
#DSA #LeetCode #CPP
1
1
20
Jun 8
Day 31/75 #75HardCoding | BS on Ans
Upgraded yesterday's linear bottleneck on Koko Eating Bananas into a highly efficient logarithmic range search.
• Problem: 875. Koko Eating Bananas
• Optimal: O(n * log(maxPiles)) TC | O(1) SC
#DSA #LeetCode #CPP #Consistency #DSA
1
1
20
Jun 7
Day 30/75 #75HardCoding | Monotonic Sprint 🎯
Still under the weather, but keeping the daily habit alive.
1️⃣ 367. Valid Perfect Square: O(log n) TC
2️⃣ 875. Koko Eating Bananas: O(maxPiles * n) TC
Details below 👇
#DSA #DataStructures #Cplusplus #LeetCode #SoftwareEngineering
1
1
13
Jun 4
Day 27/75 #75HardCoding | P 1 & 2 🔄
Search in Rotated Sorted Array I & II
• Rotated Search I (Distinct): O(log n) TC | O(1) SC
• Rotated Search II (Duplicates): O(n) Worst Case TC | O(1)SC
#DSA #DataStructures #Cplusplus #LeetCode #SoftwareEngineering #Consistency
1
6
62
Jun 3
Day 26/75 #75HardCoding | P-4
Floor and Ceil in Unsorted Array
• Brute Force: O(n) TC | O(1) SC (Linear search)
• Optimal: O(n log n) TC | O(1) SC (Sort Binary Search)
Details below👇
#DSA #DataStructures #Cplusplus #LeetCode #GeeksforGeeks #SoftwareEngineering #Consistency
1
2
18
Jun 3
Day 26/75 #75HardCoding | P 2 & 3
Implement Lower Bound & Upper Bound
• Lower Bound: O(log n) TC | O(1) SC
• Upper Bound: O(log n) TC | O(1) SC
Mastering the subtle conditional shifts that redefine search space boundaries. Details below.
#100DaysOfCode #DSA #LeetCode #Cpp
1
6
40
Jun 3
Day 26/75 #75HardCoding | P-1
Find First and Last Position of Element in Sorted Array
• Optimal:O(log n)TC | O(1)SC
Modifying standard binary search boundaries into independent dual tracking registers to find bound frequencies. Details below.
#100DaysOfCode #DSA #LeetCode #Cpp
1
4
33
Jun 2
Day 25/75 #75HardCoding
Search Insert Position
•Optimal: O(log n)TC | O(1)SC
Not feeling my best physically these days, so stepping back from heavy Mediums to prioritize recovery while keeping the daily habit alive.Log binary tracking logic below.
#100DaysOfCode #DSA #LeetCode
1
3
25
May 29
Day 21/75 #75HardCoding | Part 1
Best Time to Buy and Sell Stock
• Brute Force: O(n^2) TC | O(1) SC
• Optimal: O(n) TC | O(1) SC
Breaking down the linear transition path from a nested time limit bottleneck down to a single-pass solution below.👇
#100DaysOfCode #DSA #LeetCode
1
2
36
May 26
Day 18/75 #75HardCoding
Feeling sick today, but pushing through anyway because consistency doesn't care if you're under the weather. 🥊
1752.Check if Array Is Sorted and Rotated
• Optimal: O(n) TC, O(1) SC (Circular check)
#100DaysOfCode #DSA #LeetCode #Cpp #Cplusplus
1
17
May 25
Day 17/75 #75HardCoding
48.Rotate Image
• Brute: O(n²) TC, O(n²) SC (Column-to-row matrix copy)
• Optimal: O(n²) TC, O(1) SC (In-place Transpose Reverse)
54.Spiral Matrix
• Optimal: O(m*n) TC, O(1) SC (4-boundary layer traversal)
#100DaysOfCode #DSA #LeetCode #cpp
1
4
233
May 17
Day 9/75 #75HardCoding
Check Adjacent Digit Differences
• TC: O(n), SC: O(1)
Maximum Subarray
• Brute Force: O(n²) TC, O(1) SC (Nested loops)
• Optimal: O(n) TC, O(1) SC (Kadane's Algorithm)
#75HardCoding #100DaysOfCode #DSA #Cplusplus #LeetCode #CodingChallenge
2
29
May 12
Day 4/75 #75HardCoding
Move Zeroes
Brute: Used a temp vector to store non-0s and filled the remainder with 0s. TC: O(n), SC: O(n)
Optimal: Implemented a two-pointer swap to shift zeroes in-place. TC: O(n), SC: O(1)
#100DaysOfCode #DSA #Cplusplus #LeetCode #SoftwareEngineering
1
2
51