10+ Univlabs Interview Questions and Answers

Generate all possible combinations of balanced parentheses for a given number of pairs.

• Use recursion to generate all possible combinations of balanced parentheses.

• Keep track of the number of open and close parentheses used in each combination.

• Terminate recursion when the number of open and close parentheses used equals the given number of pairs.

The problem involves constructing the longest happy string with given constraints on the frequency of 'a', 'b', and 'c'.

• Iterate through the characters 'a', 'b', 'c' in decreasing order of their frequencies

• Append the character with the highest frequency that does not create a substring of 3 same characters

• Repeat until all characters are used up or the string reaches the desired length

Find all possible paths from a source node to a destination node in a graph with unique nodes.

• Create a graph using the given nodes and edges

• Implement a depth-first search (DFS) algorithm to find all paths from source to destination

• Ensure that the nodes in the paths are unique and print them in lexicographically sorted order

Find the minimum eating speed required for a ninja to consume all chocolates within a given time limit.

• Iterate through possible eating speeds to find the minimum speed that allows the ninja to consume all chocolates within the given time limit.

• Calculate the total number of chocolates to be consumed and divide it by the time limit to get the minimum eating speed.

• Handle cases where a jar has fewer chocolates than the eating speed by consuming all available chocolates from that ...read more

Generate lexicographically largest valid sequence of length 2*N - 1 with specific constraints.

• Start with the largest numbers and place them at the ends to maximize lexicographical order.

• Place the number 1 in the middle to satisfy the condition of appearing exactly once.

• Determine the positions of other numbers based on their distance requirements.

• Iterate through the sequence and fill in the numbers based on the constraints.

• Ensure that each number from 2 to N appears exactly tw...read more

Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

• Use Floyd's Tortoise and Hare algorithm to detect a cycle in O(N) time complexity and O(1) space complexity.

• Start with two pointers, slow and fast, moving at different speeds. If they meet at some point, there is a cycle.

• If the fast pointer reaches the end of the list (null), there is no cycle.

• Example: For input 3 2 0 -4 -1, with pos 1, the linked list forms a cycl...read more

Given a Balanced BST and a target integer, determine if there exists a pair of nodes with sum equal to the target.

• Traverse the BST in-order to get a sorted array of values.

• Use two pointers approach to find the pair with sum equal to target.

• Consider edge cases like negative numbers and duplicates.

• Time complexity should be O(n) and space complexity O(n).

Determine the minimum number of insertions required to empty the board in Zuma game problem.

• Check if it's possible to empty the board by trying all possible combinations of inserting balls from hand.

• Use backtracking algorithm to simulate the game and find the minimum number of insertions required.

• Handle edge cases like when the board cannot be emptied or when the hand is empty.

• Consider optimizing the algorithm by pruning branches that cannot lead to a solution.

• Example: For BO...read more

Early binding is resolved at compile time while late binding is resolved at runtime in C++.

• Early binding is also known as static binding, where the function call is resolved at compile time based on the type of the object.

• Late binding is also known as dynamic binding, where the function call is resolved at runtime based on the actual type of the object.

• Early binding is faster as the function call is directly linked during compilation.

• Late binding allows for polymorphism and i...read more

Virtual functions can be overridden in derived classes, while abstract classes cannot be instantiated directly.

• Virtual functions are declared using the 'virtual' keyword and can be overridden in derived classes.

• Abstract classes cannot be instantiated and may contain one or more pure virtual functions.

• An abstract class can have virtual functions, but a virtual function does not make a class abstract.

• Example: Shape is an abstract class with a pure virtual function 'calculateAre...read more

Design a platform similar to LinkedIn with key features and architecture

• Key Features: user profiles, connections, job postings, messaging, news feed, groups

• Architecture: microservices, cloud storage, scalable database, AI for recommendations

• Security: encryption, secure authentication, data privacy controls

• User Experience: intuitive UI/UX, mobile app support, notifications

• Monetization: premium subscriptions, advertising, job posting fees