Tip 1 : Do Competitive Programming consistently.
Tip 2 : Practice as many questions possible in DSA covering all topics.
Tip 3 : Have atleast a single project of which you have complete knowledge with good hands-on of the technology used in it.
Tip 1 : Have good projects of which you have complete knowledge.
Tip 2 : Showcase your coding skills by adding various Coding profiles like: Codeforces, Codechef, etc.
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.
I have done this question earlier so just use already built algorithm which traverses the number from the back.
Let us say A = [2,4,6,7,6,9], then adjacent elements of sub array [6,7,6] have absolute difference of either 0 or 1 and this is the maximum length sub-array. So the required answer will be 3.
This was a simple array problem. I solved this using question as:
Starting from the first element of the array, find the first valid sub-array and store its length then starting from the next element (the first element that wasn’t included in the first sub-array), find another valid sub-array. Repeat the process until all the valid sub-arrays have been found then print the length of the maximum sub-array.
Tell me about yourself.
Why do you want to join Amdocs?
Tip 1: Google about the company beforehand
Tip 2: Try to communicate better
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which array operation has O(n) worst-case time complexity?