Tip 1: Prepare a good resume that is ATS-friendly. This is the first step toward getting a chance for an interview.
Tip 2: Prepare all the technical fundamental core subjects, and solve lots of problems (15-20 questions from each topic). Additionally, having 2-3 projects on your resume is a must.
Tip 3: Try to set up mock interviews with seniors or friends before your actual interview.
Tip 4: Also, prepare solid principles, design patterns, and high-level system design.
Tip 1: Add at least 2-3 projects and try to provide links to your projects where you have deployed them or stored the codebase.
Tip 2: Do not write false information; you will get caught during interviews.
This round was online on HackerRank for 1 hour, where I received 20 multiple-choice questions on core computer science subjects like Computer Networks, Operating Systems, OOP, C++, Java, and one coding question based on DSA problem-solving.
1. Every train will depart on the same day and the departure time will always be greater than the arrival time. For example, A train with arrival time 2240 and departure time 1930 is not possible.
2. Time will be given in 24H format and colons will be omitted for convenience. For example, 9:05AM will be given as "905", or 9:10PM will be given as "2110".
3. Also, there will be no leading zeroes in the given times. For example, 12:10AM will be given as “10” and not as “0010”.
Approach:
Sort the arrival and departure times:
Use two pointers:
Maintain a count of platforms needed:
Track the maximum number of platforms needed:
This round was 60 minutes long, and there was one interviewer. He asked me to share my screen and turn on the video. Then, we had our introductions, and DSA questions were discussed.
It is possible for Mr. X to rob the same amount of money by looting two different sets of houses. Just print the maximum possible robbed amount, irrespective of sets of houses robbed.
(i) Given the input array arr[] = {2, 3, 2} the output will be 3 because Mr X cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses. So, he’ll rob only house 2 (money = 3)
(ii) Given the input array arr[] = {1, 2, 3, 1} the output will be 4 because Mr X rob house 1 (money = 1) and then rob house 3 (money = 3).
(iii) Given the input array arr[] = {0} the output will be 0 because Mr. X has got nothing to rob.
We cannot use the element at a given index twice.
Try to do this problem in O(N) time complexity.
This round was based on system design. In this round, I first had an introduction, and then he gave me a problem statement to design a key-value store.
Design A Key-Value Store.
Tip 1: First, I discussed all functional and non-functional requirements.
Tip 2: Then, I had a discussion on the back-of-envelope calculation.
Tip 3: After that, I discussed the high-level design diagram. I also discussed the database, caching, API gateway, load balancer, and CDN.
Tip 4: I also discussed the APIs we will use and their design.
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?