Sakshi Srivastava 🦋

Universe is taking care of everything !!
#Indian🇮🇳

[Sakshi Srivastava 🦋 @_sakshee01_]

Alice and Bob need to stop involving me in their personal problems. I just came here to code. 😭💀
Please quit gaming and go find a job or something 😭😭🙏🙏
#leetcode #leetcodedailychallenge #AliceandBob #leetcodeStoneGameVIII

[Sakshi Srivastava 🦋 @_sakshee01_]

@ashishronyar What's one thing you do that helps you zoom out instead of getting stuck?

[Ajit Doval ᴾᵃʳᵒᵈʸ🇮🇳 @IAjitDoval_IND]

I Support Narendra Modi

Repost if you do.

[Sakshi Srivastava 🦋 @_sakshee01_]

@Ritesh97753637 @ASUS @ASUSIndia @LeetCode Already did twice 😭

[Sakshi Srivastava 🦋 @_sakshee01_]

My Wi-Fi literally disappeared in the middle of the #LeetCode #WeeklyContest512 . 😭 I restarted it, turned it off and on, and it's still not coming back. I have no idea how I'm supposed to finish my contest. Somebody help! 🥲 @ASUS @ASUSIndia @LeetCode

[Sakshi Srivastava 🦋 @_sakshee01_]

Yrrrr Iam so done .....😩😵‍💫My college's favorite Java keyword isn't static.
It's repeat(); 😭
4th year. Nth lecture on Static Variables....

[Sakshi Srivastava 🦋 @_sakshee01_]

Today's LeetCode POTD just killed me 💀 not even exaggerating 😑,4-5 attempts, 3 different approaches, and my first real submission passed only 2 out of 4 test cases 😭😭😭If I drop dead today, you all know the reason....
#leetcode #POTD

[Sakshi Srivastava 🦋 @_sakshee01_]

checked if currentSum minus k had occurred before. If it had, the subarray between those two points sums to k
Time O(n), Space O(n)
That's Day 4 done ✅
If this helped or you liked the approach, a like goes a long way in keeping this consistent
Back tomorrow with new questions 👇

[Sakshi Srivastava 🦋 @_sakshee01_]

Day 4 ✅ #StriversTrailUnlocked with @deep_zero1
Solved two problems today from Striver's A2Z Sheet
1. Find the number that appears once, and other numbers twice.
2. Longest Subarray with Sum K
Sharing my approach for both below 👇
Got a better solution? Drop it in the comments

[Sakshi Srivastava 🦋 @_sakshee01_]

That's O(n²), too slow, and this array has negatives too so sliding window alone won't directly work
Used prefix sum with a hashmap instead
Kept a running sum while going through the array, and stored each sum with its index the first time it appeared. At every point.

[Sakshi Srivastava 🦋 @_sakshee01_]

the max value along the way so I don't need a separate pass at the end.
Time O(n), Space O(1) That's Day 3 done ✅
If this helped or you liked the approach, a like goes a long way in keeping this consistent
Back tomorrow with new questions 👇

[Sakshi Srivastava 🦋 @_sakshee01_]

Day 3 ✅ #StriversTrailUnlocked with @deep_zero1
Solved two problems today from Striver's A2Z Sheet
1. Move Zeroes
2. Max Consecutive Ones
Sharing my approach for both below 👇
Got a better solution? Drop it in the comments

[Sakshi Srivastava 🦋 @_sakshee01_]

Problem 2, Max Consecutive Ones
Find the maximum number of consecutive 1s in a binary array . Straightforward one, just needed a running counter Went through the array once, incrementing a counter every time I saw a 1, and resetting it to 0 the moment I hit a 0
Kept updating ...

[Sakshi Srivastava 🦋 @_sakshee01_]

Landed on the reversal technique, reverse the first K elements, reverse the rest, then reverse the whole array .One clean pass instead of K repeated ones
Time O(n), Space O(1) 😃
If this helped or you liked the approach, a like goes a long way in keeping this consistent 😀👇

[Sakshi Srivastava 🦋 @_sakshee01_]

So I did it in place instead. Just store the first element separately, shift every other element one step to the left, then place the stored value at the end
Time O(n), Space O(1)

Problem 2, Left Rotate Array by K Places
My first instinct was to just repeat the "rotate by one"

[Sakshi Srivastava 🦋 @_sakshee01_]

logic K times in a loop
That works, but it means doing a full pass K times, so the time complexity becomes O(n*k), too slow when K is large Had to think of something that does it in a single pass regardless of K