Sprinklr Interviews

Given the arrival and departure times of all trains that arrive at a railway station, determine the minimum number of platforms required for the railway station so that no train waits.

Given an undirected tree of n nodes labeled from 1 to n, and an integer t, a frog starts at node 1. For each second, the frog moves from its current node to a randomly chosen adjacent node. If the frog reaches a leaf node, it stays there. What is the probability that the frog is on a target node target after exactly t seconds?

Design a system to efficiently track and display the live user count for a streaming platform similar to Hotstar.

Design a web crawler that crawls URLs and outputs URLs which return errors. The expectation included providing working code. Further discussions covered parallelizing this crawler, ensuring observability, and handling various failure scenarios.

Given a tree and a frog starting at node 1, find the probability that the frog is on a target node after 't' seconds. The frog jumps to an unvisited adjacent node, or stays if no unvisited nodes or if it's already on the target node.

Design a system to accurately track and display the live user count for a streaming platform similar to Hotstar. Considerations include scalability, real-time updates, and handling a large number of concurrent users.

Design a web crawler system that takes a set of seed URLs, crawls them, follows links, and identifies all URLs that return an error (e.g., 4xx or 5xx HTTP status codes). Discuss concurrency, error handling, and basic architecture.

You are given two strings s and t, both of the same length. You can transform string s into string t by mapping each character in s to only one character in t. However, this mapping must be consistent: Each character in s must map to exactly one character in t. Two different characters in s cannot map to the same character in t. Your task is to determine whether such a transformation is possible.

You are given: A list of digits (from '1' to '9', inclusive), where each digit can be used only once. A list of arithmetic operators consisting of '+' and '-'. Your task is to place all operators between digits (or groups of digits) to form a valid arithmetic expression such that: Each operator is used exactly once and placed between two numbers. All digits must be used exactly once (no repetition). You may combine adjacent digits to form multi-digit numbers (e.g., '1' and '5' can form '15' or '51'). You must find and return the maximum and minimum possible values of the resulting expressions.

You are given a task to generate all possible attendance records for a student over n days. Each day's record can be one of the following: 'P' — Present 'L' — Late 'A' — Absent However, the record must follow these two rules: At most one 'A' (Absent) is allowed in the entire record. No three consecutive 'L' (Late) entries are allowed. Your task is to count the total number of possible valid attendance strings of length n that follow these rules. n <= 10^5

I was asked a DSA question similar to LeetCode's Task Scheduler problem.

The interviewer asked about my past projects, specifically inquiring which database we use and why. They then posed a hypothetical question about what database Twitter might use and the reasoning behind it.

I was asked about strategies for handling increased data loads. When I suggested sharding, the interviewer asked what parameter I would use to shard and how I would handle querying by user.

The interviewer asked if I had any experience using message brokers.

Questions related to load balancers, covering various concepts and applications.

|y
|
|
|	P1-------P2	P3 ------------- 3
|	|	|
|	P4------P5	P6…………………2
|
|	P7	P8	P9…………………1
|
|
|____|_____|_____|____________x
0	1	2	3

Given a data-structure called Point with two integers (positive) carrying X and Y coordinate for the point.

Class Point {
int x;
int y;
Point(int x, int y) {
	this.x = x;
	this.y = y;
}

}

And an array of 9 such points arranged as depicted (horizontally and vertically aligned as shown),

List<Point> points = new ArrayList<>();
points.add(new Point(1,3)); // P1
points.add(new Point(2,3)); // P2
....
....
points.add(new Point(3,1)); // P9

Find the total number of rectangles that can be drawn by joining the given points. E.g. joining P1, P2, P5, P4 creates a rectangle (highlighted in the figure above).

Find a unique element present once in a given array where every other element is present twice.

Imagine you are reading in a stream of integers. Periodically, you wish to be able to look up the rank of a number x (the number of values less than or equal to x). Implement the data structures and algorithms to support these operations. That is, implement the method track(int x), which is called when each number is generated, and the method getRankOfNumber(int x), which returns the number of values less than or equal to x (not including x itself).

EXAMPLE:
1, 4, 4, 5, 9, 7, 13, 3
      getRankOfNumber(1) - 0,
      getRankOfNumber(3) - 1,
      getRankOfNumber(4) - 3,

Given that integers are read from a data stream. Find median of elements read so for in efficient way. For simplicity assume there are no duplicates. For example, let us consider the stream 5, 15, 1, 3 …