Parth Rathod
@xkeycode21
SDE@Amazon | Loves Linux | Building things, breaking them and learning along the way.
Career update:- Joined Amazon as SDE-1 I have been grinding for the past 1.5 years while working full time job/ freelancing on the side. Tough but definitely doable and grateful for the people who’ve supported me. I wish everyone a Happy and Blessed Rakshabandhan!
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
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
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!
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
Happy Choti Diwali and belated Dhanteras wishes for everyone. I hope this festive season of lights brings joy and happiness for you!
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?
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.
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
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
28/09/25 @LeetCode POTD Sort and check for valid triangle condition for 3 consecutive pairs. TC-O(nlogn) #DSA #coding
27/09/25 @LeetCode POTD Did not knew about shoelace formula so I used heron's. attaching both solutions below #LeetCode #coding #DSA
25/09/25 @LeetCode POTD Doing dp after a long time. Explore all paths and take minimum. Space opt is we only need the next state so just keep track of that. TC-O(n^2 + n) SC-O(n) #CodingJourney #DSA #LeetCode
23/09/25 @LeetCode POTD Capture the val after '.' and compare make sure to move the indexes properly. TC-O(n) SC-O(1) #LeetCode #CodingJourney
22/09/25 @LeetCode POTD Missed the design problems :( Simply count how the number of diff numbers with max_freq. We multiple them to get the final ans. TC-O(n) SC-O(n)
United States Trends
- 1. Cowboys 70.6K posts
- 2. LeBron 93.9K posts
- 3. Gibbs 18.8K posts
- 4. Lions 86.7K posts
- 5. Pickens 13.1K posts
- 6. #OnePride 9,976 posts
- 7. Brandon Aubrey 6,999 posts
- 8. Ferguson 10.5K posts
- 9. #DALvsDET 6,092 posts
- 10. Eberflus 2,419 posts
- 11. CeeDee 10.1K posts
- 12. Goff 8,369 posts
- 13. Bland 8,415 posts
- 14. Shang Tsung 20.5K posts
- 15. DJ Reed N/A
- 16. Al Michaels N/A
- 17. Schotty 1,800 posts
- 18. scott hunter 2,645 posts
- 19. Austin Reaves 14.7K posts
- 20. fnaf 2 23.8K posts
Something went wrong.
Something went wrong.