Strong Students in School solution || GFG weekly contest 114 solution || java || C++ || C || python

Strong Students in School solution || GFG weekly contest 114 solution || java || C++ || C || python

In Peculiar School, students are admitted based on their strength. The strength of n students is given to you in the form of an array arr. The PT teacher wants to analyse 2 sets of m students. Help him find the maximum possible difference between the sum of strengths of students in the two groups.

Note: One student can be a part of more than one group.

Example 1:

Input:
n = 19
Output:
1
Explanation:
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1
12 = 1
Example 2:

Input:
n = 2
Output:
0
Explanation:
22 = 4
42 = 16
12 + 62 = 37
32 + 72 = 58
52 + 82 = 89
82 + 92 = 145
12 + 42 + 52 = 42
42 + 22 = 20
22 + 02 = 4
The cycle will repeat after 4, and will never reach 1.
Your Task:

You don't need to read input or print anything. Your task is to complete the function beautifulNumber() which takes integer n as input parameter and returns a boolean value 1 if n is beautiful, otherwise 0.
# Geeks for Geeks weekly contest 114 soltuion
# GFG contest 114 problem 2 solution
# GFG DSA problem
# weekly contest solution
# GFG contest 114 solution
# coding problem
#programming solution of GFG
# 06 - 08 - 2023 GFG contest solution
# best and easy solution of GFG contest solution 114
# basic while loop in C++ solution
# basic function in c++ solution
Geeks For Geeks Weekly Contest 114 solution in all programming language