Print 1 to N – Digits Count [ZOHO]
A positive integer N is passed as the input. If we print all the numbers from 1 to N continuosly, the program must find the number of…
Count of Even Digits in Odd Positions
The program must accept an integer N as the input. The task is to count and print the number of even digits in N that are present in odd…
Count of Groups with Same Consecutive Digits
The program must accept an integer N as the input. The program must count the number of groups in the number where the same digit appears…
Count of Digits Inverted in Their Position
The program must accept an integer N as the input. The task is to count and print the number of digits in N whose position (from the rightmost…
Count Digits That Are Both Prime and Even
The program must accept an integer N as the input. The task is to count and print the number of digits that are both prime and even in the…
Count Zeroes Surrounded by the Same Digit
The program must accept an integer N as the input. The task is to count the number of zeroes in the number which are surrounded by the same…
Count Digits That Are Fibonacci Numbers
The program must accept an integer N as the input. The task is to count and print the number of digits in N that are Fibonacci numbers. If no…
Count of Digits That Are Less Than Previous Digit
The program must accept an integer N as the input. The task is to count and print the number of digits in N that are less than their immediate…
Bits Count – Y to X
The program must accept two integers X and Y where X is always greater than or equal to Y. The program must print the count of bits C that…
LRU Cache – Miss Count
The least recently used (LRU) cache algorithm evicts the element from the cache that was least recently used when the cache is full. After an…