Quince OA Experience | 2 Coding Questions

Posted
9 Aug 2026
70 reads

Summary

I completed an online assessment for Quince that included two coding questions, both similar to known LeetCode problems.

How it went

Quince OA Experience | 2 Coding Questions

Yesterday I gave the Quince OA, and there were 2 coding questions.

Q1. Sprinkler / Interval Covering

We were given an array ranges, where the sprinkler at index i covers:

[i - ranges[i], i + ranges[i]]

We had to find the minimum number of sprinklers required to cover the complete range.

This was basically the exact same as:

LeetCode 1326 — Minimum Number of Taps to Open to Water a Garden

Q2. String + K

We were given:

  • str1
  • str2
  • integer k

The problem involved forming/repeating str2 k times as a subsequence of str1, with deletion/subsequence operations involved.

This was essentially:

LeetCode 2014 — Longest Subsequence Repeated K Times

So overall, the OA questions were very close to:

  1. LC 1326 — Minimum Number of Taps to Open to Water a Garden
  2. LC 2014 — Longest Subsequence Repeated K Times

Questions asked (2)

  1. 01

    Minimum Sprinklers to Cover Range

    Data Structures & Algorithms · Medium

    We are given an array ranges where the sprinkler at index i covers the interval [i - ranges[i], i + ranges[i]]. Find the minimum number of sprinklers required to cover the entire range.

  2. 02

    String K Subsequence Repetition

    Data Structures & Algorithms · Hard

    Given strings str1 and str2 and an integer k, determine if str2 repeated k times can be formed as a subsequence of str1 (allowing deletions).

Know someone preparing? Send it to them:WhatsAppLinkedInX

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