Transhill Management Services Interview Questions and Answers

Given a sorted N * N matrix, find the position of a target integer X.

• Iterate over each row and column to search for the target integer

• Utilize the sorted nature of the matrix to optimize the search process

• Return the position of the target integer if found, else return -1 -1

Sort an array of strings based on a new alphabetical order starting with a given character.

• Iterate through the array of strings and compare each string with the given character to determine the new order.

• Implement a custom comparator function to sort the strings based on the new alphabetical order.

• Use built-in sorting functions in programming languages like Python, Java, or C++ to efficiently sort the array.

Euler's Totient Function calculates count of integers coprime to N between 1 and N.

• Implement Euler's Totient Function to calculate count of coprime integers to N.

• Use the formula: phi(N) = N * (1 - 1/p1) * (1 - 1/p2) * ... * (1 - 1/pk) where p1, p2, ..., pk are prime factors of N.

• Example: For N = 9, phi(9) = 9 * (1 - 1/3) = 6.

The pillars of OOP are Inheritance, Encapsulation, Abstraction, and Polymorphism.

• Inheritance allows a class to inherit properties and behavior from another class.

• Encapsulation restricts access to certain components of an object, protecting its integrity.

• Abstraction hides complex implementation details and only shows the necessary features.

• Polymorphism allows objects to be treated as instances of their parent class, enabling flexibility.

Print the Fibonacci series using code.

• Use a loop to generate the Fibonacci series

• Start with the first two numbers (0 and 1) and then add the previous two numbers to get the next number

• Continue this process until reaching the desired length of the series

An Anagram program compares two strings to see if they are rearrangements of each other.

• Create a function that takes in two strings as input

• Remove any spaces and convert both strings to lowercase for accurate comparison

• Sort the characters in both strings and compare them to check if they are anagrams

• Return true if they are anagrams, false otherwise