Skip to contentSkip to footer

Lead Backend Developer Interview Questions

Salaries
Interviews

15,499 lead backend developer interview questions shared by candidates

You are given an array hours that represents the number of hours an employee worked each day. A day is classified as a tiring day if the employee worked strictly more than 8 hours that day. A well-performing interval is a consecutive sequence of days where the number of tiring days is strictly greater than the number of non-tiring days. Your task is to find the length of the longest well-performing interval. For example, if hours = [9, 9, 6, 0, 6, 6, 9]: Days with hours > 8 are tiring days: positions 0, 1, and 6 (values 9, 9, 9) Days with hours ≤ 8 are non-tiring days: positions 2, 3, 4, 5 (values 6, 0, 6, 6) The interval from index 0 to 2 has 2 tiring days and 1 non-tiring day, making it well-performing The entire array from index 0 to 6 has 3 tiring days and 4 non-tiring days, which is not well-performing The goal is to find the maximum length among all possible well-performing intervals.
avatar

Backend Software Engineer (Golang)

Interviewed at NetApp

3.8★
Mar 5, 2026

You are given an array hours that represents the number of hours an employee worked each day. A day is classified as a tiring day if the employee worked strictly more than 8 hours that day. A well-performing interval is a consecutive sequence of days where the number of tiring days is strictly greater than the number of non-tiring days. Your task is to find the length of the longest well-performing interval. For example, if hours = [9, 9, 6, 0, 6, 6, 9]: Days with hours > 8 are tiring days: positions 0, 1, and 6 (values 9, 9, 9) Days with hours ≤ 8 are non-tiring days: positions 2, 3, 4, 5 (values 6, 0, 6, 6) The interval from index 0 to 2 has 2 tiring days and 1 non-tiring day, making it well-performing The entire array from index 0 to 6 has 3 tiring days and 4 non-tiring days, which is not well-performing The goal is to find the maximum length among all possible well-performing intervals.

There are N people living in a row of houses. Each person a personality char. Each person fights with a person of opposite personality char. For example, a fights z, b fights y, c fights x, d fights w, etc. From given string X consisting of personalities of each person, determine the number of pairs of people who would fight.
avatar

Backend Developer

Interviewed at Netcore

4.3★
Sep 5, 2024

There are N people living in a row of houses. Each person a personality char. Each person fights with a person of opposite personality char. For example, a fights z, b fights y, c fights x, d fights w, etc. From given string X consisting of personalities of each person, determine the number of pairs of people who would fight.

Viewing 4601 - 4610 interview questions

Glassdoor has 15,499 interview questions and reports from Lead backend developer interviews. Prepare for your interview. Get hired. Love your job.