All company sheets
Infosys DSA interview questions
27 problems to practise before your Infosys online test or coding round. Most widely asked first.
27
Questions
7
Easy
20
Medium
0
Hard
Good practice. Problems at the level of this company’s online test and coding round. Treat it as a practice set, not a leak. These are Astra’s own tags, not an official question list.
27 questions
- 1
Meeting Rooms
EasyGreedyTagged at 7 companies - 2
Find the Diameter of a Binary Tree
EasyRecursionTagged at 7 companies - 3
Count Negative Numbers in a Sorted Matrix
EasyBinary SearchTagged at 7 companies - 4
Git Commit History Tracking
EasyTwo PointersTagged at 7 companies - 5
Find All Subsets (Power Set) of a Set
MediumRecursionTagged at 7 companies - 6
Determine if String Can Be Segmented by Word Dictionary
MediumRecursionTagged at 7 companies - 7
Find the Number of Islands in a Grid
MediumRecursionTagged at 7 companies - 8
Maximize Stolen Money from House Robber in a Binary Tree
MediumRecursionTagged at 7 companies - 9
Solve the Aggressive Cows Problem
MediumBinary SearchTagged at 7 companies - 10
Find Minimum Time to Complete All Trips
MediumBinary SearchTagged at 7 companies - 11
Generate All Subsets (The Power Set)
MediumArrayTagged at 7 companies - 12
Generate All Combinations of Size K from N Numbers
MediumArrayTagged at 7 companies - 13
Find the Longest Subarray of 1s After Deleting One Element
MediumArrayTagged at 7 companies - 14
Redis Time-Series Database
MediumBinary SearchTagged at 7 companies - 15
Network Uptime Longest Streak
MediumSliding WindowTagged at 7 companies - 16
Maximum Points You Can Obtain from Cards
MediumSliding WindowTagged at 7 companies - 17
Count Number of Recent Calls in a Ping Counter
EasyStack and QueueTagged at 6 companies - 18
Design a Moving Average from a Data Stream
EasyStack and QueueTagged at 6 companies - 19
Remove All Linked List Elements with a Given Value
EasyLinkedListTagged at 6 companies - 20
Decode String with Repeating Encoded Substrings
MediumStack and QueueTagged at 6 companies - 21
Implement Basic Calculator II with Multiplication and Division
MediumStack and QueueTagged at 6 companies - 22
Find if a 132 Pattern Exists in an Array
MediumStack and QueueTagged at 6 companies - 23
Implement a Trie (Prefix Tree) - Search
MediumTreeTagged at 6 companies - 24
Find the Root of an N-ary Tree (Given All Nodes)
MediumTreeTagged at 6 companies - 25
Find the Longest Common Subsequence (LCS)
MediumStringTagged at 6 companies - 26
Compare Two Version Numbers (String Parsing)
MediumStringTagged at 6 companies - 27
Zoom Meeting Room Provisioning
MediumIntervalsTagged at 6 companies