SPRINKLR
Fomax Information Technologies Interview Questions and Answers
Q1. Maximum Sum Path from Leaf to Root
Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.
Example:
All the possible root t...read more
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.
Q2. Kth Largest Element Problem Statement
Given an integer array and a number 'K', your task is to identify the kth largest element within the array.
Input:
The input starts with an integer 'T', which indicates the...read more
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.
Q3. Merge Sort Linked List Problem Statement
You are given a singly linked list of integers. Your task is to sort the linked list using the merge sort algorithm.
Explanation:
Merge Sort is a divide and conquer algo...read more
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
Q4. Add Two Numbers Represented as Linked Lists
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to the mo...read more
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
Q6. implement hashmaps
Hashmaps are data structures that store key-value pairs for efficient retrieval.
Hashmaps use a hash function to map keys to indices in an array.
Collision resolution techniques like chaining or open addressing are used to handle multiple keys hashing to the same index.
Common operations on hashmaps include insertion, deletion, and lookup of key-value pairs.
More about working at SPRINKLR
Interview Process at Fomax Information Technologies
Top Software Developer Intern Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month