Tip 1 : Practice sufficient amount of questions for each topic
Tip 2 : Make notes for cs fundamentals, it reduces a lot of time for revision
Tip 3 : Note down the algorithms and questions that you couldn't solve in first attempt.
Tip 1 : Make sure the resume is neat and tidy and must be a single page resume for freshers.
Tip 2 : You should have enough knowledge about the things you mention in the resume.
The test was conducted in the morning at around 9:00 AM. Three problems were given, all based on data structures and algorithms.



A -> 1
B -> 2
C -> 3
...
Z -> 26
AA -> 27
AB -> 28
...
You have run a loop to convert the number. In every step take modulus of n by 26 which is mapped to the required character. if(n%26==0) Required letter is Z else (n%26-1)+'A' and n/=26. Continue till n!=0;
It was conducted at around 12:00 PM on Cisco webex. Two questions based on DSA were asked



It was a dynamic programming based problem. First I explained the recursive solution then applied memoization to the solution.



Input: 'a' = [7, 12, 1, 20]
Output: NGE = [12, 20, 20, -1]
Explanation: For the given array,
- The next greater element for 7 is 12.
- The next greater element for 12 is 20.
- The next greater element for 1 is 20.
- There is no greater element for 20 on the right side. So we consider NGE as -1.
This was a straight problem based on stack. First I used brute force method to solve the problem and explained its time complexity. Then explained optimised solution and explained the algorithm through given test cases



If the given linked list is 1 -> 2 -> 3 -> 4 -> 5 -> NULL.
Then rearrange it into 1 -> 5 -> 2 -> 4 -> 3 -> NULL.
I first used an stack to store alternative elements of linked and then performed the rearrangement.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?