Fomax Information Technologies Interview Questions and Answers

Find the path from a leaf node to the root node with the maximum sum in a binary tree.

• Traverse the binary tree from leaf to root while keeping track of the sum of each path.

• Compare the sums of all paths and return the path with the maximum sum.

• Use recursion to traverse the tree efficiently.

• Handle cases where the node values can be negative.

• Ensure to consider only one path with the maximum sum.

Find the kth largest element in an integer array.

• Sort the array in descending order to easily find the kth largest element.

• Keep track of the kth largest element while sorting the array.

• Return the kth largest element once the array is sorted.

Implement merge sort algorithm to sort a singly linked list of integers.

• Divide the linked list into two halves using slow and fast pointer technique.

• Recursively sort the two halves.

• Merge the sorted halves using a merge function.

• Handle base cases like empty list or single node list.

• Ensure the termination of the linked list with -1 at the end.

• Example: Input: 3 1 2 -1, Output: 1 2 3 -1

Add two numbers represented as linked lists in reverse order and return the sum as a linked list.

• Traverse both linked lists simultaneously while adding corresponding digits and carry.

• Handle cases where one list is longer than the other.

• Create a new linked list to store the sum digits in reverse order.

• Remember to handle carry for the last digit sum.

Tables involved in the design of online applications like Uber include users, drivers, trips, payments, and ratings.

• Users table to store information about customers using the app

• Drivers table to store information about drivers registered on the platform

• Trips table to track details of each trip including start/end locations, distance, and fare

• Payments table to record payment transactions between users and drivers

• Ratings table to store feedback and ratings given by users for dr...read more