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