Tip 1: Practice daily.
Tip 2: Solve questions on coding platforms.
Tip 3: Study OOP concepts (with examples).
Tip 1: It should be short, ideally one page.
Tip 2: You should know everything you have mentioned.
It was a pen-and-paper round which comprised of Output-based MCQ questions. Mostly consisting of C++ and Linux-based questions.



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
Gave Recursive, Two pointer and stack approach.



String 'S' is NOT case sensitive.
Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
Gave a basic two-pointer approach.



We have an array ARR = {1, 2, 3, 4, 5, 6} and M = 3 , considering 0
based indexing so the subarray {5, 6} will be reversed and our
output array will be {1, 2, 3, 4, 6, 5}.
Just gave a basic solution to swap the array contents using two pointers.
It was taken by the Manager himself.



Queue implementation in C++ using class. It should perform all the operations such as push, pop and delete.
First explained my approach to how I will be making all the functions and encapsulating them in one class. Then after taking her suggestions proceeded with the solution
Write a C++ program to implement a copy constructor. (Learn)
Just explained to her my approach and understanding of Copy Constructors.
Basic Linux Commands. (Learn)

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