Parth Rathod @xkeycode21

SDE@Amazon | Loves Linux | Building things, breaking them and learning along the way. linktr.ee/parth_rathod stack.push(India) Joined June 2024

Tweets

706
Followers

516
Following

233
Likes

7K

Parth Rathod @xkeycode21

7 months ago

@Shashidhar_98 Congratulations!

1 0 1 24 0

View Details

22/11/25 @LeetCode POTD Use mod to see how far values are to become 0 or 3 so they become divisible. If mod equals 1 = we subtract 1 (1 operation) 2 = we add 1 ( 1 operation) essentially boils downl to if mod != 3 add 1. #LeetCode #Coding

0 0 6 306 0

View Details

Parth Rathod @xkeycode21

11 months ago

is the leetcode streak counter broken today? solved today's potd but it did not increment the count. Though the transition from 0 to 1 doesn't matter lol #LeetCode

0 0 4 113 0

View Details

Parth Rathod @xkeycode21

11 months ago

@HVasani3301 Yes bro, I take my health seriously. Good food and sleep are non negotiable. Thank you for being concerned! I hope you’re doing well :)

1 0 1 12 0

View Details

Parth Rathod @xkeycode21

11 months ago

Clocking in 12+ hours everyday (sometimes even on weekend) though there’s no time restrictions at work. Feels good to grow but sometimes I wonder at what cost. Anyways, I hope it motivates you to put in the hard work because at the end that is what matters. Good luck!

1 0 10 154 1

View Details

Parth Rathod @xkeycode21

11 months ago

@HelloVyom @LeetCode Agreed 100% But work is also crazy ;)

0 0 1 26 0

View Details

Parth Rathod @xkeycode21

11 months ago

@the6digitGuy @LeetCode I'm sorry bro apko aisa lag rha tha. Hausla rakhe and trust yourself sab ho jayega 🫶

0 0 1 8 0

View Details

Parth Rathod @xkeycode21

11 months ago

After a long time 27/10/25 @LeetCode POTD We need to find 2 neighbouring rows that have atleast one 1. Keep a prevCnt to keep track of prev valid row. Calculate currCnt if it has atleast one 1 then we can update the ans as per prev * curr. #dsa #LeetCode

1 0 8 635 1

View Details

Parth Rathod @xkeycode21

11 months ago

@the6digitGuy @LeetCode Badhiya bhaii, consistency to bani rhi hai na?

1 0 0 20 0

View Details

Parth Rathod @xkeycode21

12 months ago

Happy Choti Diwali and belated Dhanteras wishes for everyone. I hope this festive season of lights brings joy and happiness for you!

1 0 4 226 0

View Details

Parth Rathod @xkeycode21

12 months ago

@cool_coconut20 Awesome! Keep up the grind, all the best ;)

0 0 1 29 0

View Details

Parth Rathod @xkeycode21

12 months ago

Writing a lld and getting is approved by the team is gotta be difficult and exciting part of the job at the same time ;) No sleep/work schedule Dry run solutions Pen paper Make pocs Draw/write That is why I haven’t been posting lately. How are y’all?

2 0 7 174 1

View Details

Parth Rathod @xkeycode21

12 months ago

@HVasani3301 Yes sir I’ll thanks! You have a good one :)

0 0 1 16 0

View Details

Parth Rathod @xkeycode21

12 months ago

@HVasani3301 Glad to hear that! It’s going good. The process of learning , understanding and getting better at something is what I love so painful process but love the pain haha.

1 0 1 20 0

View Details

Parth Rathod @xkeycode21

a year ago

11/10/25 @LeetCode POTD we have option for every index to pick or not pick it. To not check the previous -1, and -2 we sort the array and use recursion to skip forward steps in this way we take care of the not_take element's prev vals. Use freq map to count all the occurrences.

2 0 14 409 0

View Details

Parth Rathod @xkeycode21

a year ago

Hey everyone busy with work and also broke my 385 day streak sucks :( 10/10/25 @LeetCode POTD Think about it in bottom up dp. from n-k to n-1 we will exceed n's boundary from n-k-1 to 0 we can simply add the val at i+k to get the final res iterate through the ans arr to get max

0 0 7 156 1

View Details

Parth Rathod @xkeycode21

a year ago

01/10/25 @LeetCode POTD Simulate the process. #DSA #Coding

0 0 12 166 0

View Details

Parth Rathod @xkeycode21

a year ago

30/09/25 @LeetCode POTD On trying we find that the problem boils down to MCM pattern. Too tired and hence did not solve it bottom up. TC-O(n^3) SC-O(n^2) #DSA #Coding