This repository contains solutions to problems from the TakeUForward DSA course. The solutions are provided in four programming languages: JavaScript, Java, C++, and Python. Currently, the JavaScript solutions are being added first, followed by the other languages.
The structure of the repository mirrors the structure on the TakeUForward website. The solutions are organized by language and problem type.
patterns
basic-maths
- Count all digits of a number
- Count number of odd digits in a number
- Reverse a number
- Palindrome number
- Return the largest digit in a number
- Factorial of a given number
- Check if the number is armstrong
- Check for perfect number
- Check for prime number
- Count of prime numbers till N
- GCD of two numbers
- LCM of two numbers
- Divisors of a number
basic-arrays
basic-hashing
basic-strings
basic-recursion
To navigate through the repository, select the language folder at the top level and then choose the problem type folder. Each folder contains the solutions to the respective problems.