DSA - Level 1 - Print Zig-Zag | Recursion for Beginners | Algorithms in JAVA

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 problem where we are required to print numbers and some special characters in a zig zag manner. With this video, we also learn about the motion in recursion with more than 1 calls. This question introduces us to Euler Path in recursion and gives us an understanding of the memory while using recursive codes. For this problem, 1. Here are a few sets of inputs and outputs for your reference Input1 - 1 Output1 - 1 1 1 Input2 - 2 Output2 - 2 1 1 1 2 1 1 1 2 Input2 - 3 Output3 - 3 2 1 1 1 2 1 1 1 2 3 2 1 1 1 2 1 1 1 2 3 2. Figure out the pattern and complete the recursive function pzz to achieve the above for any positive number n. To attempt and to submit this problem, click here: https://www.pepcoding.com/resources/online-java-foundation/introduction-to-recursion/print-zig-zag-official/ojquestion For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/online-java-foundation #recursion #programming 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