Tip 1: Consistency is the key doesn't matter you are topper or average or below average.
Tip 2: Don't compare your progress with others.
Tip 3: If nothing good happens at last don't get demotivated, come back again.
Tip 1: Highlight or prioritize the big achievement on your resume first.
Tip 2: Single page resume, add good project and coding profiles.
There were 3 Hard DSA questions.



You are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n. Each CPU interval can be idle or allow the completion of one task. Tasks can be completed in any order, but there's a constraint: there has to be a gap of at least n intervals between two tasks with the same label.
Return the minimum number of CPU intervals required to complete all tasks.
Greedy + HashMap + Sorting was needed in this problem.



Every night, the virus spreads to all neighboring cells in all four directions unless blocked by a wall. Resources are limited. Each day, you can install walls around only one region (i.e., the affected area (continuous block of infected cells) that threatens the most uninfected cells the following night). There will never be a tie.
Return the number of walls used to quarantine all the infected regions. If the world will become fully infected, return the number of walls used
Depth first search was needed in this, I wasn't able to solve it fully there were some test cases which I couldn't pass.



Given a string s, find the length of the longest substring without duplicate characters.
Using HashMap and while loop and logic .This question can also be done through Stack.
DSA Round: The interviewer emailed me a question in a Notepad file and asked me to solve it there. I opened an online compiler, and he said, okay open it and start solving the question.



A permutation of an array of integers is an arrangement of its members into a sequence or linear order.
For example, for arr = [1,2,3], the following are all the permutations of arr: [1,2,3], [1,3,2], [2, 1, 3], [2, 3, 1], [3,1,2], [3,2,1].
The next permutation of an array of integers is the next lexicographically greater permutation of its integer. More formally, if all the permutations of the array are sorted in one container according to their lexicographical order, then the next permutation of that array is the permutation that follows it in the sorted container. If such arrangement is not possible, the array must be rearranged as the lowest possible order (i.e., sorted in ascending order).
For example, the next permutation of arr = [1,2,3] is [1,3,2].
Similarly, the next permutation of arr = [2,3,1] is [3,1,2].
While the next permutation of arr = [3,2,1] is [1,2,3] because [3,2,1] does not have a lexicographical larger rearrangement.
Given an array of integers nums, find the next permutation of nums.
The replacement must be in place and use only constant extra memory.
Scan from right to left and find the first index i where nums[i] < nums[i + 1] — this is the "pivot".
If such i exists:
Find the smallest number greater than nums[i] to the right of it and swap them.
Reverse the portion after i to get the next smallest lexicographical order.
If i doesn't exist (i.e. the array is in descending order), just reverse the whole array.
The interviewer asked my introduction and shared the link of system design questions.
4 functionalities I had to code from scratch within 60 mins:
Tip 1: Understand the problem for 5-10 mins or take more.
Tip 2: Keep calm and start solving from the beginning.
Tip 3: Practise past year system design questions of Meesho or any other big product based company.

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