Omnissa (formerly VMware) | MTS-2 | Bengaluru | Interview Experience (Multiple Teams)
Summary
I was offered the MTS-2 position at Omnissa in Bengaluru after clearing multiple rounds of DSA, LLD, system design and hiring manager interviews across two different tracks.
Full Experience
Track 1: MTS-2 (.NET & C#)
Online Assessment (HackerRank):
This was a Low-Level Design (LLD) style question. I was provided with an in-memory repository class and had to complete a Service class by utilizing its objects.
- Requirement: Complete the implementation of all methods to pass the test cases.
- Language restriction: Only C# was allowed for this specific OA
- Result: Passed all test cases.
Round 1: DSA & Problem Solving (Eliminatory):
- Problem 1: Coin Change (LeetCode link). I walked the interviewer through the brute force, better, and finally the optimal solution using 1D memoization (Dynamic Programming). They expected working, compilable code in a language of my choice.
- Problem 2: Get the top K elements from a list.
- Follow-up: System Design / Large Scale Data. I was given a file containing a billion records (IP addresses visited on a site, mapped by timestamp) and asked to find the top K most frequent IP addresses. I proposed a divide-and-conquer strategy (similar to External Merge Sort/Chunking), processing frequencies in chunks and merging results.
Round 2: DSA & Problem Solving:
- Problem: Two problems fundamentally similar to Course Schedule, framed as "Method chaining in Visual Studio". I recognized graph dependencies and used Topological Sort.
Round 3: Hiring Manager (HM) Round:
- Deep Dive: Discussed my backend development work.
- Architecture: Drew the High-Level Design of my team's architecture and explained microservices and APIs.
- Behavioral: Standard cultural fit questions.
Track 2: MTS-2 (Java)
Round 1: DSA & Problem Solving: Rapid‑fire round solving three problems with brute‑better‑optimal approaches and working code:
- Rotate an array to the right by k steps (LeetCode link).
- Course Schedule II (LeetCode link).
- Longest Substring Without Repeating Characters (LeetCode link).
Round 2: LLD & Database Design (Face‑to‑Face):
- Problem: Draw the LLD for an E‑commerce Platform using only databases (no standard OO diagram).
- Requirements: Define API endpoints, handle complex queries, implement pagination.
- Deep Dive: Discussed concurrency handling for two users buying the last item, covering optimistic and pessimistic locking and wrote specific methods for concurrent transactions.
Round 3: Hiring Manager (HM) Round (Face‑to‑Face):
- Deep Dive: Heavy discussion on my resume and past backend projects.
- Architecture: Designed the High‑Level Design of Skyscanner (scope was massive, I fumbled a bit).
- Feedback: Despite strong technical feedback, the HM seemed hesitant due to my non‑circuital engineering background, but the overall process concluded positively.
Key Takeaways:
- Omnissa heavily values core foundational concepts. Be prepared to transition smoothly from LeetCode‑style graph problems to practical DB concurrency issues.
- Always structure technical answers: Brute Force -> Better -> Optimal.
Interview Questions (6)
Coin Change
Given a list of coin denominations and a total amount, determine the minimum number of coins needed to make up that amount. If it is not possible, return -1.
Top K Frequent IP Addresses (Large Scale Data)
Given a file containing a billion records of IP addresses with timestamps, find the top K most frequent IP addresses.
Rotate Array
Given an integer array nums and an integer k, rotate the array to the right by k steps, where k is non‑negative.
Course Schedule II
Given the number of courses and a list of prerequisite pairs, return a possible order to finish all courses. If it is impossible, return an empty array.
Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters.
E‑commerce Platform LLD (Database‑Centric)
Design the low‑level architecture for an e‑commerce platform using only databases. Define API endpoints, handle complex queries, implement pagination, and discuss concurrency handling for scenarios such as two users attempting to purchase the last item in stock.