All company sheets
Wissen Technology DSA interview questions
32 problems to practise before your Wissen Technology online test or coding round. Most widely asked first.
32
Questions
9
Easy
23
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.
32 questions
- 1
Find Number of Ways to Climb Stairs
EasyRecursionTagged at 7 companies - 2
Compute and Return the Square Root of x
EasyBinary SearchTagged at 7 companies - 3
Guess Number Higher or Lower (API Game)
EasyBinary SearchTagged at 7 companies - 4
Fraud Detection Repeat IP Logins
EasySliding WindowTagged at 7 companies - 5
Database Index Deduplication
EasyTwo PointersTagged at 7 companies - 6
Merge Intervals
MediumArrayTagged at 7 companies - 7
3Sum Closest
MediumArrayTagged at 7 companies - 8
Find K Closest Elements
MediumArrayTagged at 7 companies - 9
Search a 2D Matrix
MediumArrayTagged at 7 companies - 10
Generate All Valid Parentheses Combinations
MediumRecursionTagged at 7 companies - 11
Find Number of Unique Paths in a Grid
MediumRecursionTagged at 7 companies - 12
Implement Merge Sort Algorithm Recursively
MediumRecursionTagged at 7 companies - 13
Find Kth Largest Element in an Array
MediumRecursionTagged at 7 companies - 14
Find Number of Ways to Decode a String
MediumRecursionTagged at 7 companies - 15
Koko Eating Bananas at Minimum Speed
MediumBinary SearchTagged at 7 companies - 16
Find the Gas Station (Circular Route)
MediumArrayTagged at 7 companies - 17
SaaS Support Satisfaction Optimizer
MediumSliding WindowTagged at 7 companies - 18
Invert Binary Tree
EasyTreeTagged at 6 companies - 19
Convert Binary Number in a Linked List to Integer
EasyLinkedListTagged at 6 companies - 20
Find the Sum of Last N Nodes of a Linked List
EasyLinkedListTagged at 6 companies - 21
Check if Two N-ary Trees are Identical
EasyTreeTagged at 6 companies - 22
Find the Winner of the Circular Game (Josephus Problem)
MediumStack and QueueTagged at 6 companies - 23
Reveal Cards In Increasing Order Using Queue Simulation
MediumStack and QueueTagged at 6 companies - 24
Find Shortest Path in Binary Matrix Using BFS
MediumStack and QueueTagged at 6 companies - 25
Design and Implement an LRU (Least Recently Used) Cache
MediumLinkedListTagged at 6 companies - 26
Delete the Middle Node of a Linked List
MediumLinkedListTagged at 6 companies - 27
Find K Closest Points to the Origin (0, 0)
MediumTreeTagged at 6 companies - 28
Count All Nodes in a Complete Binary Tree (O(log n * log n))
MediumTreeTagged at 6 companies - 29
Find Longest Repeating Character Replacement
MediumStringTagged at 6 companies - 30
Implement a String Decoding Function (e.g., 3[a2[c]])
MediumStringTagged at 6 companies - 31
Remove All Adjacent Duplicates in a String II (K Duplicates)
MediumStringTagged at 6 companies - 32
Find the Longest Substring with At Most Two Distinct Characters
MediumStringTagged at 6 companies