InterviewDigestTechnical2026-08-16
Count subsequence of length three in a given string
AI-Expanded — inferred from the question title, not from the original candidate report
Given a string consisting of lowercase English letters, count the total number of distinct subsequences of length three that follow a specific pattern, such as "abc". A subsequence is defined as a sequence that can be derived from another sequence by deleting zero or more elements without changing the order of the remaining characters.
Context & Summary
Online Round with MCQs and coding questions
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Loading editor...
AI can automatically infer and generate example test cases for this question based on standard algorithmic constraints.