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