Beginner
1. Arithmetic Progression2. Geometric Progression3. Harmonic Progression4. No of triangles 5. Area of Polygon6. Trailing Zeros7. Min Platforms 8. Trapping Rain 9. Jump numbers10. Segregation of 0’s and 1’s11. Two SUM12. Triplet sum 13. Diagonal Sum14. Addition of two matrixes15. Subtraction of two matrixes16. Multiplication of two matrixes17. Transpose of given array18. Spiral Matrix19. Most Frequent Element20. Majority Element 21. Max difference 22. Odd occurring23. Second Largest and Second Smallest24. Next greater number25. Count Unique Elements26. Common elements 27. Removing Duplicates28. Balanced Array29. Rotating Array by k times30. Reverse Array31. Wave Array32. Merge arrays 33. Constraint Sort34. Find element in Sorted rotated array35. Sub Array Sum36. Largest subarray of 0’s and 1’s 37. K-Sub Array38. Max subarray sum39. Contiguous Square SumNext greater number
LEVEL:Beginner
Description
Given an integer. You have to find the next greater number formed by the digits of a given number.
Input Format
First line contains a number N.
Output Format
Print the next greater number
1234
1243
15526
15562
22634
22643
Login to see Discussion
Approach
Approach1: Next Permutation Algorithm
Step-i) Find the longest non-increasing suffix.
Step-ii) To find it, traverse the array until i-1 th element < ith element.
Step-iii) Mark the index as pivot where this condition fails.
Step-iv) If the suffix is the whole array, then there is no higher order permutation for the data.
Step-v) If the marked index is n-1, return doesnt exist.
Step-vi) Find the rightmost successor to the pivot.
Step-vii) Mark the successor index and swap it with our pivot.
Step-viii) Now reverse the suffix and return the answer.
Time Complexity: O(n)
Space Complexity; O(n)
Note :
Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.
Login to see Solution