Aaban Solutions Interview Questions and Answers

Seeking better growth opportunities and challenges

• Limited growth potential in current role

• Desire to work on more challenging projects

• Looking for a company with a better cultural fit

• Relocating to a new area

The question asks to construct a k-ary tree using the given k and DFS traversal string.

• Iterate through the DFS traversal string

• If the current character is 'P', create a parent node

• If the current character is 'L', create a leaf node

• Link the nodes according to the DFS traversal order

To determine if a graph has a node with n degree, iterate through all nodes and count their edges.

• Iterate through each node in the graph

• Count the number of edges connected to each node

• If any node has n edges, then the graph has a node with n degree

A string palindrome is a sequence that reads the same backward as forward, like 'racecar' or 'level'.

• A palindrome can be checked by comparing characters from both ends towards the center.

• Example: 'madam' is a palindrome because 'm' == 'm', 'a' == 'a'.

• Ignoring spaces and punctuation: 'A man, a plan, a canal, Panama!' is a palindrome.

• Case sensitivity can be ignored: 'No 'x' in Nixon' is a palindrome.

Swapping of numbers can be done using call by value, address and reference.

• Call by value: Pass the values of variables as arguments to the function. Swap the values inside the function.

• Call by address: Pass the addresses of variables as arguments to the function. Swap the values using pointers inside the function.

• Call by reference: Pass the references of variables as arguments to the function. Swap the values using ref...read more

Reverse a given string

• Use a loop to iterate through the string and append each character to a new string in reverse order

• Alternatively, use built-in string functions like reverse() or slice()

• Remember to handle edge cases like empty strings or strings with only one character

A multi-threading program to print 1 2 1 2 using 2 threads.

• Create two threads and pass a flag to each thread to print either 1 or 2.

• Use a synchronization mechanism like mutex or semaphore to ensure alternate printing.

• Join the threads to wait for their completion.

Code for binary search algorithm

• Binary search is a divide and conquer algorithm

• It works by repeatedly dividing the search interval in half

• If the value is found, return the index. Else, repeat on the appropriate half

• The array must be sorted beforehand