EASEBUZZ Interview Questions, Process, and Tips

Round duration - 70 minutes
Round difficulty - Easy

there was some coding questions and some mcqs related to js, html, css, java and aptitude.

Q1. 
Bridge in Graph Problem Statement
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...read more
Ans. 
Find all the bridges in an undirected graph by identifying edges that, when removed, increase the number of connected components.
• Use Tarjan's algorithm to find bridges in the graph.

• Keep track of the discovery time and low time of each vertex during DFS traversal.

• An edge (u, v) is a bridge if low[v] > disc[u].

• Handle multiple test cases efficiently to find bridges in each graph.

• Ensure the output contains the count of
Answered by AI
Add your answer
Q2. 
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...read more
Ans. 
The task is to find the maximum amount of money Mr. X can rob from houses arranged in a circle without alerting the police.
• The problem can be solved using dynamic programming.

• Create two arrays to store the maximum amount of money robbed when considering the first house and when not considering the first house.

• Iterate through the array and update the maximum amount of money robbed at each house.

• The final answer will be
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

MCQ based on web and oops.

Q1. 
Subtree of Another Tree Problem Statement
Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.
Explanation:
...read more
Ans. 
Determine if one binary tree is a subtree of another binary tree based on their structure and node values.
• Traverse through the main tree and check if any subtree matches the second tree

• Use recursion to compare nodes of both trees

• Handle edge cases like empty trees or null nodes

• Check if the root node of the second tree exists in the main tree
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

This round involved a discussion of a project I had undertaken recently and a coding problem. How does an Angular application work? List out differences between AngularJS and Angular

Q1. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. 
The task is to find the number of distinct ways to climb from the 0th step to the Nth step, where each time you can climb either one step or two steps.
• Use dynamic programming to solve this problem

• Create an array to store the number of ways to reach each step

• Initialize the first two elements of the array as 1 and 2

• For each subsequent step, the number of ways to reach that step is the sum of the number of ways to reach t...read more
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

The interview mostly focused on coding problems and Java-related concepts.

Q1. How is a Linked List implemented in Java, and when would you prefer it over an ArrayList?
Ans. 
A Linked List in Java is implemented using nodes with references to the next node. It is preferred over an ArrayList when frequent insertions and deletions are required.
• In Java, a Linked List is implemented using a Node class with data and a reference to the next Node.

• LinkedList class in Java provides methods like add(), remove(), and get() for manipulating the list.

• Linked List is preferred over ArrayList when frequent...read more
Answered by AI
Add your answer
Q2. 
Prerequisite Task Completion Verification
Given a positive integer 'N', representing the number of tasks, and a list of dependency pairs, determine if it is possible to complete all tasks considering thes...read more
Ans. 
Determine if it is possible to complete all tasks considering prerequisites.
• Create a graph representation of the tasks and dependencies.

• Use topological sorting to check if there is a cycle in the graph.

• Return 'Yes' if no cycle is found, 'No' otherwise.
Answered by AI
Add your answer
Q3. 
Kth Smallest and Largest Element Problem Statement
You are provided with an array 'Arr' containing 'N' distinct integers and a positive integer 'K'. Your task is to find the Kth smallest and Kth largest e...read more
Ans. 
Find the Kth smallest and largest elements in an array.
• Sort the array to easily find the Kth smallest and largest elements.

• Ensure K is within the array's size to avoid errors.

• Handle multiple test cases efficiently.

• Consider edge cases like when N is small or K is at the extremes.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This was the Hiring Manager Round. What is a Primary Key? What is a Cross-Join? What is the difference between Clustered and Non-clustered index?

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted N * N matrix, find the position of a target integer 'X'.
• Iterate over rows and columns to search for the target integer 'X'.

• Utilize the sorted nature of the matrix to optimize the search process.

• Return the position of 'X' if found, else return '-1 -1'.
Answered by AI
Add your answer