Ubuy Technologies Manual Testing Interview Questions, Process, and Tips for Freshers

Q1. Give your Introduction
Add your answer
Q2. What is your salary expectations
Add your answer

Easy math questions. averages, series, etc

Q1. Basic Oops questions C++
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

Aptitude test

Code test

Q1. About oops or an any language
Add your answer
Q2. Coding for any language
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening.

Q1. Count diagonal paths
You are given a binary tree. Your task is to return the count of the diagonal paths to the leaf of the given binary tree such that all the values of the nodes on the diagonal are equal...read more
Ans. Count diagonal paths from a node to a leaf consisting of the same valued nodes
The main idea here is to traverse the tree diagonally using a Map/Dictionary. 
The algorithm will be-
1. Traverse the given binary tree in a diagonal order and store the starting node of each diagonal as the key and for each key, store all the values in that diagonal in a dictionary
2. To traverse the given binary tree in a diagonal order the mai...read more
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the night.

Q1. Count Subsequences
You have been given an integer array/list 'ARR' of size 'N'. Your task is to return the total number of those subsequences of the array in which all the elements are equa...read more
Ans. Brute Force
The idea is to generate all the subsequences and check whether the elements present are equal or not.
 
Here is the algorithm :
 
1. Generate all the subsequences of the given array.
2. Maintain a variable ‘COUNT’ which stores the total number of subsequences in which all the elements are equal.
3. Iterate over each of the generated subsequences.
   1. In case all the elements of the current subsequence are equal, we in...read more
Answered by CodingNinjas
View 1 more answer