Tip 1: Practice regularly by solving coding problems on platforms like Coding Ninja Studio to strengthen your problem-solving skills.
Tip 2: Review and understand the fundamental concepts of data structures and algorithms thoroughly, as they form the backbone of technical interviews.
Tip 3: Start by thoroughly understanding the fundamental concepts before delving into advanced topics.
Tip 4: Work on improving your communication skills, as they are essential for effectively conveying your ideas in interviews and collaborative environments.
Tip 1: Tailor your resume to the specific job you are applying for, emphasizing relevant skills and experiences.
Tip 2: Use clear and concise language, avoid jargon, and ensure readability through proper formatting and organization.
Tip 3: Quantify your achievements whenever possible to demonstrate your impact and contributions in previous roles.
In the first round, which was the coding round, there were three rounds in total, consisting of 22 multiple-choice questions (MCQs) and 3 coding questions. The objective questions were of intermediate level. One coding question was based on strings, categorized as easy, while the other two questions were related to dynamic programming, categorized at intermediate and hard levels.



Choose a stream of data of size A You have B different types of integers from which you have to select the stream of data. You can select an integer multiple times. A valid combination is a stream of data in which there are exactly C integers that are different from the previous integer in the sequence. You are given integers A, B, and C The first Integer in the stream of data is not included among the C integers. Print the number of ways Of selecting a valid combination modulo 998244353.


Ankitha enjoys finding new games. One day she found a grid with dimensions and decided to make up a special game to play on it When Ankitha came up with the idea for the new gamer her friend Akhil joined her. She then decided to share and explain the game to him.
Akhil is given a grid with dimensions MAN, where each cell contains either 0 or 1. Additionally. he is provided with the coordinates of source and destination cells. You can only move to places whose value is 0. Furthermore, he is given the move rule (x, y) which helps in finding the location for the next move. From the given cell, you can move in four directions (forward, back, right, left), unless they are out of the grid. The rules for finding the next move from a current cell are given below.
• For moving forward, add the move rule to the current cell.
• For moving right, from the current position add thGnove rule, rotate the path 90 degrees clockwise,
• For moving left, from the current position add the move rule, and rotate the path 90 degrees anticlockwise direction.
• For moving backward, from the current position add the move rule, and rotate the path 180 degrees clock or anti-clockwise.
The rules can be understood better from the following example. Let the current cell be (1.1) and the move rule as (1,2)
In the nets M bowlers and N batsmen are practicing, With each batsman facing all the bowlers Every player has some default power in them. The coach wants to monitor their performance. The following rules determine their Play.
• If the batsman's power is greater than the bowler's power. the batsman will score 1 run.
• If the batsman's power is double the bowler's power or more, the batsman will hit the ball for a six and score 6 runs.
• If the bowler's power is greater than the batsman's power, the batsman will play a dot (no runs).
• If the bowler's power is double the batsman's power or more, the batsman Will get out.
Assuming that the batsman is giving his best effort, your task is to calculate the following statistics.
1. Total runs scored by the batsman
2. The number of dots played by the batsman.
3. The number of times the batsman got out,
4. Average score, calculated as the total runs divided by the number of times the batsman got out.
write a program to accomplish the above task.
In this technical round, the interviewer presented two coding questions based on data structures and algorithms (DSA). In addition to DSA, the interviewer inquired about computer-based subjects such as database management systems and operating systems. Furthermore, they also questioned me about Java programming and SQL queries.



The interviewer asked about string reversal using different approaches, and I had to write only pseudo-code for all approaches.
Tip 1: Understand the problem statement thoroughly before attempting to write any code.
Tip 2: Break down the problem into smaller, manageable steps to tackle each approach separately.
Tip 3: Comment on each step of the pseudo-code to explain the thought process behind the approach to the interviewer.



The linked list is given and I have to just reverse the linked list.
Step 1: Traverse the linked list starting from the head node.
Step 2: Keep track of the previous, current, and next nodes as you iterate through the list.
Step 3: At each node, update the next pointer to point to the previous node instead of the next node.
Step 4: Move to the next node and continue the process until you reach the end of the list.
Step 5: Once the end of the list is reached, update the head pointer to point to the last node (which was originally the tail).
Step 6: Return the head pointer as the new head of the reversed linked list
This is the managerial and HR round, during which the interviewer conducted a detailed discussion about my projects, posed a logical question, and presented a puzzle. Additionally, they asked various behavioral questions and inquired about my journey and the company itself.
The task is to cut the cake into 8 equal pieces, but the condition is that you can only use the knife thrice.
Tip 1: I considered the birthday cake, which is circular.
Tip 2: Then, I cut the cake vertically two times equally.
Tip 3: Finally, I cut the cake horizontally

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