DSA - Level 1 - Recursion Basics | Print Decreasing Increasing Solution using Recursion

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. In this video, we discuss the solution where we are required to print decreasing numbers followed by increasing numbers for any given integer. For a better understanding of the problem, click here: https://youtu.be/V-WSKmGTWxk In this problem, 1. You are given a positive number n. 2. You are required to print the counting from n to 1 and back to n again. 3. You are required to not use any loops. To attempt and submit this question, click here: https://www.pepcoding.com/resources/online-java-foundation/introduction-to-recursion/print-increasing-decreasing-official/ojquestion For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation #pepcoding #datastructuresandalgorithms #freeonlinecourses Have a look at our result: https://www.pepcoding.com/placements Follow us on our FB page: https://www.facebook.com/pepcoding Follow us on Instagram: https://www.instagram.com/pepcoding Follow us on LinkedIn: https://www.linkedin.com/company/pepcoding-education