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

689
Followers

575
Following

234
Likes

7K

Parth Rathod @xkeycode21

21 hours 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

1 0 16 263 1

Download Image

Parth Rathod @xkeycode21

2 days ago

28/09/25 @LeetCode POTD Sort and check for valid triangle condition for 3 consecutive pairs. TC-O(nlogn) #DSA #coding

1 0 13 265 1

Download Image

Parth Rathod @xkeycode21

3 days ago

27/09/25 @LeetCode POTD Did not knew about shoelace formula so I used heron's. attaching both solutions below #LeetCode #coding #DSA

1 0 5 107 0

Download Image

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

1 0 15 251 1

Download Image

Parth Rathod @xkeycode21

6 days ago

25/09/25 @LeetCode POTD simulate the long division method.

0 0 7 238 0

Download Image

Parth Rathod @xkeycode21

a week ago

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

0 0 12 167 0

Download Image

Parth Rathod @xkeycode21

a week ago

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)

0 0 9 119 0

Download Image

Parth Rathod @xkeycode21

a week ago

21/09/25 @LeetCode POTD Keep unrented map of move to set of price,shop. Another rented set to store Price, Shop, movie list. We miss here a way to get price based on shop and movie so we build one. Operations are straightforward and logarithmic. #LeetCode #coding

1 0 21 439 3

Download Image

Parth Rathod @xkeycode21

2 weeks ago

19/09/25 @LeetCode POTD nfo required is cell's value which we can store using map. set and reset becomes trivial. After looking at solutions for get it would've been the best to split and extract instead of getting both values in one go like I did. Simpler version attached too

0 0 4 208 0

Download Image

Parth Rathod @xkeycode21

2 weeks ago

18/09/25 @LeetCode POTD Today is 366 day streak, yay! set/pq for storing best pair result. I used yesterday's conecept of Vlad of putting neg values in set so they come earlier. Another for priority, and one for userId can be combined but too lazy. TC-O(nlogn)

2 0 16 305 0

Download Image

Parth Rathod @xkeycode21

2 weeks ago

17/09/25 @LeetCode POTD Late to post because work has been hectic. store cuisine->set<rating, food>, food->rating, food->cuisine in maps. This way modification becomes logn and for highest we iterate from back find the smallest string and return. #dsa #Coding

1 0 22 291 1

Download Image

Parth Rathod @xkeycode21

2 weeks ago

15/09/25 @LeetCode POTD Store those chars which can't be used in a word. Used bitset for performance. Assume you can type the word unless a char mathes in that bitset set the flag to false. TC-O(n+m) SC-O(1) #DSA #LeetCode #CodingJourney

2 0 14 181 0

Download Image

Parth Rathod @xkeycode21

2 weeks ago

14/09/25 @LeetCode POTD store exact match in mpp For case insensitive - convert KiTe becomes kite* if it is present then don't update it. For vowel preserve consonent order so replace vowels with _. KiTe becomes k_t_. use lowercase as only first match would be kept in map O(n*m)

0 0 10 236 2

Download Image

Parth Rathod @xkeycode21

2 weeks ago

13/09/25 @LeetCode POTD use a freq map and while increasing the cnt keep track of maximum vowel and consonent. Return the sum. TC-O(n) SC-O(1) since only 26 size array considered. #dsa #leetcode #coding #ProblemSolving