Tip 1: Go through the questions in Striver's sheet for coding.
Tip 2: Be patient and calm. This process is time and energy-consuming, but I'm sure you can get through it.
Tip 1: Your projects should be related to the current emerging topics.
Tip 2: Be prepared with the areas of interest that you put in your resume.
Aptitude, Data Structures, SQL
The father is three times older than his son Rohit. After 8 years, he will be two and a half times Rohit's age. After another 8 years, how many times will he be Rohit's age?
Let Rohit's present age be x years.
Then, the father's present age
=(x+3x)years
=4xyears
(4x+8)=52(x+8)
⇒8x+16=5x+40
⇒3x=24
⇒x=8
Hence, required times=4x+16x+16
=4824
=2
What is the range of values that can be stored by int datatype in C? (Link)
#include
int main() {
int a = 3, b = 5;
int t = a;
a = b;
b = t;
printf("%d %d", a, b);
return 0;
}
Integer p, q, r
Set p = 0, q = 4, r = 3
If(p || r)
If(p && r)
p = p &r
End If
p = pr
End If
Print p + q + r
From 2004 to 2005, the sales of pens decreased by 80%. If the sales in 2006 were the same as in 2004, how much percentage of the sales increased from 2005 to 2006?
class Name:
def __init__(javatpoint):
javajavatpoint = java
name1=Name("ABC")
name2=name1
Options :
1. It will throw the error as multiple references to the same object is not possible
2. id(name1) and id(name2) will have same value
3. Both name1 and name2 will have reference to two different objects of class Name
4. All of the above
How is the 2nd element in an array accessed based on pointer notation? (Link)
ANS : *(a+2)
Which data structures allow insertion and deletion from both ends? (Link)
ANS :Deque
Even if you cannot pass all test cases make sure your code compiles completely, they also give partial scores based on implementation logic. This was also in Amcat so time is of the essence.


Given an array with repeated elements, the task is to find the maximum distance between two occurrences of an element.
Use hashing to traverse the input array and store the first occurrence in a hash map. For every Next occurrence, the difference and the first index should be stored. If the difference is more than the result so far, then update the result.


Given two strings find the extra character in the first string.
TIP: even if you cannot pass all test cases make sure your code compiles completely, they also give partial scores based on implementation logic. This was also in Amcat so time is of the essence.
Write a query to extract the username(characters before @ symbol) from the Email_ID column.
ANS :SELECT SUBSTR(Email_ID, 1, INSTR(Email_ID, '@') - 1) FROM STUDENT;



Given the head of a linked list, remove the nth node from the end of the list and return its head.
Take two dummy nodes, whoever’s next will be pointing to the head.
Take another node to store the head, initially, it's a dummy node(start), and the next node will be pointing to the head. The reason why we are using this extra dummy node is that there is an edge case. If the node is equal to the length of the LinkedList, then this slow will point to slow’s next→ next. And we can say our dummy start node will be broken and will be connected to the slow next→ next.
It was an easy group discussion with the buzzing topics. We were divided into groups and each group had 8 people and 2 judges to mark us.
The physical interview was mostly based on resumes and it well as the interviewers were fun and chill, They also created a peaceful environment.



Given a list, find 3 maximum numbers by iterating the list only once.
Find the sum of salaries department-wise and fetch them only if their sum is above a particular amount (use having).
What do u know about sci-kit-learn?
Explain TF-IDF.
What is Gradient Boost and how does it boost the weak learners?
What is COVID’s impact on you?
Where do you see yourself in 5 years?
What was the one project that you did and you were proud of?

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