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 SumJump numbers
LEVEL:Beginner
Description
Given an integer X. You have to find all the jumping numbers less than X (Jumping number is a number that should have a difference 1 in adjacent digits of a number).
Input Format
First line contains the size of the first array. Next line contains the m integers separated by the spaces.
Output Format
Print all jumping numbers
20
1 2 3 4 5 6 7 8 9 10 12
30
1 2 3 4 5 6 7 8 9 10 12 21 23
40
1 2 3 4 5 6 7 8 9 10 12 21 23 32 34
Login to see Discussion
Approach
Approach1: Brute Force
Step-i) Implement a function called isJumping.
Step-ii) Check whether the difference between adjacent digits is equal to one or not.
Step-iii) Iterate a loop from 1 to a.
Step-iv) Check for every i is jumping or not.
Step-v) If it’s jumping add into the list, else leave.
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