Software De Backend Interview Questions

15,486 software de backend interview questions shared by candidates

export class MeetingRoom { roomName: string; capacity: number; constructor(roomName: string, capacity: number) { this.roomName = roomName; this.capacity = capacity; } } import { MeetingRoom } from "./MeetingRoom"; export class MeetingRoomFinder { private meetingRooms: MeetingRoom[]; constructor(meetingRooms: MeetingRoom[]) { this.meetingRooms = meetingRooms; } bookMeetingRoom(numberOfPeople: number, date: Date): MeetingRoom | null { return null; // Default implementation } } add your code to here bookMeetingRoom make sure to handle
avatar

Senior Backend Software Engineer

Interviewed at HiBob

4.4
May 1, 2025

export class MeetingRoom { roomName: string; capacity: number; constructor(roomName: string, capacity: number) { this.roomName = roomName; this.capacity = capacity; } } import { MeetingRoom } from "./MeetingRoom"; export class MeetingRoomFinder { private meetingRooms: MeetingRoom[]; constructor(meetingRooms: MeetingRoom[]) { this.meetingRooms = meetingRooms; } bookMeetingRoom(numberOfPeople: number, date: Date): MeetingRoom | null { return null; // Default implementation } } add your code to here bookMeetingRoom make sure to handle

1st round: 1. Time and Space complexity of all the data structures and algorithms. 2. What is Scaling? What is Vertical and Horizontal Scaling? 3. Questions on Java 8 2nd round: 3 coding questions, I attended only two 1. Balancing brackets like "()[]{}" and "([)]" . Push in stack if open bracker is encountered and pop from Stack if closing bracket is the and match them. https://leetcode.com/problems/valid-parentheses/ 2. Given a linked list, determine if it has a cycle in it https://leetcode.com/problems/linked-list-cycle/
Oct 31, 2021

1st round: 1. Time and Space complexity of all the data structures and algorithms. 2. What is Scaling? What is Vertical and Horizontal Scaling? 3. Questions on Java 8 2nd round: 3 coding questions, I attended only two 1. Balancing brackets like "()[]{}" and "([)]" . Push in stack if open bracker is encountered and pop from Stack if closing bracket is the and match them. https://leetcode.com/problems/valid-parentheses/ 2. Given a linked list, determine if it has a cycle in it https://leetcode.com/problems/linked-list-cycle/

Viewing 441 - 450 interview questions

Glassdoor has 15,486 interview questions and reports from Software de backend interviews. Prepare for your interview. Get hired. Love your job.