Tip 1: Focus on system design, especially for the projects mentioned in your resume.
Tip 2: Be able to solve medium-level DSA problems on coding platforms.
Tip 1: Do not include false information on your resume.
Tip 2: Gain prior internship experience if possible.
It was a DSA-based round conducted in the morning over a video call.

Check Feasibility:
The sum of digits from 1 to 9 is 45.
Therefore, if N > 45, return -1 immediately.
Greedy Approach (from 9 to 1):
Initialize an empty list to store the digits.
Start from the largest digit (9) and move down to 1.
At each step:
If the current digit is less than or equal to N, pick it.
Subtract it from N.
Add the digit to the list.
Repeat until N = 0.
Construct the Smallest Number:
Since the digits were picked in descending order, sort them in ascending order before forming the number to ensure it is the smallest possible.
Return the result.


Input: ‘arr’ = {1, 1, 2, 3, 3, 4, 4}.
Output: 2
Explanation: 1, 3, and 4 occur exactly twice. 2 occurs exactly once. Hence the answer is 2.
Initialize a variable, say res = 0.
Iterate through each element of the array.
For each element x, compute res = res ^ x.
After the loop, res will contain the non-repeating (unique) element.
Return res.
The round was conducted over a video call with a senior developer
I was asked to fully design a project I had mentioned in my resume, and then I was asked in detail to improve it and write the corresponding SQL queries.
The round was conducted with a senior director of the company.
I was asked to solve a few puzzles and trick questions related to web development, such as how I would accomplish a task using browser developer tools, and how to determine, using code logic, whether two points relative to a circle are both inside, both outside, or one inside and one outside.

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