sprinklr logo
Sprinklr· Product Engineer Intern

Sprinklr | Product Engineer Intern | On Campus | Rejected in 2nd Round

Result
Rejected
Location
Gurgaon, IN
Posted
10 Mar 2024
360 reads

Summary

I interviewed for a Product Engineer Intern position at Sprinklr as an on-campus opportunity. After clearing the first round which included OOPS and basic DSA, I was rejected in the second technical round where I struggled with stream-based data structure problems.

How it went

Round 1:

My first round started with a friendly interviewer who asked general questions based on my resume. Following this, we moved to OOPS basic questions. Then, I was given two DSA questions:

  1. Find a unique element present once in a given array where every other element is present twice.
  2. Another question related to Binary Search, which I don't recall the specifics of.

I was asked to code the first question on Google Docs. The interviewer seemed satisfied with my performance and I proceeded to the next round.

Round 2:

In the second round, the interviewer instantly presented two DSA questions:

  1. Imagine you are reading in a stream of integers. Periodically, you wish to be able to look up the rank of a number x (the number of values less than or equal to x). Implement the data structures and algorithms to support these operations. That is, implement the method track(int x), which is called when each number is generated, and the method getRankOfNumber(int x), which returns the number of values less than or equal to x (not including x itself).

    EXAMPLE:
    1, 4, 4, 5, 9, 7, 13, 3
          getRankOfNumber(1) - 0,
          getRankOfNumber(3) - 1,
          getRankOfNumber(4) - 3,
  2. Given that integers are read from a data stream. Find median of elements read so for in efficient way. For simplicity assume there are no duplicates. For example, let us consider the stream 5, 15, 1, 3 …

I couldn't solve the second question at that time as I was not fully confident in heaps data structure. Consequently, I was REJECTED after this round.

Afaik, all the people who got selected after Round 2 proceeded to an HR round and received an offer.

Questions asked (3)

  1. 01

    Find Unique Element in Array

    Data Structures & Algorithms · Easy

    Find a unique element present once in a given array where every other element is present twice.

  2. 02

    Rank of a Number in a Stream

    Data Structures & Algorithms · Hard

    Imagine you are reading in a stream of integers. Periodically, you wish to be able to look up the rank of a number x (the number of values less than or equal to x). Implement the data structures and algorithms to support these operations. That is, implement the method track(int x), which is called when each number is generated, and the method getRankOfNumber(int x), which returns the number of values less than or equal to x (not including x itself).

    EXAMPLE:
    1, 4, 4, 5, 9, 7, 13, 3
          getRankOfNumber(1) - 0,
          getRankOfNumber(3) - 1,
          getRankOfNumber(4) - 3,

  3. 03

    Median of Data Stream

    Data Structures & Algorithms · Hard

    Given that integers are read from a data stream. Find median of elements read so for in efficient way. For simplicity assume there are no duplicates. For example, let us consider the stream 5, 15, 1, 3 …

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Sprinklr 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!