Tip 1: Practice aptitude and logical reasoning questions daily to build strong problem-solving skills.
Tip 2: Revise core CS subjects like OOPs, DBMS, OS, and Data Structures regularly.
Tip 3: Practice coding problems in C++ or Java, and solve puzzles to improve your analytical thinking.
Tip 1: Clearly highlight your projects and internships to showcase practical experience.
Tip 2: Keep your resume neat and concise — focus on relevant skills and avoid unnecessary details.
a = 5
b = 2
c = 3
result = a + (b * c)
Then value of the result?
Understand operator precedence, identify operands and operators, apply precedence rules, and you will get the final answer.
Which of the following is a valid SQL query to retrieve all records from a table named Employees?
A. SELECT * FROM Employees;
B. GET ALL FROM Employees;
C. FETCH * FROM Employees;
D. SHOW * FROM Employees;
Tip 1: You have to be aware of the SQL commands like DDL, DML, TCL, etc.
Which of the following is not a feature of Object-Oriented Programming?
A. Encapsulation
B. Polymorphism
C. Inheritance
D. Compilation
Tip 1: You must be familiar with the basics of OOPs.
This round will be a psychometric test, primarily consisting of behavioural questions.
In this, we are given two statements and have to select the one that aligns more closely with our personal belief. For example:
Q) Statement 1: Our survival depends on our own efforts and abilities.
Statement 2: Our survival depends on God's grace.
Statement 1 would be more suitable in contexts where personal responsibility and proactive behaviour are emphasized, such as professional environments.
In this round, questions were mainly asked from C++ and Java programming languages, along with core Computer Science concepts such as OOPs, Data Structures, and some logical puzzle problems. There were also a few easy to medium-level coding questions to assess problem-solving skills.
The round was conducted during normal daytime hours, not late at night, which made it comfortable to attempt with a fresh mind. The environment was smooth and stress-free — the interface was user-friendly, and there were no technical glitches during the test.
If the round involved an interview, the interviewer was friendly and supportive. They encouraged clear explanations and provided hints whenever necessary, which helped in staying calm and confident throughout the discussion. Overall, the round tested both theoretical knowledge and practical coding skills in a well-balanced manner.



Do not allocate extra space for another array. You need to do this by modifying the given input array in place with O(1) extra memory.
'n' = 5, 'arr' = [1 2 2 2 3].
The new array will be [1 2 3].
So our answer is 3.
Step 1:
Understand that the array is already sorted, so duplicates will be next to each other.
Step 2:
Use two pointers:
i → Slow pointer (last index of unique elements)
j → Fast pointer (scans the array)
Step 3:
Initialize:
i = 0 (first element is always unique)
Step 4:
Loop j from 1 to n-1:
If arr[j] != arr[i]:
It’s a new, unique element.
So, move i one step ahead (i++)
Copy arr[j] to arr[i]
Step 5:
After the loop:
The first (i + 1) elements are unique.
Return i + 1 as the count of unique elements.
Write the SQL query to find the second-highest salary. (Practice)
Tip 1: Understand the problem.
Tip 2: Think of possible approaches.
Tip 3: Then write the solution.

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