MIn Jumps With +i -i Moves | Arrays & Strings | GFG Solution in Hindi

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that. NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. 1. Given an integers X. 2. The task is to find the minimum number of jumps to reach a point X in the number line starting from zero. 3. The first jump made can be of length one unit and each successive jump will be exactly one unit longer than the previous jump in length. 4. It is allowed to go either left or right in each jump. Topic: #Maths #Sum #Arrays&String #Arrays Used #DataStructure: none #TimeComplexity: O(root(n)) #SpaceComplexity:O(1) --------------------------------------------------------------- For detailed information and other exercises, VISIT: www.pepcoding.com Have a look at our result: https://www.pepcoding.com/placements​ Follow us on our FB page:   / pepcoding​   Follow us on Instagram:   / pepcoding​   Follow us on LinkedIn:   / pepcoding-education   ---------------------------------------------------------------- #java #Solution #MinJumps #MinJump+i-vMoves #Arras #Strigs #Pepcoding #gfgSolution #gfgMinJumps #SolutionInHindi For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/o... Have a look at our result: Follow us on our Youtube page:    / pepcoding   Follow us on our FB page:   / pepcoding   Follow us on Instagram:   / pepcoding   Follow us on LinkedIn:   / pepcoding-education   Follow us on Pinterest:   / _created   Follow us on Twitter: https://twitter.com/home . . . Happy Programming !!! Pep it up 😍🤩 . . . #pepcoding #code #coder #codinglife #programming #coding #java #freeresources #datastrucutres #pepcode #competitive #competitiveprogramming #softwareengineer #engineering #engineer