Tip 1: Practice DSA problems regularly.
Tip 2: Strengthen your SQL query skills through hands-on exercises.
Tip 3: Build and refine full-stack projects to showcase your technical skills.
Tip 1: Have at least 2 full-stack major projects to demonstrate your development skills.
Tip 2: Include links to your coding platforms and GitHub profile to validate your work and showcase your contributions.
It was mostly reasoning and puzzle based MCQ questions.
Find the next number in the series:
2, 6, 12, 20, 30, ?
Pointing to a man in a photo, Rina said, “He is the only son of my father’s wife.” How is Rina related to the man?
Statements:
All cats are animals.
Some animals are dogs.
Conclusion:
(I) Some cats are dogs.
(II) All cats are dogs.
A person walks 5 km North, then turns right and walks 3 km, then turns right again and walks 5 km. Which direction is he facing now?
In a code language, if TREE is coded as USFF, how is PLAN coded?
Three people need to cross a bridge at night. They have one torch, and at most two people can cross at a time. They take 1, 2, and 5 minutes respectively. What's the minimum time to get all three across?
You’re outside a room with 3 switches. One of them controls a bulb inside the room. You can only enter the room once. How do you find out which switch controls the bulb?
You have 8 balls, one of which is slightly heavier. You can use a balance scale only twice. How do you find the heavier ball?
You have a 7-minute and 4-minute hourglass. How can you measure exactly 9 minutes?
What will be the output of the following C code?
#include
int mystery(int arr[], int size) {
int i, result = 0;
for(i = 0; i < size; i++) {
result ^= arr[i];
}
return result;
}
int main() {
int data[] = {5, 3, 5, 4, 3};
int size = sizeof(data) / sizeof(data[0]);
printf("Result: %d\n", mystery(data, size));
return 0;
}
This code uses the XOR (^) operation. In XOR, a number XORed with itself becomes 0, and XOR with 0 returns the number. Here’s how it works step-by-step:
5 ^ 3 = 6
6 ^ 5 = 3
3 ^ 4 = 7
7 ^ 3 = 4
The interview was conducted online during the daytime and was well-scheduled without any delays. The environment was calm and professional, and the overall process was smooth.



Write a function that takes a list of strings and returns the longest common prefix shared among all strings.
If there is no common prefix, return an empty string.
Example:
Input: ["flower", "flow", "flight"]
Output: "fl"
Input: ["dog", "racecar", "car"]
Output: ""
Step 1: Identify that we need to find the common starting characters in all strings.
Step 2: Use the first string as a reference for comparison.
Step 3: Iterate character by character and compare with corresponding characters in other strings.
Step 4: Stop at the first mismatch and return the prefix built so far.
Step 5: Return an empty string if the input is empty or no common prefix is found.



Given an array of positive integers and a target sum, find the starting and ending indices of the subarray that adds up to the given sum. Return -1 if no such subarray exists.
Example:
Input: arr[] = {1, 4, 20, 3, 10, 5}, sum = 33
Output: Subarray found from index 2 to 4
Input: arr[] = {1, 4, 0, 0, 3, 10, 5}, sum = 7
Output: Subarray found from index 1 to 4
Step 1: Initialize a sliding window with start = 0 and current_sum = arr[0].
Step 2: Expand the window by moving the end pointer and adding to the sum.
Step 3: If the sum exceeds the target, shrink the window by moving the start pointer.
Step 4: If the current sum matches the target, record the start and end indices.
Step 5: If no match is found till the end, return -1 as no such subarray exists.
The interviewer made me feel comfortable and it first started with basic intro then later moved to technical questions. So it was mix of both HR and technical interview.
What is the difference between DELETE, TRUNCATE, and DROP? (Learn)
What is indexing? How does it improve query performance. (Learn)



In the given linked list, there is a cycle, hence we return true.

Step 1: Understand that a cycle means a node points back to a previous node in the list.
Step 2: Use Floyd’s algorithm which is efficient and doesn’t require extra space.
Step 3: Initialize two pointers: slow (moves 1 step) and fast (moves 2 steps).
Step 4: Traverse the list while both pointers are not NULL.
Step 5: If slow and fast meet, a cycle is detected.
Step 6: If fast or fast->next becomes NULL, there’s no cycle.
Step 7: Return true if pointers meet, else return false.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: