Tip 1: Practice DSA — at least try to complete Striver’s SDE Sheet.
Tip 2: Try to maintain a good CGPA (above 8), as it helps you get more opportunities, and strong knowledge of computer fundamentals also helps in clearing interviews.
Tip 3: Do at least one internship, even if it’s unpaid, as it helps you gain practical learning and adds value to your resume. Also, build some good projects.
Tip 1: Mention quantifiable achievements, such as solving X number of questions, achieving X rating, or being among the top 10 on coding platforms.
Tip 2: Include some good projects on your resume, and do not lie, as false information can negatively affect you during interviews.
The OA round took place in the afternoon in the lab, and there were invigilators present from both the company and our college. The camera was on throughout the test.

Input: ‘n’ = 7 ‘k’ = 3
‘a’ = [1, 2, 3, 1, 1, 1, 1]
Output: 3
Explanation: Subarrays whose sum = ‘3’ are:
[1, 2], [3], [1, 1, 1] and [1, 1, 1]
Here, the length of the longest subarray is 3, which is our final answer.
Tip 1: Practice sliding window questions — you can refer to a YouTube series on the sliding window technique.



Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.
1) Kth largest element in an array is the kth element of the array when sorted in non-increasing order.
2) All the elements of the array are pairwise distinct.
Questions were asked related to OS, Computer Networks, DBMS, and OOPs.
Tip 1: Study the top interview questions.



Input:
'a' = [1, 2, 4, 5], 'n' = 5
Output :
3
Explanation: 3 is the missing value in the range 1 to 5.
Approach 1: Find the sum of all elements in the array and subtract it from the sum of the first 100 natural numbers.
Approach 2: Find the XOR of the first 100 natural numbers, then XOR it with each element in the array. The final XOR result will be the missing number.
Approach 3: Use a map or vector to check which elements are present in the array.
Find the smaller of two numbers without using if–else statements or the less-than/greater-than operators.
Smaller number= (a+b - (mod(a-b)))/2
Just maintain a map to store the frequency of characters. Whenever the frequency of any character becomes 2, shift the left pointer until the frequency reduces back to 1, and keep updating the maximum size.
There are three light bulbs in one room and three switches in another room, and you need to determine which switch controls which light.
Turn on two light bulbs and leave the third one switched off. After 10 minutes, switch off one of the two bulbs that were on. Then go to the other room. You can identify the bulbs as the warm one, the one that is on, and the one that is off.

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