Round 1:
- Place all numeric characters in string before alphabet characters .
- Using min swaps and O(1) space and Maintain the order of characters.
Round 2:
- Median of stream of integers.
- Discuss algo.
- Shortest common supersequence of 2 strings.
- Discuss recursive Time complexity and write code for best approach decided.
Round 3:
- Merge 2 sorted linked lists
- Sort large file using small memory.
- Kadane algorithm
Round 4:
- Discuss logging framework
- Discuss event dispatcher
- 2 stacks in one array
- 1 stack and 1 queue in one array
- 2 queue in one array
- Garbage collector in Java.
Round 4:
- Discuss projects.
- Design a n reader writer class.
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!