Tip 1: Practice at least 200-250 coding questions on online coding platforms.
Tip 2: Be clear with your basics of Data Structures, Algorithms, DBMS, Operating System, and OOPS concepts.
Tip 1: Mention at least 1 or 2 real-time projects in your resume to showcase your practical knowledge.
Tip 2: Keep your resume simple, clear, and avoid adding false information or skills which you are not confident about.
I was asked MCQs on Aptitude, OS, DBMS, OOPS, Computer Networks, DSA, and general programming concepts. And some other questions.
A man can complete a work in 20 days, and his friend can complete the same work in 30 days. If both work together, in how many days will they complete the work?
What will be the output of the following code?
int x = 5;
int y = 10;
System.out.println(x++ + ++y);
x++ = 5 (but after execution x becomes 6)
++y = 11
Output = 5 + 11 = 16
Tip 1: Read Galvin (Operating System Concepts) thoroughly for OS fundamentals like semaphores, virtual memory, deadlock, paging, etc.
Tip 2: Practice SQL queries regularly on online coding platforms.
How would you handle high traffic and ensure scalability? (Learn)
Tip 1: Identify Core Components.
Tip 2: Design for Scalability.
Tip 3: Unique Key Generation.
Timing: It was in the afternoon. The environment was good.
A man is looking at a photograph of someone. His friend asks, "Whose picture are you looking at?" The man replies, "Brothers and sisters, I have none. But that man's father is my father's son."
Who is in the photograph?
Stay calm and read the puzzle carefully, focus on each line.
You have 3 boxes.
One box contains only apples.
One box contains only oranges.
One box contains both apples and oranges.
All the boxes are labelled incorrectly. You are allowed to pick only one fruit from any one box. How will you label all boxes correctly?
Tip 1:Try to break down the problem into smaller parts or draw diagrams.
Tip 2: Practice logical reasoning and puzzle-type questions regularly.
Convert long URLs into short URLs. (Learn)
Explain Normalization and its types in DBMS with examples. (Learn)
Tip 1: Understand the basic concepts of DBMS like Keys, Constraints, and Normalization.
Tip 2: Practice SQL Queries.
Tip 3: Revise ER Diagrams, Relationships (1:1, 1:M, M:N) & Functional Dependencies for better clarity in interviews.



Given an array of integers nums and an integer target, return the indices of the two numbers such that they add up to the target.
You may assume that each input has exactly one solution, and you may not use the same element twice.
def two_sum(nums, target): num_map = {} # Step 1: Create an empty dictionary for i, num in enumerate(nums): # Step 2: Loop through the list complement = target - num # Step 3: Calculate the complement if complement in num_map: # Step 4: Check if complement already seen return [num_map[complement], i] # Step 5: Return indices num_map[num] = i # Step 6: Store the current number with its index return [] # Step 7: Return empty if no pair found



Write a function that takes a string as input and returns true if the string is a palindrome (reads the same forward and backward), ignoring cases and non-alphanumeric characters.
Step 1: Clean the string by removing all non-alphanumeric characters using regex and convert it to lowercase.
So, "A man, a plan, a canal: Panama" becomes "amanaplanacanalpanama".
Step 2: Use two pointers — one starting from the beginning (left) and one from the end (right).
Step 3: Compare characters at left and right.
Step 4: If characters are not equal, return false (not a palindrome).
Step 5: If the entire string passes without mismatches, return true (it is a palindrome).
Tip 1: Prepare a good self-introduction including your education, skills, project, and achievements.
Tip 2: Be honest, confident, and maintain a positive attitude while answering.
Tip 3: Research about the company background, vision, and recent achievements.
Tip 4: Prepare common HR answers beforehand and practice in front of a mirror or with friends.

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