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

640
Followers

574
Following

231
Likes

7K

Parth Rathod @xkeycode21

17 hours ago

05/09/25 @LeetCode POTD Thanks @CSwithMIK. problem beautifully reduces down for each operation subtract i times num2 from num1 and then try to express that number in terms of powers of 2. Hence we need min number of bits in val or at max val if we find this then that ops is ans.

1 0 14 256 0

Download Image

Parth Rathod @xkeycode21

2 days ago

04/09/25 @LeetCode POTD Check distance travelled and check who reaches first.

0 0 11 281 0

Download Image

Parth Rathod @xkeycode21

3 days ago

03/09/25 @LeetCode POTD unfortunately sprained my ankle today. Today's questions is same as yesterday just different wording. We sort the points based on x and then keep track of maxY as for the point under consideration if it's y is below (<=) maxY seen then it falls inside rect

1 0 6 126 1

Download Image

Parth Rathod @xkeycode21

4 days ago

02/09/25 @LeetCode POTD BF soln as low constraints. Pick each pair and check for upper then pick another number and if it lies in betwn then reduce the cnt. TC-O(n^3) #DSA #LeetCode #CodingJourney

2 0 23 439 0

Download Image

Parth Rathod @xkeycode21

5 days ago

01/09/25 @LeetCode POTD Very tired today but this one did before in 2024. The idea is to keep track of the gain as it reduces each time we add +1 to both pass and total list. So the max gain we get we add it to that class till extrastudents are present. TC-O(nlogn)

1 0 12 239 0

Download Image

Parth Rathod @xkeycode21

6 days ago

31/08/25 @LeetCode POTD Recursion + backtracking --> bf soln where we try to put each char in 1 to 9 and go further. Use the helper function to determine if a particular char can be placed or not and make further recursive calls. #DSA #LeetCode #CodingChallenge

0 0 13 246 0

Download Image

Parth Rathod @xkeycode21

a week ago

29/08/25 @LeetCode POTD When the pair cnt is odd Alice wins. Odd can be formed using (odd,even) or (even,odd) so we calculate how many odds and even in range [1,n] & [1,m] are possible. Take their products and add both cases. #dsa #LeetCode #CodingJourney

1 0 10 231 0

Download Image

Parth Rathod @xkeycode21

a week ago

28/08/25 @LeetCode POTD sol1 -: travel through each diag collecting elements --> sort and put them back sol2 -: travel through the matrix and collect elements as i-j elements would be the part of same diagonal. then sort in opp direction and put them back while pop from back.

1 0 9 236 0

Download Image

Parth Rathod @xkeycode21

a week ago

26/08/25 @LeetCode POTD Keep track of max_diag_sq as taking root does not matter for comparison. If you get better need to update ans to l*b and if equal just take maximum of existing or l*b. TC-O(n) SC-O(1) #DSA #LeetCode #CodingChallenge

1 0 5 124 0

Download Image

Parth Rathod @xkeycode21

2 weeks ago

25/08/25 @LeetCode POTD I sovled this initially using simple diagonal traversal and reversing alternate sequences. Looked into the optimal solution haha def not easy to come up. Keep in mind r + c is equal to number of diagonal counting from top. TC-O(n*m) #DSA #LeetCode

0 0 12 190 0

Download Image

Parth Rathod @xkeycode21

2 weeks ago

24/08/25 @LeetCode POTD 2 pointers, we want to find the length of longest subarray containing at most 1 zero. We keep it's length and then return ans-1 to get the answer for only 1s. TC-O(n) SC-O(1) #DSA #LeetCode #CodingChallenge #Coding

0 0 14 267 0

Download Image

Parth Rathod @xkeycode21

2 weeks ago

23/06/25 @LeetCode POTD tough one, the hints helped to think about splits as we would have to generate all types of rectangles using 2 lines. Then we use minArea code to get min area with all 1s. Splits can be of 6 types of which covering 3 + rotation covers all @CSwithMIK #DSA

1 0 15 313 0

Download Image

Parth Rathod @xkeycode21

2 weeks ago

22/08/25 @LeetCode POTD We're making a box where we would like to the know the endpoints aka startRow, endRow, startCol, endCol where 1 is present. We can keep track of those indices and simply multiply their lengths. TC-O(n^2) SC-O(1) #DSA #LeetCode #CodingChallenge

1 0 13 216 0

Download Image

Parth Rathod @xkeycode21

2 weeks ago

21/08/25 @LeetCode POTD Extrapolate the concept of 1D array, build 1D matrices keeping bound for rows to generate sub matrices and count 1s. TC-O(n*2*m*m) SC-O(m) #dsa #LeetCode #CodingChallenge

1 0 17 300 0

Download Image

Parth Rathod @xkeycode21

2 weeks ago

20/08/25 @LeetCode POTD Standard dp question. Check 3 dirs up, right and diag. if we get all ones we can increase the dp cnt to include bigger size squares. dp[i][j] represents count of sqaure submatrices ending at i,j. TC-O(m*n) #DSA #LeetCode #CodingChallenge

0 0 10 171 0

Download Image

Parth Rathod @xkeycode21

3 weeks ago

19/08/25 @LeetCode POTD We have to find out consecutive sequences of 0s. Notice if len is L then we get L len 1 0s, L-1 len 2 0s.... so we need to sum 1+2+3...+L. Use sum to n formula to get answer and reset the cnt. TC-O(n) SC-O(1) #DSA #leetcode #CodingChallenge

1 0 11 307 0

Download Image

Parth Rathod @xkeycode21

3 weeks ago

18/08/25 @LeetCode POTD Pick 2 numbers using 2 for loops. generate all the possible operations on them and recursively explore all paths and while backtracking remove. Thank @CSwithMIK for epsilon which makes this questions a bit tricky. #DSA #LeetCode #Coding #Problemsolved

3 0 14 188 0

Download Image

Parth Rathod @xkeycode21

3 weeks ago

17/08/25 @LeetCode POTD Sliding window once you think about base cases and how we can keep counting the good ones. Fixed size sliding window of k and we calc prob. I used queue as it becomes easier to manage.