Tip 1: Practice DSA problems every day with consistency. Don’t pick random questions—instead, follow a pattern-wise approach.
Tip 2: Use a structured resource like Striver’s DSA Sheet, which covers most frequently asked problems organized pattern-wise.
Tip 1: Include projects on your resume that clearly showcase your expertise in development.
Tip 2: Be realistic and avoid listing too many technologies—focus on the ones you truly know well.
The first round was a coding test with a duration of three hours, consisting of three questions—one easy, one medium, and one hard. To qualify for the next stage, it was necessary to solve at least 2.5 questions. After clearing this round, I was scheduled for the interview, which mainly focused on basic coding and DSA concepts, along with some live coding tasks.



is_empty(S) : Tests whether stack is empty or not.
push(S) : Adds a new element to the stack.
pop(S) : Removes top element from the stack.
top(S) : Returns value of the top element. Note that this function does not remove elements from the stack.
1) Use of any loop constructs like while, for..etc is not allowed.
2) The stack may contain duplicate integers.
3) The stack may contain any integer i.e it may either be negative, positive or zero.
So first, I extracted all the element of a stack then I used another function to place the extracted element at their sorted position.



You are given two shorted Linked list. Need to merge them to make one list.
I used a modified version of merge sort.



You are given a number N place the Queens in a NXN board such that no queen attack each other. How many such positions are possible?
I used backtracking to solve this problem in every cell Before placing a queen, I check whether this queen is attacked by any other queen or not. If it is safe to place a queen. Then I just placed the queen on that cell and try to place other Queens once I reach at the end of the cell, basically N.N then find solution.
Interviewer asked basic coding questions regarding DSA and also asked to write code for a problem, my interview went flawless. I solve the given question in just about 10 minutes. It was a basic question.



Give a string S count the frequency of each letter.
I used HashMap to store the frequency of each element.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: