XpressBees SDE Interview Questions and Answers

Q1. Leetcode easy level questions
Add your answer

Q1. Leetcode easy level questions
Add your answer

Q1. Leetcode plus resume
Add your answer

Puzzle based questions and Math problems

Given a laptop and problem statement. Had to solve problems at eclipse.

Q1. F2F one on one technical interview
Add your answer

DSA,COMPUTER FUNDAMENTALS

Q1. TELL ABOUT TREE TRAVERSALS
Ans. 
Tree traversals are methods used to visit each node in a tree data structure in a specific order.
• Inorder traversal: Visit left subtree, then root, then right subtree

• Preorder traversal: Visit root, then left subtree, then right subtree

• Postorder traversal: Visit left subtree, then right subtree, then root
Answered by AI
Add your answer

Simple 3 dsa ques was asked from leetcode.
sum of array equals to the one

Q1. H h h h
Add your answer
Q2. Detet cycle in ll
Ans. 
Detect cycle in a linked list
• Use Floyd's Tortoise and Hare algorithm to detect a cycle in a linked list

• Start with two pointers, one moving at twice the speed of the other

• If there is a cycle, the two pointers will eventually meet
Answered by AI
Add your answer

Q1. DSA ARRAY QUESTIONS EASY TO MEDIUM LEVEL
Add your answer

Round duration - 180 minutes
Round difficulty - Medium

It was a long round of around 3 hours divided into 2 parts 
1. Aptitude(MCQ)
2. Coding(Subjective)

Q1. 
Maximum Meetings Selection
You are tasked with scheduling meetings in a single meeting room. Given N meetings, each with a start time Start[i] and end time End[i], determine the maximum number of meetings...read more
Ans. 
Given start and end times of meetings, find the maximum number of meetings that can be scheduled in a single room.
• Sort the meetings based on their end times in ascending order.

• Iterate through the sorted meetings and select the ones that do not overlap with the previously selected meetings.

• Keep track of the selected meetings and return their indices.
Answered by AI
Add your answer
Q2. 
Partition to K Equal Sum Subsets Problem
Given an array of integers and a positive integer 'K', determine if it is possible to divide the array into 'K' non-empty subsets such that the sum of elements in ...read more
Ans. 
The problem involves dividing an array into K subsets with equal sum.
• Use backtracking to try all possible combinations of subsets.

• Keep track of the sum of elements in each subset and check if they are equal to the target sum.

• Optimize by sorting the array in descending order and assigning elements to subsets greedily.

• Handle edge cases like when the sum of elements is not divisible by K.
Answered by AI
Add your answer
Q3. 
Merge k Sorted Linked Lists
You are provided with 'K' sorted linked lists, each sorted in increasing order. Your task is to merge all these lists into one single sorted linked list and return the head of ...read more
Ans. 
Merge k sorted linked lists into one single sorted linked list.
• Create a min-heap to store the heads of all linked lists.

• Pop the smallest element from the heap and add it to the result list.

• If the popped element has a next element, push it back to the heap.

• Repeat until all elements are merged into a single sorted list.
Answered by AI
Add your answer
Q4. 
Sort a "K" Sorted Doubly Linked List
Given a doubly-linked list with N nodes, where each node’s position deviates at most K positions from its position in the sorted list, your task is to sort this given ...read more
Ans. 
Sort a doubly linked list where each node's position deviates at most K positions from its position in the sorted list.
• Iterate through the doubly linked list and maintain a min-heap of size K+1 to keep track of the next smallest element.

• Remove the smallest element from the heap and add it to the sorted list. Update the heap with the next element from the removed node's next position.

• Continue this process until all node...read more
Answered by AI
Add your answer
Q5. 
Duplicate Subtrees Problem Statement
Given a binary tree, return the root values of all duplicate subtrees. Two subtrees are considered duplicate if they have the same structure with identical node values...read more
Ans. 
Find root values of duplicate subtrees in a binary tree.
• Traverse the tree in a bottom-up manner to identify duplicate subtrees.

• Use a hashmap to store the subtree structures and their frequencies.

• Return the root values of duplicate subtrees based on hashmap entries.
Answered by AI
Add your answer

Round duration - 25 minutes
Round difficulty - Medium

The technical Interview round was not at all difficult. The main focus of the interviewer was my projects and development fields.
He also asked some DS/Algo questions that were at a medium level, and some easy questions for database management.

Q1. Can you explain the concept of keys in database management systems?
Ans. 
Keys in database management systems are unique identifiers for rows in a table.
• Keys ensure data integrity by enforcing uniqueness and relationships between tables.

• Primary key uniquely identifies each record in a table (e.g. employee ID).

• Foreign key establishes a link between two tables by referencing the primary key of another table.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It took place on the same day as the technical round. It was quite the easiest round of all. The interviewer just asked me to introduce myself, projects I have worked on, my Internships experience, and were they internships paid.

Q1. Can you tell me about yourself?
Add your answer
Q2. Can you tell me about the different projects that you have worked on?
Add your answer

Linked list questions and DFS problems

Q1. Why do you want to come in Byju's
Add your answer