Just coding and existing...

Joined August 2025
17 Photos and videos
Day-14 #SDESheetChallenge Linked List & Arrays Done ✅Trapping Rainwater: two pointers with max boundaries O(n) ✅Remove Duplicates from sorted array: two pointers O(n) ✅Maximum Consecutive Ones: count and reset if visit 0 O(n) @striver_79 @takeUforward_ #45DaysOfCode #DSA
11
Day-13 #SDESheetChallenge Linked List & Arrays ✅Rotate a LL: length connect break O(n) ✅Clone a LL with random and next pointer: insert new nodes in b/w og nodes, later separate the lists O(n) ✅3 Sum: sort two pointers O(n²) @striver_79 @takeUforward_ #45DaysOfCode #DSA
2
38
Day-12 #SDESheetChallenge Linked List II Done ✅Check if LL is palind. or not: middle reverse compare O(n) ✅Find the starting pt. in LL: Floyd's cycle with reset pointer O(n) ✅Flattening of LL: merge sorted lists recursively O(n*m) @striver_79 @takeUforward_ #45DaysOfCode #DSA
2
23
Day-11 #SDESheetChallenge Linked List II ✅Find the intersection of Y LL: pointers switching O(n m) ✅Detect a loop in LL: Floyd's cycle(slow n fast) O(n) ✅Reverse LL in group of K: k-wise reversal with pointers adjustment O(2n) @striver_79 @takeUforward_ #45DaysOfCode #DSA
2
6
Day-10 #SDESheetChallenge Lined List I Done ✅Remove Nth node from the back of the LL: fast n slow two pointers O(n) ✅Add two numbers as LL: digit-wise carry while traversing O(max(m, n)) ✅Delete Node in a LL O(1): copy next node @striver_79 @takeUforward_ #45DaysOfCode #DSA
1
14
Day-9 #SDESheetChallenge Linked List Problems ✅Reverse a LL: maintaining prev, curr, next node pointers O(n) ✅Find Middle of LL: slow n fast pointer O(n/2) ✅Merge two Sorted Lists: visiting each node of both lists once O(n m) @striver_79 @takeUforward_ #45DaysOfCode #DSA
2
35
Day-8 #SDESheetChallenge ArrayIV Done ✅Largest Subarray with K sum: prefix sum hashing O(n) ✅Count subarrays with given xor K: prefix xor hashing O(n) ✅Longest Substr Without Repeating Char.: sliding window hashing O(n) @striver_79 @takeUforward_ #45DaysOfCode #DSA
1
1
9
The above problems helped me understand hashing and its different use cases along with concepts like sliding window, prefix sum/xor.
4
Day-7 #SDESheetChallenge Array IV Problems ✅Two Sum: hashmap lookup complement search O(n) ✅4 Sum: sort two pointers O(n^3) ✅Longest Consecutive Sequence in an Array: hashset lookup for seq. start O(n) @striver_79 @takeUforward_ #45DaysOfCoding #DSA #SDESheetChallenge
1
1
10
These problems helped understanding the use of extra space(for reducing the time for lookup using map and set) and approach like two pointer for better time complexities.
4
Day-6 #SDESheetChallenge ArrayIII Done ✅Majority Element-II: using Boyer-Moore but with 2 elements O(n) ✅Grid unique paths: recursion(optimize dp) O(m*n) ✅Reverse Pairs: merge sort count pairs O(nlogn) @striver_79 @takeUforward_ #45DaysOfCode #DSA #SDESheetChallenge
2
15
Day-5 #SDESheetChallenge ArrayIII Problems ✅Search in a 2D matrix: using binary search O(n logm) ✅Pow(x, n): O(logn) ✅Majority Element-I: using Boyer-Moore Voting algo O(n) @takeUforward_ @striver_79 #45DaysOfCode #DSA #SDESheetChallenge
1
21
Day-4 #SDESheetChallenge ArrayII Done ✅Find the duplicate no.: Hare-Tortoise method O(n) ✅Find the repeating and missing no.: Two bucket method O(n) ✅Inversion of array: using merge sort O(nlogn) @takeUforward_ @striver_79 #45DaysOfCode #DSA #SDESheetChallenge
1
3
60
I was just about to leave this challenge today, but I didn't. I showed up and am happy about it. Btw these problems were very interesting and intuitive
15
Day 3 #SDESheetChallenge Done ArrayII Problems ✅Rotate matrix by 90 deg: transpose reverse O(n*n) ✅Merge Overlapping Subintervals: sort merge O(nlogn) ✅Merge 2 sorted arrays w/o extra space: by comparing elements O(n m) @takeUforward_ @striver_79 #DSA #45DaysOfCode
2
32
Day 2 #SDESheetChallenge Done Array Problems ✅Kadane's Algo: max subarray sum (-ve, ve ele) O(n) ✅Sort array of 0, 1 & 2: dutch national flag using 3 pointers O(n) ✅Best time to buy & sell stock: track highest price from back O(n) @takeUforward_ @striver_79 #DSA #45DaysOfCode
1
7
75
Day 1 #SDESheetChallenge Done✔️ Array Problems ✅Set Matrix Zeros: matrix traversal row/col marking O(nm) ✅Pascal's Triangle 1: nCr formulation(dp-previous row addition) O(r) ✅Next Permutation: pivot swap reverse O(n) @takeUforward_ @striver_79 #DSA #45DaysOfCode #Coding
1
1
7
121
Let's go Challenge accepted Excited to grind @takeUforward_ #DSA #SDESheetChallenge
Join here to participate whatsapp.com/channel/0029VbB…
1
125
Do you guys prefer fiction or non-fiction?
1
37
Let's go 😁 This is something I am looking for Will try my best to be more consistent through this challenge
Join here to participate whatsapp.com/channel/0029VbB…
1
55