How do you validate a parentheses string efficiently? — Citadel interview
Reported in Citadel interview loops. Stack-based DSA question that checks correctness under nested and mixed brackets.
Interview atlas
Explore 105 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered Citadel ×
Reported in Citadel interview loops. Stack-based DSA question that checks correctness under nested and mixed brackets.
Reported in Citadel interview loops. Frequent array optimization question testing dynamic programming intuition.
Reported in Citadel interview loops. Array prefix-suffix pattern often asked in coding rounds.
Reported in Citadel interview loops. Classic linked list pointer question in entry and mid-level interviews.
Reported in Citadel interview loops. Hash set based linear-time approach for sequence detection.
Reported in Citadel interview loops. Heap and selection strategy question with multiple valid approaches.
Reported in Citadel interview loops. Advanced string window question seen in strong coding interviews.
Reported in Citadel interview loops. Graph traversal question using DFS or BFS flood-fill.
Reported in Citadel interview loops. Topological sort and directed cycle detection interview staple.
Reported in Citadel interview loops. Dynamic programming optimization with unbounded choices.
Reported in Citadel interview loops. Simple but important recurrence-based DP interview problem.
Reported in Citadel interview loops. Data structure trade-off question for autocomplete and dictionary lookups.
Reported in Citadel interview loops. Hard interview classic requiring binary search partition logic.
Reported in Citadel interview loops. Disjoint set union structure used in graph connectivity interviews.
Reported in Citadel interview loops. Pattern recognition question for linear-time array scans.