Lead Developer Interview Questions

3,923 lead developer interview questions shared by candidates

- How would you design a microservice that can handle a high load? - What are the spring boot scopes and describe each one - Explain the different types of joins and when you would use them. - How does the HashMap work underneath the hood - What is multi-threading and what scenario can you use it - Other leadership questions
avatar

Lead Java Developer

Interviewed at Barclays

4
Jan 31, 2023

- How would you design a microservice that can handle a high load? - What are the spring boot scopes and describe each one - Explain the different types of joins and when you would use them. - How does the HashMap work underneath the hood - What is multi-threading and what scenario can you use it - Other leadership questions

Given a string s = "catsandog" wordDict = ["cats","dog","sand","and","cat"] String s="applepen" -> apple , pen wordDict=["app","apple","pencil","pen"] Find is string itself or string divided in words is present ins word dictionary or not.
avatar

Lead Software Engineer

Interviewed at MakeMyTrip

4.1
Sep 28, 2023

Given a string s = "catsandog" wordDict = ["cats","dog","sand","and","cat"] String s="applepen" -> apple , pen wordDict=["app","apple","pencil","pen"] Find is string itself or string divided in words is present ins word dictionary or not.

1. Given a linked list, find the length/k the node in one iteration. 2. Given an array of characters and their priority and a number n(n<=length of character array) 2.1. Find the character whose length is n and characters are in order of their probability, character which has equal priority has equal probability of coming first. 2.2 This time characters are associated with weights, which means characters with same priority has unequal probability of coming first according to their weights.
avatar

Lead Software Engineer

Interviewed at MakeMyTrip

4.1
Oct 23, 2022

1. Given a linked list, find the length/k the node in one iteration. 2. Given an array of characters and their priority and a number n(n<=length of character array) 2.1. Find the character whose length is n and characters are in order of their probability, character which has equal priority has equal probability of coming first. 2.2 This time characters are associated with weights, which means characters with same priority has unequal probability of coming first according to their weights.

Viewing 3141 - 3150 interview questions

Glassdoor has 3,923 interview questions and reports from Lead developer interviews. Prepare for your interview. Get hired. Love your job.