Search & Filtering
20. Given that a man can jump X meters and after every jump, he comes back 1 meter as it is a slope model and given N poles to cross. Then print how many jumps are needed.
Input1 = number of meters pirate can climb
Input2 = number of meters pirate will slide down
Input3 = total number of walls
Input4[] = array of length input3 containing height of walls
Print the total number of jumps required to cross the wall?
20) Given that a man can jump X meters and after every jump, he comes back 1 meter as it is a slope model and given N poles to cross. Then print how many jumps are needed.
19. A thief trying to escape from jail. He has to cross N walls each with varying heights (every height is greater than 0). He climbs X feet every time. But, due to the slippery nature of those walls, every time he slips back by Y feet. Now the task is to calculate the total number of jumps required to cross all walls and escape from the jail.
18. Write a code to find the smallest divisible number of a given number(here number is input).
17. Write a code for returning a character at the specified index.
How to reverse a string using the OOPS concept in python.
15. Write a program to find the count of non-repeating characters.
14. For the given number ‘n’ (0 <n<= 100), little johnny wants to find out the minimum positive integer X divisible by ‘n’, where the sum of digits of X is equal to ‘n’ and X is not equal to 'n'.
Note: If such an 'X number does not exist, then the output should be - 1.
For the given number ‘n’ (0 <n<= 100), little johnny wants to find out the minimum positive integer X divisible by ‘n’, where the sum of digits of X is equal to ‘n’ and X is not equal to 'n'.
Note: If such an 'X number does not exist, then the output should be - 1.
Find the output based on input, the sum of digits of output is equal to input and divisible by input.- Link
