Given an array of some elements having some weight - pop out two heaviest elements (x &y) from the array - then compare them until array is empty of there is only one element left comparisons: if x!=y ( push x-y into the array) if x==y ( do nothing)
Software Engineer Backend Interview Questions
15,496 software engineer backend interview questions shared by candidates
VP interview - 4 buttons logic puzzle
A fairly average js question to get all the github pullrequest and it's reviewers and create an api to give it back in the response.
1. Describe Some Feature you worked on recently 2. Let's say we have an API with a rate limit of 20 req/ IP/ min. How would you design/implement this limit?
Basically build a room finder given a number of people and a list of room objects
Discussing the architecture of a hypothetical system and questions about past experiences
How do you think a mutex would be implemented internally?
What's the purpose of the three-way handshake in TCP/IP?
Implement fibonacci sequence function
Design splitwise application Input You can create a few users in your main method. No need to take it as input. There will be 3 types of input: Expense in the format: EXPENSE <user-id-of-person-who-paid> <no-of-users> <space-separated-list-of-users> <EQUAL/EXACT> <space-separated-values-in-case-of-non-equal> Show balances for all: SHOW Show balances for a single user: SHOW <user-id> Output When asked to show balance for a single user. Show all the balances that user is part of: Format: <user-id-of-x> owes <user-id-of-y>: <amount> If there are no balances for the input, print No balances In cases where the user for which balance was asked for, owes money, they’ll be x. They’ll be y otherwise.
Viewing 871 - 880 interview questions