omnissa logo
Omnissa· Software Backend Engineer - Java

Interview at Omnissa - Software Backend Engineer - Java

Experience
2.5 years
Posted
30 Jun 2026
76 reads

Summary

I interviewed for a Software Backend Engineer role at Omnissa, solved two coding problems but struggled with a graph question and was not selected.

How it went

My Current exp: 2.5years

Round 1: Coding Round

The interviewer first asked me a graph problem, which I was unable to solve. After struggling with it for a while, I requested to move on to the next question. At that point, I felt that I might have already been rejected.

Since there was still time left, the interviewer asked me to rotate the array from right to left k times, which I solved successfully. After that, I was given a string problem: finding the length of the longest substring without repeating characters. I was able to solve that as well.

However, I believe that my inability to solve the first graph question was the main reason I was not selected.

Thanks!

Questions asked (2)

  1. 01

    Rotate array k positions to the left

    Data Structures & Algorithms · Easy

    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].

  2. 02

    Length of longest substring without repeating characters

    Data Structures & Algorithms · Medium

    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.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Omnissa recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!