Onmood9 Interview Questions and Answers

Find the magic index in a sorted array where A[i] = i.

• Iterate through the array and check if A[i] = i for each index i.

• Since the array is sorted, you can optimize the search using binary search.

• Return the index if found, else return -1.

The task is to identify all distinct triplets within an array that sum up to a specified number.

• Iterate through the array and use nested loops to find all possible triplets.

• Check if the sum of the triplet equals the specified number.

• Print the valid triplets or return -1 if no such triplet exists.

Given an array of strings, find the lexicographically smallest string that can be used as a prefix to minimize the total cost of deleting prefixes from the strings.

• Iterate through the array to find the common prefix among all strings

• Choose the lexicographically smallest common prefix

• Delete the common prefix from each string in the array to minimize the total cost

Given a sorted alien dictionary in an array of strings, determine the character order of the alien language.

• Iterate through the words in the dictionary to build a graph of character dependencies.

• Perform a topological sort on the graph to determine the character order.

• Return the character array representing the order of characters in the alien language.

Find all Jumping Numbers smaller than or equal to a given positive integer N.

• Iterate through numbers from 0 to N and check if each number is a Jumping Number.

• For each number, check if the absolute difference between adjacent digits is 1.

• Include all single-digit numbers as Jumping Numbers.

• Output the list of Jumping Numbers that are smaller than or equal to N.