CodeDaily
Topics
DSA
Arrays & Strings
Recursion
Trees & Graphs
Dynamic Programming
Linked Lists
View all →
Web Dev
Frontend
Backend
Full Stack
DevOps
APIs & REST
View all →
AI & ML
Machine Learning
Deep Learning
Computer Vision
NLP
Data Science
View all →
Blockchain
Smart Contracts
DeFi
Web3
Solidity
NFTs & Tokens
View all →
Questions
Level 1 · Easy
Patterns
Linked Lists
Stacks and Queues
Binary Tree
Graphs
2D Arrays
Hashmap And Heap
All Level 1 →
Level 2 · Medium
Arrays and Strings
Dynamic Programming
Trees
Graphs
Linked List
Stacks
Bit Manipulation
All Level 2 →
Level 3 · Hard
Maths
Segment Tree
Game Theory
Number Theory
Geometry
Digit DP
Range Queries
All Level 3 →
Compiler
Python
JavaScript
Java
C++
C
TypeScript
Go
Rust
Kotlin
Swift
Ruby
C#
Dart
PHP
Zig
Perl
Haskell
Julia
F#
OCaml
Pascal
COBOL
All languages →
Contests
Sign In
CodeDaily
Topics
DSA
Web Dev
AI & ML
Blockchain
Cybersecurity
Cloud
DevOps
Mobile
System Design
Questions
Level 1 · Easy
Patterns
Linked Lists
Stacks and Queues
Binary Tree
Graphs
2D Arrays
Hashmap And Heap
Level 2 · Medium
Arrays and Strings
Dynamic Programming
Trees
Graphs
Linked List
Stacks
Bit Manipulation
Level 3 · Hard
Maths
Segment Tree
Game Theory
Number Theory
Geometry
Digit DP
Range Queries
Compiler
Python
JavaScript
TypeScript
Java
C++
C
Go
Rust
Kotlin
Swift
Ruby
C#
Dart
PHP
Zig
Perl
Haskell
Julia
F#
OCaml
Pascal
COBOL
All languages →
Contests
Sign In
DSA
Level 1
Recursion and Backtracking
Introduction to Recursion
Tower Of Hanoi
Tower Of Hanoi
easy
Introduction to Recursion
Question
Solve
Solutions
Java
Java
C++
Run
I/O
Results
Input
3
Output
Click Run to execute
No submissions yet
Java
C++
Next
Print Decreasing
Related Questions
easy
Print Decreasing
easy
Print Increasing
easy
Print Increasing Decreasing
easy
Factorial
easy
Power-linear
easy
Power-logarithmic
easy
Print Zigzag
Video Explanation
0:00 / 0:00