Tip 1 : Practice questions on leetcode
Tip 2 : Understand the best solutions in depth and algorithm used
Tip 3 : Ask clarifying questions to the interviewer and break the problem to smaller sub parts
Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand
It was conducted on the cubes platform. We were given 2 coding questions to solve in 90 minutes.
I solved both the problems within 25 min and checked for different test cases manually for more than 15 mins. There were only two test cases were visible and the rest are hidden. Even After submission, they didn’t show us whether all test cases pass not. So, before submission doesn’t forget to check for corner cases manually. One needs to pass all test cases as low as time possible.



If the given string is 56789, then the next greater number is 56798. Note that although 56790 is also greater than the given number it contains 1 '0' which is not in the original number and also it does not contain the digit '8'.
The given string is non-empty.
If the answer does not exist, then return -1.
The given number does not contain any leading zeros.



1. Roots of both the given trees are same.
2. Left subtree of the root of the first tree is the mirror of the right subtree of the root of the second tree.
3. Right subtree of the root of the first tree is the mirror of the left subtree of the root of the second tree.
For example,both the given trees are mirror image of each other:

We had to schedule the same google to meet link for 90 days and shared the link with Samsung.
Introduce yourself.
The data structures you know.
Tell about PreOrder, InOrder, PostOrder traversal of a tree.
How will you implement a queue using an array (Circular Queue Concept).
Tell about BFS, DFS.
Basic OOPs.
They didn’t ask me any coding questions in this round but other candidates were drilled by the coding questions.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?