Java
Sunny Number A number is called a sunny number if the number next to the given number is a perfect square. In other words, a number N will be a sunny number if N+1 is a perfect square. Let's understand it through an example. #Source_code #72
Steps to Find Sunny Number
The logic is very simple. To find the sunny number, we need only to check whether N+1 is the perfect square or not.
Read or initialize a number (num).
Add 1 to the given number i.e. num+1.
Find the square root of num+1.
If the square root is an integer, the given number is sunny, else not a sunny number.
Let's implement the above steps in a Java program.
#Output
#72
The logic is very simple. To find the sunny number, we need only to check whether N+1 is the perfect square or not.
Read or initialize a number (num).
Add 1 to the given number i.e. num+1.
Find the square root of num+1.
If the square root is an integer, the given number is sunny, else not a sunny number.
Let's implement the above steps in a Java program.
#Output
#72
Java
code.png
#Data_structure
#Output
#84
Example inputs for a given Data Structure:
Input:
string: codesleepcode
pattern: XYX
Output:
X: code
Y: sleep
Input:
string: codecodecode
pattern: XXX
Output:
X: code
#Output
#84
Example inputs for a given Data Structure:
Input:
string: codesleepcode
pattern: XYX
Output:
X: code
Y: sleep
Input:
string: codecodecode
pattern: XXX
Output:
X: code