Tip 1: Build Real-World Projects – Practical experience is crucial, working on projects helps in understanding concepts deeply.
Tip 2: Consistent DSA Practice – Regularly solve coding problems to improve problem-solving skills and logic-building.
Tip 1: Do not lie on your resume.
Tip 2: Mention projects that you worked on.



Given a string s, find the length of the longest substring without duplicate characters.
I first attempted a brute-force approach using nested loops to generate all substrings and check for uniqueness. This was O(N^2).
The interviewer asked for an optimized approach, so I used the sliding window technique with a hash set to track visited characters.
I maintained two pointers (left and right) and expanded the window while ensuring characters were unique. If a duplicate was found, I moved left forward.
This reduced the complexity to O(N), and the interviewer was satisfied with the solution.
Write a sql query to find the second highest salary of employee. (Practice)



Given an array nums of integers and a target integer target, return indices of two numbers such that they add up to target.
My initial solution used two nested loops to check all pairs, which was O(N^2).
The interviewer asked me to optimize it, so I used a hash map to store visited elements and their indices.
While iterating, I checked if target - nums[i] existed in the map. If found, I returned the indices.
This improved the time complexity to O(N), which was well-received by the interviewer.

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