Tip 1 : The most important thing is to prepare Data Structures and Algorithms. Ensure to be very much clear on your basics and skills.
Tip 2 : Practice a minimum of 100 DSA questions. Practice aptitude and reasoning questions regularly.
Tip 1 : Make a one page resume.
Tip 2 : Add links to show originality of your projects.
Tip 3 : Do not add false information just to fill the resume.
Sum Between Zeroes
You are given a Singly Linked List which contains a series of integers separated by ‘0’.
Between two zeroes, you have to merge all the nodes lying between them into a single node which contains the sum of all the merged nodes. You have to perform this in place.
MCQ Round 1Topics:- Maths(Probability, a little Trigonometry), Puzzles. This round was a little tough as the time required to solve these question was a lot.
MCQ Round 2 Topics - Computer fundamentals (OOPS, Algorithm, Data Structure, Operating System, Computer Networks, DBMS)
Number Of MCQs - 20
It is guaranteed that there will be no two consecutive zeroes, and there will always be a zero at the beginning and end of the linked list.
This was the last round of evaluation. The interview started with some questions related to the projects mentioned in my CV. After around 30 minutes, a coding question based on Graph Data Structure was asked (It was related to Topological sorting). I was asked to explain the idea and approach to the problem and not to code. At last, a few HR questions were also asked in the same round.
The first line of input contains a single integer 'N' denoting the total number of houses.
The second line of input contains 'N' single space-separated integers, denoting the amount of money in every 'i-th' house.
The only line of output will print the maximum amount of loot that is possible.
You don’t need to print anything, it has already been taken care of. Just implement the given function.
Constraints :
0 <= 'N' <= 10^5
0 <= 'A[i]' <= 10^4
Where 'A[i]' represents the money present in the 'i-th' house.
Time limit: 1 sec
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?