Current Status : Full Time Employee at a PBC (1.5 years exp, 6 months intern) (less than 10 LPA)
2023 Grad
Tier 3 private University

Applied on the portal.
Medium to hard difficulty.
Ques 1 : two arrays arr1, arr2. U can swap 2 elements of the array any number of times. Find the max possible sum of i*(arr2[i]-arr1[i]) for 1<= i <= n .

Ques 2. u are given a supercomputer with multiple processors arranged sequentially in a row from 1 to n.
For the ith processor, the efficiency of the ith processor is no_adjacent[i], one_adjacent[i], or both_adjacent[i] when neither, one, or both adjacent processors is deployed before processor i.
1th and nth processors can only have one adjacent. Find max possible sum of efficiencies amongst all possible orders of deployment.

Ques 3. CountGoodSubsequences. Conditions for good:

• all elements in sequence are unique
• if minimum in sequence is a, max is b, then all numbers in the range [a,b] should be present in the sequence.

Hello Community
I gave a meesho hackerrank test yesterday and clearly feel hopeless.
In a nutshell, I was only able to pass 1 test case in one question and 2 test cases in 2 other questions.

I would really really appreciate if the community can help me prepare, suggest anything on how should I prepare myself so that I don't fail next time if there's any.

As of my current To Do's : I am weak on graphs and dp. Doing these topics from love babbar dsa sheet. Then, also picking up leetcode daily question from today.
Also, thinking to solve hackerrank interview prep kit to boost my confidence for such questions.

Current LC stats:
Easy : 127
Medium : 169
Hard : 13

Really looking forward to actionable suggestions to improve my DSA and not fail next time.

(GPT, gemini nothing works during OA, feeling like I lost the opportunity of a lifetime, the golden goose)
Verdict : Reject Ofcourse

(Or is it even worth it now to practice DSA? since after 2+ years I'll be eligible for SDE2 , and there is less DSA in that in many companies)