Tip 1: If you are in a tier 3 college, focus more on development rather than on DSA. Creating solid development projects will definitely help you. If you are not from a tier 2 or 3 college, focus on DSA and competitive programming (CP) only. (Basic DSA is essential for everyone.)
Tip 2: Learning is an attitude, not a task, so don't feel burdened. Enjoy the process.
Tip 3: Time management and stress management are underrated skills; work on developing them.
Tip 1: Create good projects and include concise bullet points to explain them on your resume.
Tip 2: Focus on the skills section of your resume, and avoid including false skills.

Let N = 3, and the score pairs be: (1, 2), (3, 2), (3, 4).
One possible sequence of goals could be:
(0,0) -> (1,0) -> (1,1) -> (1,2) -> (2,2) -> (3,2) -> (3,3) -> (3,4)
The ties occur at: (0,0), (1,1), (2,2), (3,3) = 4 times.
Therefore, the answer is '4'.
The question was based on a greedy algorithm.
It was at 10:30 AM; the interviewer was an SE II.



‘N’ = 3, ‘coins’ = {1, 2, 3}, ‘freq’ = {1, 1, 3}, ‘V’ = 6
For the given example, we can make six by using the following coins:
{1, 2, 3}
{3. 3}
Hence, the answer is 2.
I told him about the recursive approach, and he was happy with it.
He told me to code it and use memoization.
Tip 1: Go through DBMS, as it is an important subject for computer science.
Tip 2: Practice SQL queries.
It was at 3:30 PM; the interviewer was the project manager.



Input: ‘S’ =’badam’
Output: ‘ada’
‘ada’ is the longest palindromic substring, and it can be proved that it is the longest possible palindromic substring.
1. I told him we could solve it using recursion.
2. He told me to solve it without using recursion.
3. Then I told him my approach using a 2D DP technique. I didn't solve it completely, but the interviewer said I was heading in the right direction, so we were good here.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?