Skip to content

Explore

Questions Companies Concepts Guides Sign in

How it works Questions Companies Concepts Guides Pricing Sample scorecard

Interview questions

Find a company or topic. Read the sources, then practice.

Coding study plans Companies Design mock

Loading the question library…

Practice system design interviews out loud with an AI interviewer, a shared whiteboard and a scorecard for your level.

How it works Questions Concepts Questions by company Comparisons Technologies Guides Cheat sheet Sample scorecard FAQ Use it as an app Sign in Pricing About and how we write Terms and guidelines Privacy Policy Contact

© 2026 SysRound. SysRound is an AI practice tool. The AI interviewer and the AI feedback can be wrong. Use it for your own practice, not to hire people.

Interview questions by company and topic | SysRound

Search questions

CompanyType a name, then choose a company from the suggestions.

Question type

Difficulty

Format

TopicType a topic, then choose one from the suggestions.

4,878 questions

Showing 1,876–1,900

CodingDifficulty not specifiedLeetCode 1995
Count Special Quadruplets
Count the number of index-ordered quadruplets (a < b < c < d) in an array such that nums[a] + nums[b] + nums[c] == nums[d]…
General practice
Open workspace
CodingDifficulty not specifiedLeetCode 3404
Count Special Subsequences
Count the number of length-4 subsequences (p<q<r<s) with q-p, r-q, s-r >= 2 such that nums[p]*nums[r] == nums[q]*nums[s]. The core challenge is efficiently counting equal…
General practice
Open workspace
CodingDifficulty not specifiedLeetCode 3583
Count Special Triplets
Count the number of index triplets (i<j<k) where nums[i] and nums[k] both equal 2 * nums[j]; this reduces to, for each j, multiplying the count…
General practice

Page 76 of 196

CodingDifficulty not specifiedLeetCode 1277

Count Square Submatrices with All Ones

Given a binary m×n matrix, count the total number of square submatrices that consist entirely of 1s. This is commonly solved with a dynamic programming…

General practice

CodingDifficulty not specifiedLeetCode 1925

Count Square Sum Triples

Count the number of ordered integer Pythagorean triples (a, b, c) with 1 ≤ a, b, c ≤ n — i.e., how many pairs (a…

General practice

CodingHardLeetCode 3748

Count Stable Subarrays

General practice

CodingDifficulty not specifiedLeetCode 2801

Count Stepping Numbers in Range

Count how many integers in the inclusive range [low, high] (given as decimal strings up to 100 digits) have every pair of adjacent digits differ…

General practice

CodingDifficulty not specifiedLeetCode 2393

Count Strictly Increasing Subarrays

Count the number of contiguous subarrays whose elements are strictly increasing; the core challenge is to identify maximal strictly increasing runs and aggregate how many…

General practice

CodingDifficulty not specifiedLeetCode 580

Count Student Number in Departments

Given Department and Student tables, compute the number of students in each department using joins and aggregation; be sure to include departments with zero students…

General practice

CodingDifficulty not specifiedLeetCode 2962

Count Subarrays Where Max Element Appears at Least K Times

Count the number of contiguous subarrays whose maximum element occurs at least k times; the challenge is to avoid brute force by efficiently using the…

General practice

CodingMediumLeetCode 3835

Count Subarrays With Cost Less Than or Equal to K

General practice

CodingHardLeetCode 4051

Count Subarrays with Distant Sums

Companies: Media.net

Array · Binary Indexed Tree · Binary Search · Prefix Sum

CodingMediumLeetCode 4011

Count Subarrays With Even Odd Ratio I

General practice

CodingHardLeetCode 4013

Count Subarrays With Even Odd Ratio II

General practice

CodingHardLeetCode 3859

Count Subarrays With K Distinct Integers

Companies: Meta

Array · Counting · Hash Table · Sliding Window

CodingMediumLeetCode 4089

Count Subarrays With Loose Bounds

General practice

CodingMediumLeetCode 3737

Count Subarrays With Majority Element I

Companies: Amazon, Bloomberg, Google, Meta +1

Array · Counting · Divide and Conquer · Hash Table

CodingHardLeetCode 3739

Count Subarrays With Majority Element II

Companies: Amazon, Microsoft

Array · Divide and Conquer · Hash Table · Merge Sort

CodingDifficulty not specifiedLeetCode 2488

Count Subarrays With Median K

Count how many contiguous subarrays of a distinct-integer array have median equal to k (median is the middle element, or the left-middle for even lengths)…

General practice

CodingDifficulty not specifiedLeetCode 2031

Count Subarrays With More Ones Than Zeros

Given a binary array, count subarrays where the number of 1s exceeds the number of 0s by mapping 1→1 and 0→-1 so the problem becomes…

General practice

CodingDifficulty not specifiedLeetCode 2302

Count Subarrays With Score Less Than K

Count the number of non-empty contiguous subarrays of a positive-integer array whose score—defined as (sum of elements) × (subarray length)—is strictly less than k. With…

General practice

CodingDifficulty not specifiedLeetCode 1504

Count Submatrices With All Ones

Count the number of submatrices in an m×n binary matrix that consist entirely of 1s. Efficient approaches treat each row as the base of a…

General practice

CodingDifficulty not specifiedLeetCode 3212

Count Submatrices With Equal Frequency of X and Y

Count the number of axis-aligned submatrices in a 2D grid of 'X', 'Y', and '.' that contain at least one 'X' and have an equal…

General practice

CodingDifficulty not specifiedLeetCode 3070

Count Submatrices with Top-Left Element and Sum Less Than k

Count how many submatrices that include the top-left cell (0,0) have sum ≤ k in an m×n matrix of nonnegative integers. Use the non-negativity and…

General practice

CodingDifficulty not specifiedLeetCode 3448

Count Substrings Divisible By Last Digit

Count how many substrings of a digit string represent numbers divisible by their nonzero last digit. Because n ≤ 1e5, the solution must avoid O(n^2)…

General practice