QUESTION SET

We have 5 types of hardness for our question set.

1. Very Easy (For the Beginners)
2. Cakewalk (A little hard)
3. Easy (It requires to practise coding)
4. Medium (Involves DSA)
5. Hard (For Experts in CP)

Problems are listed for the ease of access.

Very Easy:-

1. PRINTING TABLE
2. DIAGONAL DIFFERENCE

Cake Walk:-

1. HACKER IN CLASS
2. CAESAR'S CIPHER
3. GENERATING PRIMES

Easy:-

1. SECRET MESSAGE
2. CHARGED UP ARRAY