Tip 1 : I prepared all topics from my Coding Ninjas Course and Udemy.
Tip 2 : I practiced 100+ questions on coding platforms.
Tip 1 : Have good projects and internships.
Tip 2 : Keep short and do not put false things.
I got a calypod test with a test window of 90 minutes in which I needed to complete a 60-minute test. This test was a mixture of aptitude, computer programming and computer subjects, which were 45 in number. It had two coding questions as well.



1. Rightmost element is always a leader.
2. The order of elements in the return sequence must be the same as the given sequence
The given sequence is 13, 14, 3, 8, 2 .
13 Not a leader because on the right side 14 is greater than 13.
14 lt is a leader because no one greater element in the right side.
3 Not a leader because on the right side 8 are greater than 3.
8 It is a leader because no one greater element on the right side.
2 It is a leader because it is the rightmost element in a sequence.
Hence there are 3 leaders in the above sequence which are 14, 8, 2.
Used stack approach to solve this question.



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?
I got a call for the interview. There was a lot of technical questions being asked in this, starting from computer subjects, coding concepts, puzzle, and past projects which i wrote in my resume.


Consider ARR = [2, 4, 5, 15], all possible good subsets following the given conditions are (2), (4), (5), (15), (2,4), and (5,15). Hence, the total number of good subsets is 6 in this case.
We downsize the Array nums into Array V, by converting the numbers into 10-bit-representations, and store the frequency for repeated occurences.



[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
If the number is greater than the last element of the last bucket (i.e., the largest element in the current subsequence), we append the number to the end of the list. This indicates that we have found a longer subsequence.
Otherwise, we perform a binary search on the list of buckets to find the smallest element that is greater than or equal to the current number. This step helps us maintain the property of increasing elements in the buckets.
Once we find the position to update, we replace that element with the current number. This keeps the buckets sorted and ensures that we have the potential for a longer subsequence in the future.
You have 5 jars of pills. Each pill weighs 10 grams, except for contaminated pills contained in one jar, where each pill weighs 9 grams. Given a scale, how could you tell which jar had the contaminated pills in just one measurement?
Tip 1: practice some questions this will help to increase problem solving in interview.
Tip 2: Ask interviewer in case of doubts.
This was just HR discussion and basic Hr questions were asked and when they will onboard us Whether I can relocate to the job location or not. This went well and hence I received the offer in 2-3 days after this round.
What are your expectations from the company, and can you relocate to the job location i.e. Bangalore?
Why do you want to join us?
Where do you see yourself in 5 years?
Tip 1: No specific preparation is required.

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