Interview DigestInterview Digest

OA Practice Workspace

Technical2026-10-18

Solve the Car Fleet problem and an unspecified dynamic programming problem.

AI-Expanded — inferred from the question title, not from the original candidate report

Given a set of cars traveling toward a destination on a single-lane road, each with a specific position and speed, determine the number of distinct car fleets that will arrive at the destination, where a fleet is defined as a group of cars that catch up to a lead car and are forced to travel at its slower speed. After solving this, implement a solution to the "Longest Increasing Subsequence" problem to find the length of the longest subsequence of a given integer array such that all elements of the subsequence are sorted in strictly increasing order.

Context & Summary

The first round focused on data structures and algorithms.

💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.