Coding challenge-2

                          # Coding Challenge-2

                       (Please Enable Desktop Mode on Mobiles.)


Required Knowledge-Basics of Division and remainder of a number(Modular Arithmetic).

1. Quotient of a number is found by using / operator.
2. Remainder of a number is found by using % operator.

   

   Example-

   1).Quotient--

                  1)45/10 = 4

                  2)675/10 = 67

    Note: There is no fractional value as int Value/int Value is an int value only.

   2).Remainder--

                    1)45%3   = 0

                    2)89%4   = 1

                    3)348%5 = 3

Challenge-

                                      POP && PUT Challenge

You will be given a number quite large with around digits more than two,you need to pop off the first and last of its digits and interchange both of them with each other and then give its reverse

This is equivalent of saying keeping the extreme digits fixed reverse the digits in the middle.

    

    Example-

                input--                                  output--

                1)2864839      ---------------->2384689

                2)8632452565 ---------------->8652542365

                3)3788           ---------------->3878

                 

                                         All The Best