Available question text
Given an array of lowercase strings and a target prefix, return how many strings start with that prefix — a straightforward count of strings whose leading substring equals pref (n, string lengths ≤100).
Related questions
Continue with questions that share topics or the same question type.
- The "Alien Dictionary" problem is a classic LeetCode question (specifically LeetCode Problem 269) that requires determining the alphabetical order of characters in a new language given a list of words sorted according to that language's rules. This is typically solved using graph theory and topological sorting (Kahn's algorithm or DFS).
Coding
- The first was leetcode Set Matrix Zeroes.
The LeetCode problem Set Matrix Zeroes is a classic 2D array manipulation problem. The description is as follows:
You are given an
𝑚
×
𝑛
m×n matrix of integers. If any element is 0, you must set its entire row and column to 0. In other words, for each cell that contains 0, all cells in the same row and column should be changed to 0.
Coding
- A question around around array and number and SQL about counting employee salary and showing them in descending order
Coding
- All People Report to the Given Manager
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2185. Counting Words With a Given Prefix
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source