yewwwws ! it's early morning though ! i usually got up early hehe
DAY-10 : #SDESheetChallenge
1. Nth node removing was literally not so tough
2. Adding two number is easy if you know when it's string
3. this was crazy ( i saw solution , crazy dude)
#DATASTRUCTURES#ALGORITHM
i'd slept whole day today! was tired stilll consistent...
DAY-9 : #SDEsheetChallenge :)
Fav topic when yk how to move pointer, tbh i was very bad at LL lol, but when it comes to POTD. i started learning and yes i get intution now not optimal but still okayyyyyyy
#DSA#ALGO<3
@striver_79@takeUforward_ Always loved your content @striver_79!! ❤️ Last sem I had DBMS and honestly wondered how I'd survive since the instructor just read from slides. Your SQL playlist was a lifesaver! This sem I have CN, so another benefit Please do OS ASAP!
<3 another dayyy !! Consistent
day 8 of #SDESheetChallenge </>
Sliding window tbh :
1st : maintain map,for longest don't update further.
2nd: count subarrays with k xor.
3rd: without repeation this way key : so if any time freq>1 ele is found slide window
#DATASTRUCTURE#ALGO
Yes another day !!! Consistent !!
🗓️ Day 7 – #SDESheetChallenge
1. 2 sum : we need to return pair so using map only by returning index
2. 4 sum : good observation from quadractic TC to o(n^3).
3. Consecutive sequence : checking whether previous element exist or not is good tbh.
Did other 3 problem :
Day 6 – #SDESheetChallenge
1: Majority Element-II : using candidate twice variables
2. Grid unique paths : using Mathematical formula (combination)
3. Reverse Pairs: using divide and conquere
#DSALGO#OPTIMAL@takeUforward_#visualstomorrow
Did another 3 problems really good
🗓️ Day 5 – #SDESheetChallenge
1: Search in 2D matrix : using binary search
2: pow(x,n) : recurrence relation of odd and even case
3: Majority element I: using candidate voting
:) see you tomorrow !! <3 #DSALGO
Did another 3 array. today it felt bit heavy.
🗓️ Day 4 – #SDESheetChallenge
1. Duplicate numbers : using slow and fast pointer. good observation.
2. repeating and missing : using map and other mathematical formula
3. inversions : using merge sort , divide and conqure
#DSALGO
Yes, another 3 array med @takeUforward_
Day-3 #SDESheetChallenge
1. Rotate matrix by 90 deg : using swap element and reversing rows
2. Merge intervals : by tracking last inserted element, check condition and work accordingly
3.Merge array : track largest element and pointer.
Day 2 – #SDESheetChallenge
Did another 3 array problem!
1) Maximum subarray sum : using Kadane's algo ( maintaining running sum)
2) Sort 0,1,2's : using three pointer approach ( that's very nice reducing from O(nlogn)->o(n).
3)stock buy and sell : keep track of minimum
visuals :-
#DAY1
Did 3 array problems.
1. Set-Matrix-Zero
2. Pascal's Triangle
3. Next permutations
Optimal that i thought is : 1. Maintain two array for row and column marking
2. Combinations ( using this method tc reduces)
3. STL (*next_permutation)
#SDESheetChallenge#DSA#algo
Staying consistent is literally tough, let we kick our journey for this another challange started by @takeUforward_ . which is starting from tomorrow onwards. but " kal se bhala aaj " , let we push. what i did is Sliding window. striver have explained it well * #SDESheetChallenge