KPIT Technologies ASE Trainee Interview Questions and Answers

A generic swap function swaps two values of any data type.

• The function should take two parameters of any data type.

• Use a temporary variable to store the value of one parameter.

• Assign the value of the second parameter to the first parameter.

• Assign the value of the temporary variable to the second parameter.

Search for an element in a rotated sorted linked list.

• Find the pivot point where the list is rotated.

• Divide the list into two sublists based on the pivot point.

• Perform binary search on the appropriate sublist.

• Handle edge cases such as empty list and list with only one element.

Search an element in a rotated sorted array

• Find the pivot point where the array is rotated

• Divide the array into two sub-arrays based on pivot point

• Perform binary search on the appropriate sub-array

• Repeat until element is found or sub-array size is 1

Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.

• Create a boolean array of size 100 and mark the present numbers

• Iterate through the boolean array and find the missing numbers

• Alternatively, use a HashSet to store the present numbers and find the missing ones

Given a Sudoku board, find possible numbers for an empty cell.

• Iterate through empty cells and check possible numbers using row, column, and box constraints.

• Use a set to keep track of possible numbers for each empty cell.

• Return the set of possible numbers for the given empty cell.

Find integer average of 4 unsigned integers without typecasting

• Add all the integers and divide by 4

• Use bit shifting to divide by 4

• Handle overflow by using long long data type

• Use unsigned int data type for input

Code to identify 32 bit or 64 bit architecture of a processor

• Check if the operating system is 32 bit or 64 bit

• If OS is 32 bit, processor is 32 bit

• If OS is 64 bit, check if processor supports 64 bit architecture

• Use CPUID instruction to check if processor supports 64 bit architecture

Convert binary number to base 64 integer

• Divide the binary number into groups of 6 bits

• Convert each group of 6 bits to decimal

• Map the decimal value to the corresponding base 64 character

• Concatenate the base 64 characters to form the final integer

To test if every left child's value is less than the right child's value in a binary tree.

• Traverse the binary tree using any traversal algorithm (e.g., in-order, pre-order, post-order)

• Compare the value of each left child with its right child

• If any left child's value is greater than or equal to its right child's value, return false

• If all left child's values are less than their right child's values, return true

Cloning a linked list-like structure

• Create a new node for each node in the original linked list

• Set the value of the new node to the value of the corresponding node in the original linked list

• Set the next pointer of the new node to the new node corresponding to the next node in the original linked list

• Repeat the above steps until all nodes in the original linked list are cloned

To find the nth character in a stream of bytes, we need to read the stream byte by byte until we reach the nth position.

• Start reading the stream byte by byte until you reach the nth position

• Return the byte at the nth position

• If the stream ends before reaching the nth position, return null or throw an exception

Rearrange a string to avoid consecutive same characters.

• Iterate through the string and keep track of the previous character.

• If the current character is the same as the previous, swap it with the next different character.

• Repeat until no consecutive same characters are left.

The task is to find the next highest palindrome number given a number.

• Convert the given number to a string

• Check if the number is already a palindrome

• If not, increment the number by 1 and check if it is a palindrome

• Repeat the previous step until a palindrome is found

Canonicalizing a directory path involves simplifying and standardizing the path to remove any redundant or unnecessary elements.

• Remove any consecutive slashes and replace them with a single slash

• Remove any trailing slashes

• Resolve any relative paths (e.g., '..' and '.')

• Handle special cases like the root directory ('/')

• Normalize the path by removing any unnecessary elements

App performance analysis involves identifying and resolving bottlenecks to improve user experience.

• Collect and analyze performance metrics such as response time, CPU usage, memory usage, and network latency.

• Identify and prioritize bottlenecks based on impact on user experience and frequency of occurrence.

• Implement optimizations such as caching, code refactoring, and database tuning.

• Continuously monitor and test perform...read more

To find a loop in a directed graph, use Floyd's cycle-finding algorithm. To find the last element in a binary tree, traverse the tree and return the rightmost leaf node.

• For finding a loop in a directed graph, use Floyd's cycle-finding algorithm which uses two pointers moving at different speeds.

• To find the last element in a binary tree, traverse the tree recursively or iteratively and return the rightmost leaf node.

The question is about finding the last number in a circular queue that has the highest number of digits.

• Implement a circular queue data structure

• Iterate through the circular queue to find the last number with the highest number of digits

• Compare the number of digits of each number in the circular queue

• Keep track of the last number with the highest number of digits