Have you had any conflicts at work?
Lead Backend Developer Interview Questions
12,385 lead backend developer interview questions shared by candidates
Just the usual HR questions.
SELECT queries and order by queries. Binary tree and hashing, two sum
DSA, Low Level Design Questions
First-round DS algo and problem-solving questions.
A question on array math(moderate level) A question on strings which used map(easy level) https://www.geeksforgeeks.org/design-a-stack-that-supports-getmin-in-o1-time-and-o1-extra-space/ Reverse a linked list. Series of questions on queries(MySQL and ORM both) Print a star using Python ONLY. A question on Binary Search(Moderate level) Design backend of LUDO. Basic MCQs on HTTP, REST API, DBMS, Python.
Technical questions related to the flow of how calls are made from the frontend to the backed. HTTP responses, express technical questions, Node.js technical simple questions, code reading also to detect an error in the way a function is writed.
In the technical interview, their engineer asked me questions about the assignment to judge me about how I solved the problem.
There are n gas stations along a circular route between cities of Delhi-Mumbai-Banglore-Kolkata-Delhi in India. Read the following informations. 1. At each station (say {i}th), you can fill your car's tank by gas[i] litres. 2. The gas required to travel from {i}th gas station to {i+1}th gas station is cost[i] litres. Given two integer arrays gas and cost, Find the gas station number from which you can start your journey to complete the round trip by reaching the same gas station. If not possible, return -1. station [1, 2, 3, 4, 5, 6, 7, 8] gas -> [3, 2, 5, 4, 1, 6, 7, 8] cost -> [3, 4, 2, 6, 7, 1, 5, 8] */ // gas = [3, 2, 5, 4, 1, 6, 7, 8] // cost = [3, 4, 2, 6, 7, 1, 5, 8] // start
Spiral Tree Traversal : solved using 2 stacks but he asked to solve again using recursion
Viewing 8241 - 8250 interview questions