RoundCircle Interview Questions and Answers

1)Balanced Stack 2)Coin change type 3)DSU codeforces question(very hard)

Q1. 1)Remove duplicates in O(1) space complexity 2)create user id
Ans. 
Remove duplicates in O(1) space complexity and create user id from array of strings.
• To remove duplicates in O(1) space complexity, we can use a hash set to keep track of unique elements while iterating through the array.

• To create a user id, we can concatenate the first few characters of each string in the array and add a unique identifier like a timestamp or random number.

• Example: Array of strings ['john.doe', 'jane.do...read more
Answered by AI
Add your answer

Q1. Sort 0,1,2 in single traversal
Ans. 
Use Dutch National Flag algorithm to sort 0, 1, 2 in single traversal
• Initialize three pointers low, mid, high at start, mid, end of array respectively

• Iterate through array and swap elements based on their values and pointers

• Continue until mid crosses high pointer
Answered by AI
Add your answer
Q2. Inorder traversal iterative
Ans. 
Inorder traversal of a binary tree without using recursion.
• Use a stack to simulate the recursive process of inorder traversal

• Start with the root node and keep pushing left child nodes onto the stack until reaching a leaf node

• Pop nodes from the stack, process them, and then move to the right child node if it exists
Answered by AI
Add your answer