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

TopicType a topic, then choose one from the suggestions.

8 questions

Showing 1–8

CodingEasyLeetCode 20
Valid Parentheses
Check whether a string of parentheses/brackets is valid by ensuring every closing bracket matches the most recent unmatched opening bracket and the types and nesting…
Companies: Amazon, Apple, Bloomberg, Google +9
Bracket Sequences · Stack · String
Last reported Aug 2026
Open workspace
CodingMediumLeetCode 678
Valid Parenthesis String
Determine whether a string containing '(', ')', and '*' (where '*' can represent '(', ')', or empty) can be assigned so the parentheses are balanced…
Companies: Apple, Microsoft, Oracle
Bracket Sequences · Dynamic Programming · Greedy · Stack
Last reported Jul 2026
Open workspace
CodingMediumLeetCode 22
Generate Parentheses
Given a number n, generate all distinct well-formed parentheses strings formed from n pairs of opening and closing brackets. Return all valid combinations as a…

Companies: Amazon, Bloomberg, Microsoft, Salesforce

Backtracking · Bracket Sequences · Dynamic Programming · String

Last reported Apr 2026

CodingHardLeetCode 32

Longest Valid Parentheses

Find the length of the longest well-formed (balanced) parentheses substring in a string of '(' and ')', handling nested and adjacent valid segments; this typically…

Companies: Amazon, Meta, Microsoft, Uber

Bracket Sequences · Dynamic Programming · Stack · String

Last reported Apr 2026

CodingEasyLeetCode 1614

Maximum Nesting Depth of the Parentheses

Given a valid parentheses string, compute its maximum nesting depth — the largest number of parentheses that are open at the same time. (Equivalent to…

Companies: Meta, Rippling

Bracket Sequences · Stack · String

Last reported Feb 2026

CodingMediumLeetCode 921

Minimum Add to Make Parentheses Valid

Given a string of '(' and ')', return the minimum number of parentheses insertions needed to make the string valid. This is solved greedily by…

Companies: Meta, Microsoft

Bracket Sequences · Greedy · Stack · String

Last reported Dec 2025

CodingMediumLeetCode 1541

Minimum Insertions to Balance a Parentheses String

Given a string of '(' and ')', return the minimum number of insertions needed to make it balanced under the rule that each '(' must…

Companies: Bloomberg, Meta

Bracket Sequences · Greedy · Stack · String

Last reported Mar 2025

CodingMediumLeetCode 1111

Maximum Nesting Depth of Two Valid Parentheses Strings

Given a valid parentheses string, assign each character to one of two disjoint valid-parentheses subsequences A and B (output 0/1 per index) so that the…

Companies: Microsoft

Bracket Sequences · Stack · String