Given a string str representing a number, the task is to find whether the number is valid or not if it made topsy-turvy i.e upside-down.
Input: str = “1183”
upside-down(1183) = 1183
Input: str = “983”
Approach: Only the digits 1, 3 and 8 are the digits that can form another valid digit when turned upside-down. If the number contains a digit other than these then print No else print Yes.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Check if a number is prime in Flipped Upside Down, Mirror Flipped and Mirror Flipped Upside Down
- Count number of bits to be flipped to convert A to B | Set-2
- Maximum number of 0s that can be flipped such that Array has no adjacent 1s
- Minimum cells to be flipped to get a 2*2 submatrix with equal elements
- Count of total bits toggled/flipped in binary representation of 0 to N
- Check whether Bishop can take down Pawn or not
- Program to check if a date is valid or not
- Check whether right angled triangle is valid or not for large sides
- Check if the given Prufer sequence is valid or not
- Check whether the triangle is valid or not if angles are given
- Check whether Quadrilateral is valid or not if angles are given
- Check whether triangle is valid or not if three points are given
- Check if the given Binary Expressions are valid
- Find the number of valid parentheses expressions of given length
- Number of valid indices in the permutation of first N natural numbers
- Count valid pairs in the array satisfying given conditions
- Arrange numbers to form a valid sequence
- Maximum value of expression (arr[i] + arr[j] * arr[k]) formed from a valid Triplet
- How to check if a given number is Fibonacci number?
- Check if a number is a power of another number
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.