SPRINKLR Software Developer Intern Interview Questions, Process, and Tips

Q1. Implement hashmaps
Ans. 
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.
Answered by AI
Add your answer

Q1. House robber leetcode
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

Q1. 
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 indic...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
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 possibl...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 55 minutes
Round difficulty - Medium

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Round duration - 30 minutes
Round difficulty - Medium

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

Round duration - 50 minutes
Round difficulty - Medium

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

Q1. 
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 conq...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
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 possibl...read more
Ans. 
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 root-to-leaf paths.
Answered by AI
Add your answer
Q3. What are the tables involved in the design of online applications like Uber?
Ans. 
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...read more
Answered by AI
Add your answer

Round duration - 55 Minutes
Round difficulty - Medium

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Q1. 
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 ...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.