The round was primarily focused on Problem Solving and Data Structures.The interviewers were helpful and encouraged me to think out loud, focusing on both the logic and time complexity.

Interview date: 13th may 2026

📝 The Problems:1. Frequency of an element in a Sorted ArrayProblem: Given a sorted array, count the occurrences of a target element k.
Example: arr = [3, 5, 5, 5, 6, 9, 10], k = 5
→ Output: 3

My Approach: While a linear search works in $O(n)$, the "sorted" property is a hint to use Binary Search. I implemented two binary searches to find the first and last occurrence of k, resulting in an optimized $O(\log n)$

solution.2. Minimum Jumps to Reach the EndProblem: You are given an array where each element represents the maximum jump length from that position.
Find the minimum number of jumps to reach the end.
Example: jump = [2, 1, 1, 3, 4]
→ Output: 3
My Approach: This is a classic Greedy/DP problem (similar to Jump Game II). I used a Greedy BFS-like approach to track the farthest reachable point at each step, ensuring the solution runs in $O(n)$ time complexity.