SDE - 1

You are given a string S which represents a number. You have to find the smallest number strictly greater than the given number which contains the same set of digits as of the original number i.e the frequency of each digit from 0 to 9 should be exactly the same as in the original number.

For example:

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'.

Note:

The given string is non-empty.

If the answer does not exist, then return -1.

The given number does not contain any leading zeros.

Given the root node of a Binary Search Tree (BST), you have to return the Kth largest element in the BST.

For Example:

If K is 4 and the tree is depicted by the following image then,

The 4th largest element in the given BST is 1. So the output will be 1.

Follow-up :

 Try to do it in O(1) space without using recursion.

how the services were designed ?

what challenges were faced?

How did I tackle those challenges were asked?
At last some medium-based Core Java and SpringBoot concepts were asked.

Why I want to join the WebEngage?

What motivated me to apply for Webengage?

 What are my future plans?

  he asked me to design a Database Schema for a problem which was like suppose if I want to go to station 2 from station 1 on Date xx/yy/zzzz then return list of trains available on that date.