XpressBees IT Executive Interview Questions and Answers

Easy leetcode code 2 questions , HTML5 css javascript simple screen design

Q1. Oop, Simple coding javascript, react basic, sql basic
Add your answer

Q1. DSA Questions - Easy to medium
Add your answer

It was medium hard and it did filter out many Candidates.

Leetcode easy level coding problems

Q1. Java Fundamentals
Add your answer
Q2. WEB MVC concepts
Add your answer

Q1. About myself, strengths, weaknesses, passion, etc.
Add your answer
Q2. Questions on extra-curricular, co-curricular experience
Add your answer
Q3. Goal, motivation, five-year plan, etc.
Add your answer

There was 2 coding question
One was easy One was very Difficult
20 MCQ question from Operating system and DBMS

Q1. First question was binary search in unsorted arrays So here i have asked about sorting algorithms all sorting algorithms must be clear
Add your answer
Q2. Second question was to find longest consecutive subarray.
Ans. 
Find the longest consecutive subarray.
• Iterate through the array and keep track of the current subarray length.

• Update the maximum length as you iterate.

• Reset the current subarray length when a non-consecutive element is encountered.
Answered by AI
Add your answer

Q1. OOPS related question Heap insertion deletion question Hashing Spanning tree
Add your answer
Q2. Minimum Spanning tree Implementation of MST
Ans. 
Minimum Spanning Tree (MST) is a tree that connects all vertices in a graph with minimum total edge weight.
• MST can be found using Prim's algorithm or Kruskal's algorithm.

• Prim's algorithm starts with a single vertex and adds the closest vertex to the tree until all vertices are included.

• Kruskal's algorithm starts with the edges with the lowest weight and adds them to the tree as long as they don't create a cycle.

• MST has...read more
Answered by AI
Add your answer