Oracle

Round 1:

1. Array Optimization Problem
   • Given an integer array 'arr' of length 'n', maximize (arr[i] - arr[j]) * arr[k], such that i < j < k.
   • Example:
plaintext
arr = [2, 3, 1, 5, 2, 4, 1]
   • ans = 12 [(i=3, j=4, k=5) → (5 - 2) * 4]
   • 



2. House Robber Problem with Skip Constraint
   • Each house in the society is represented as an array [money_i, skip_i], meaning house i contains money_i and if robbed, the robber must skip skip_i houses ahead.
   • Example:
plaintext
houses = [[3,1], [1,4], [5,1], [6,3]]
   • ans = 9 (rob 0th and 3rd house)




Round 2:

1. Find the length of the longest substring without repeating characters.
2. A problem related to suffix-prefix computation.

Round 3:

1. Find the GCD of two numbers (2 different approach discussed).
2. Print numbers between 1 to 100 that are divisible by 9.
3. A puzzle involving two strings of different lengths and different materials.
4. N-Queen Problem (puzzle + code).
5. 25 Horses Race Puzzle.

Round 4:

• Current Project: In-depth technical discussion on my recent work.
• Behavioral Questions: Questions related to teamwork, challenges faced, problem-solving mindset, and adaptability.

Verdict:
✅ Selected for IC3!

Expedia

Round 1:

1. Validate Parentheses - Check if a given string contains valid parentheses.

2. Fruit Into Baskets problem.

Round 2:

1. Generate String with Valid Parentheses - Given a number n, generate all valid combinations of parentheses.

2. Second question I forgot.

Round 3:
Low-Level Design (LLD) - Music Streaming App (Spotify)

Discussed system design aspects, architecture decisions, scalability, caching strategies, and user interactions.

Round 4:

In-Depth Project Discussion - Focus on handling edge cases and "what-if" scenarios in the system.

Behavioral Questions:

1. How do you handle conflicts with teammates?
2. Why are you leaving your current organization?
3. What will be your reaction if you don’t get promoted to SDE3?

Verdict:
✅ Selected!