One DSA question:

First Question was on Sliding Window: ThoughtSpot serves many customer tenants from the same service. You want to stop any single tenant from flooding it. Design a class RateLimiter that allows each tenant at most N requests in any W-second sliding window. Implement:

• RateLimiter(int N, int W): initializes the limiter. N and W are fixed at construction and are the same for every tenant.
• boolean allow(String tenantId, long timestampMillis): returns true if the request is permitted, in which case it counts against the tenant's quota. Returns false if it should be rejected. Rejected requests don't count. You may assume timestamps arrive in non-decreasing order.

Apart from this conceptual questions on Data Structures like Map, Sets their properties were asked

2 questions with multiple variants and discussion on each:

1. Course Schedule — Topological Sort / Cycle Detection Problem:
There are n courses labeled from 0 to n - 1. You are given an array prerequisites where prerequisites[i] = [aᵢ, bᵢ] indicates that you must take course bᵢ before taking course aᵢ. Return true if you can finish all courses. Otherwise, return false. Constraints:

• 1 <= n <= 10⁵
• 0 <= prerequisites.length <= 5 × 10⁴
• 0 <= aᵢ, bᵢ < n
• All prerequisite pairs are unique. Example 1: Input: n = 2 prerequisites = [[1,0]]

Output: true Example 2: Input: n = 2 prerequisites = [[1,0],[0,1]]