24 questions · from 7 interviews
Omnissa interview questions
Every question candidates reported from their Omnissa interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.
Omnissa coding and DSA questions
- 01
Maximum Length of a Square in a Matrix
Given a matrix, find the maximum possible square that satisfies the given conditions. The problem requires determining the size (side length) of the largest square sub‑matrix that meets the specified criteria.
From Omnissa (formerly VMware) Interview Experience | MTS-3 | 6+ YOE | 5 Rounds
- 02
Celebrity Problem
Identify the celebrity in a group of people. A celebrity is defined as someone who is known by everyone else but knows no one. The problem provides a "knows" relationship matrix or function and requires determining if a celebrity exists and, if so, returning…
From Omnissa (formerly VMware) Interview Experience | MTS-3 | 6+ YOE | 5 Rounds
- 03
Maximum Subarray Sum
Given an integer array, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. This classic problem is typically solved using Kadane's algorithm.
From Omnissa (formerly VMware) Interview Experience | MTS-3 | 6+ YOE | 5 Rounds
- 04
Check if a Linked List is a Palindrome
Implement a singly linked list and determine whether the sequence of node values forms a palindrome. The solution involves traversing the list, possibly reversing the second half, and comparing values to verify symmetry.
From Omnissa (formerly VMware) Interview Experience | MTS-3 | 6+ YOE | 5 Rounds
- 05
Maximum Pair Sum Less Than K
Given an array of integers and an integer k, find the maximum sum of any pair of elements such that the sum is less than k.
From Omnissa [Formerly VMWare] - Senior Python Developer Interview Experience - Bengaluru, India
- 06
One Edit Distance String Conversion
Given two strings, determine whether you can convert one string into the other using at most one insertion, deletion, or replacement.
From Omnissa [Formerly VMWare] - Senior Python Developer Interview Experience - Bengaluru, India
- 07
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.
Medium · From Omnissa (formerly VMware) | MTS-2 | Bengaluru | Interview Experience (Multiple Teams)
- 08
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.
Easy · From Omnissa (formerly VMware) | MTS-2 | Bengaluru | Interview Experience (Multiple Teams)
- 09
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.
Medium · From Omnissa (formerly VMware) | MTS-2 | Bengaluru | Interview Experience (Multiple Teams)
- 10
Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters.
Medium · From Omnissa (formerly VMware) | MTS-2 | Bengaluru | Interview Experience (Multiple Teams)
- 11
Rotate array k positions to the left
Given an array of integers and an integer k, rotate the array to the left by k positions. For example, for array [1,2,3,4,5] and k = 2, the result should be [3,4,5,1,2].
Easy · From Interview at Omnissa - Software Backend Engineer - Java
- 12
Length of longest substring without repeating characters
Given a string, find the length of the longest substring that contains no duplicate characters. For example, for the input "abcabcbb", the longest substring without repeating characters is "abc" with length 3.
Medium · From Interview at Omnissa - Software Backend Engineer - Java
- 13
Print Even and Odd Numbers Using Threads
Implement a program that prints even numbers and odd numbers using separate threads. Each thread should be responsible for printing either even or odd numbers from a given range.
- 14
Remove Adjacent Duplicate Characters from String
Given a string, remove all adjacent duplicate characters. For example, given "abbaca", the result should be "ca" after repeatedly removing adjacent duplicates.
- 15
Sum of Digits in a String
Given a string, find the sum of all digit characters present in it.
- 16
Implement Stack using Vector (and Queue)
Implement a stack data structure using a vector. Follow up: Implement a stack using a queue.
- 17
Implement Queue using Stack
Implement a queue data structure using a stack.
- 18
API Response Time Checker
Implement a method that determines if an API is 'fast' or 'slow'. An API is considered fast if its average response time is less than 500ms.
- 19
Balanced Parentheses
Determine if a given string of parentheses is balanced.
Omnissa system design questions
- 01
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.
From Omnissa (formerly VMware) | MTS-2 | Bengaluru | Interview Experience (Multiple Teams)
- 02
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…
From Omnissa (formerly VMware) | MTS-2 | Bengaluru | Interview Experience (Multiple Teams)
- 03
Class Design and Method Implementation (LLD)
Given a class design, implement certain methods based on the design.
Medium · From Omnissa - MTS2/MTS3 2025 Interview
Omnissa behavioural and HR questions
- 01
Why Do You Want to Leave?
I was asked by the manager about my reasons for wanting to leave my current role/company.
Omnissa other questions
- 01
Notification System Design
Design a notification system. The task involves defining classes, interfaces, and relationships to handle creation, delivery, and management of notifications, while ensuring extensibility for future requirements and changes.
From Omnissa (formerly VMware) Interview Experience | MTS-3 | 6+ YOE | 5 Rounds
Omnissa interview questions FAQ
What questions are asked in Omnissa interviews?
Candidates reported 24 distinct questions across 7 Omnissa interviews. 19 coding and DSA questions, 3 system design questions, 1 behavioural and HR questions, 1 other questions.
How difficult are Omnissa interview questions?
Of the questions candidates rated, 29% were easy, 71% medium and 0% hard.