90 mins. A spring boot hackerrank question. As soon as you log into the hackerrank test. You will get a GitHub URL. You can copy the URL and clone the repository in your local. You have to work on your local machine and keep pushing your commits to the repository. All the necessary POJOs, service implementation, and databases are in place I was asked to implement the following questions: 1. Implement a GET /hotel/{id} to retrieve a hotel by Id 2. Implement a DELETE /hotel/{id} to delete a hotel by Id. (It should not be actually deleted from the system but should be marked as 'deleted') 3. Search all the hotels closest to the city center. /search/{cityId}. The city object has latitude and longitude and the hotel object also has latitude and longitude. The distance between two can be calculated using the haversine formula, (The question says we can use the internet to calculate the haversine formula)
Backend Developer Interview Questions
15,489 backend developer interview questions shared by candidates
Implement a circular queue that supports input and output using the fifo method
Various questions to implement an API Rest.
The values interview questions were all provided beforehand by the internal recruiter, to allow the candidate to prepare answers in advance for each point. The technical interview tasks were also provided beforehand, for the candidate to prepare for, and to allow the candidate to practice both parts if they so desired. The first technical interview task was to domain model for a situation. The second technical interview task was to write the backend ruby code for a different requirement.
They asked about my past projects and also about my experience working remotely during pandemic.
What do you know about Glovo?
What relational database are you familiar with using?
What was asked in DOE round ?
Round2 (Technical 2): This interview supposed to be tougher than the previous one. The interviewer asked me about java fundamental questions. Notes: Look into topics like thread, garbage collection, collections framework. After that, he asked me to design LRU Cache. Was able to do that. Then asked me to implement Priority Queue. Also did that. And that was all for this round.
1. Print all the interleavings between given two strings of length m,n without changing the relative of order of each string. Eg: if str1 = 'AB', m=n, str2 = 'CD', n=2 Then output should be all the interleavings. output: abcd acbd acdb cabd cadb cdab i.e 6 possibilities
Viewing 1331 - 1340 interview questions