10+ Baariz Technology Solutions Interview Questions and Answers

Given 'N' ropes of varying lengths, find the minimum cost to connect all ropes into one single rope.

• Sort the lengths of ropes in ascending order.

• Keep connecting the two shortest ropes at each step.

• Update the total cost by adding the lengths of the connected ropes.

• Repeat until all ropes are connected.

• Return the total cost as the minimum cost to connect all ropes.

Determine if a binary string can be sorted in decreasing order by removing non-adjacent characters.

• Check if the count of '1's in the string is equal to the length of the string, in which case it can be sorted in decreasing order.

• If there are multiple '0's between two '1's, they can be removed to sort the string in decreasing order.

• If there are more '0's than '1's, it is not possible to sort the string in decreasing order.

Given N meetings with start and end times, determine the maximum number of meetings that can be organized in a single room without overlap.

• Sort the meetings based on their end times.

• Iterate through the sorted meetings and select the first meeting that does not overlap with the previous one.

• Repeat the process until all meetings are considered.

• Return the selected meetings in the order they are organized.

Implement a function to find any topological sorting of a Directed Acyclic Graph (DAG).

• Use Depth First Search (DFS) to traverse the graph and add vertices to the result in reverse order of finishing times.

• Maintain a visited array to keep track of visited vertices to avoid revisiting them.

• Start DFS from any unvisited vertex and recursively explore its neighbors.

• Once all neighbors are visited, add the current vertex to the result.

• Repeat the process until all vertices are visite...read more

Convert a binary search tree into a Greater Tree by replacing each node's value with the sum of all values greater than or equal to it.

• Traverse the BST in reverse inorder (right, root, left) to visit nodes in descending order.

• Keep track of the running sum of visited nodes and update each node's value with this sum.

• Recursively apply the above steps to all nodes in the BST.

• Example: Input - 4 1 6 0 2 5 7 -1 -1 -1 3 -1 -1 -1 -1, Output - 20 24 21 15 26 16 7 -1 -1 -1 3 -1 -1 -1 -1

Maximize memory usage by pairing downloads and games within memory limit 'K'.

• Sort downloads and games in descending order.

• Iterate through downloads and games to find the pair with maximum memory usage.

• Return the indices of the selected download and game pairs.

Implement a function to output the Spiral Order traversal of a binary tree given in level order.

• Traverse the binary tree in a spiral order, alternating between left to right and right to left at each level.

• Use a queue to keep track of nodes at each level and a stack to reverse the order of nodes at odd levels.

• Handle null nodes appropriately to maintain the spiral order traversal.

• Example: Input: 1 2 3 -1 -1 4 5, Output: 1 3 2 4 5

Find the N-th node from the end of a Singly Linked List containing integers.

• Traverse the list to find the length L of the list.

• Calculate the position of the N-th node from the beginning as L - N + 1.

• Traverse the list again to reach the calculated position and return the node's value.

• Handle edge cases like N being equal to 1 or equal to the length of the list.

Given a binary tree, return the bottom view of the tree when viewed from left to right.

• Traverse the tree level by level and keep track of the horizontal distance of each node from the root.

• For each horizontal distance, store the node with the maximum depth in a map.

• After traversing the entire tree, return the values of the map in sorted order of their horizontal distance.

Implement serialization and deserialization methods for a binary tree of integers.

• Use level order traversal for serialization and deserialization.

• Use -1 to represent null nodes in the binary tree.

• Ensure the serialized string can be correctly decoded back to form the original binary tree.

The task is to determine the number of islands in a grid consisting of 0s and 1s.

• Iterate through the grid and perform depth-first search (DFS) to find connected 1s.

• Mark visited 1s as 0 to avoid counting them again.

• Increment the island count each time a new island is found.

• Consider all 8 adjacent cells (horizontally, vertically, diagonally) while performing DFS.

• Handle edge cases like out of bounds and already visited cells.

The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.

• Traverse the binary tree in a level order manner and keep track of the leftmost node at each level.

• Use a queue to perform level order traversal of the binary tree.

• Maintain a count of nodes at each level to identify the leftmost node.

• Return the leftmost nodes at each level as the left view of the binary tree.

Virtual destructors in C++ are used to ensure that the correct destructor is called when deleting an object through a base class pointer.

• Virtual destructors are declared with the 'virtual' keyword in the base class to allow proper cleanup of derived class objects.

• When deleting an object through a base class pointer, having a virtual destructor ensures that the destructor of the derived class is called.

• Without a virtual destructor, only the base class destructor would be calle...read more