Programming Street - 150 Starting from Zero in Coding - DSA is a critical Problem-Solving Skill, it's important to build a strong foundation before diving into it.
For those coming from a non-technical background, the world of coding can seem daunting, especially when faced with advanced concepts like Data Structures and Algorithms (DSA). While DSA is a critical Problem-Solving Skill, it's important to build a strong foundation before diving into it.
This sprint covers fundamental problems to help you build your basic programming skills.
This sprint focuses on intermediate-level problems, further strengthening your foundational skills and introducing more complex concepts.
This sprint includes advanced problems designed to solidify your understanding and prepare you for more challenging programming tasks.
| Status | Title | Solution | Acceptance | Difficulty | Topics |
|---|---|---|---|---|---|
| - | Determining Even/Odd Numbers | View | - | Easy | Basic Programming |
| - | Checking for Prime Numbers | Soon | - | Easy | Basic Programming, Number Theory |
| - | Validating Leap Years | Soon | - | Easy | Basic Programming, Date Handling |
| - | Calculating Armstrong Numbers | Soon | - | Easy | Basic Programming, Number Theory |
| - | Generating the Fibonacci Series | Soon | - | Easy | Basic Programming, Sequences |
| - | Identifying Palindromes | Soon | - | Easy | Basic Programming, String Manipulation |
| - | Crafting Star Patterns | Soon | - | Easy | Basic Programming, Patterns |
| - | Finding the Factorial of a Number | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Summing Digits of a Number | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Finding the Greatest Common Divisor (GCD) | Soon | - | Easy | Basic Programming, Number Theory |
| - | Finding the Least Common Multiple (LCM) | Soon | - | Easy | Basic Programming, Number Theory |
| - | Counting Vowels and Consonants in a String | Soon | - | Easy | Basic Programming, String Manipulation |
| - | Reversing a String | Soon | - | Easy | Basic Programming, String Manipulation |
| - | Finding the Largest and Smallest Numbers in an Array | Soon | - | Easy | Basic Programming, Arrays |
| - | Sorting an Array | Soon | - | Easy | Basic Programming, Sorting Algorithms |
| - | Finding the Sum of Elements in an Array | Soon | - | Easy | Basic Programming, Arrays |
| - | Checking for Armstrong Numbers in a Range | Soon | - | Easy | Basic Programming, Number Theory |
| - | Generating Multiplication Tables | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Finding Prime Numbers in a Range | Soon | - | Easy | Basic Programming, Number Theory |
| - | Checking for Perfect Numbers | Soon | - | Easy | Basic Programming, Number Theory |
| - | Calculating the Sum of Even Numbers in a Range | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Calculating the Sum of Odd Numbers in a Range | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Finding the Fibonacci Number at a Specific Position | Soon | - | Easy | Basic Programming, Sequences |
| - | Printing Prime Numbers Less Than a Given Number | Soon | - | Easy | Basic Programming, Number Theory |
| - | Finding the Number of Digits in a Number | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Checking if a Number is a Narcissistic Number | Soon | - | Easy | Basic Programming, Number Theory |
| - | Generating a Pattern of Numbers | Soon | - | Easy | Basic Programming, Patterns |
| - | Finding the Sum of the Digits of the Factorial of a Number | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Finding the Largest Palindrome in a String | Soon | - | Easy | Basic Programming, String Manipulation |
| - | Finding Missing Numbers in a Sequence | Soon | - | Easy | Basic Programming, Arrays |
| - | Generating a Pascal’s Triangle | Soon | - | Medium | Arrays, Mathematical Computations |
| - | Finding the Median of an Array | Soon | - | Medium | Arrays, Sorting |
| - | Calculating the Power of a Number | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Checking for an Anagram | Soon | - | Easy | String Manipulation |
| - | Finding the Sum of Prime Numbers in a Range | Soon | - | Medium | Number Theory, Mathematical Computations |
| - | Finding the N-th Triangular Number | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Checking for Perfect Squares | Soon | - | Easy | Mathematical Computations |
| - | Finding the Sum of Squares of Digits | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Generating a Square Matrix of a Given Size | Soon | - | Medium | Arrays, Matrix Operations |
| - | Calculating the Sum of Digits of a Number Until Single Digit | Soon | - | Medium | Mathematical Computations |
| - | Finding the Count of Specific Digits in a Number | Soon | - | Easy | Basic Programming, String Manipulation |
| - | Generating a Fibonacci Sequence Using Recursion | Soon | - | Medium | Recursion, Sequences |
| - | Finding All Divisors of a Number | Soon | - | Easy | Basic Programming, Mathematical Computations |
| - | Finding the Average of Numbers in an Array | Soon | - | Easy | Arrays, Mathematical Computations |
| - | Finding the Mode of Numbers in an Array | Soon | - | Medium | Arrays, Statistical Analysis |
| - | Determining the Length of a String Without Using Built-In Functions | Soon | - | Medium | String Manipulation |
| - | Generating a Number Pyramid | Soon | - | Medium | Patterns, Basic Programming |
| - | Finding the Sum of Prime Factors of a Number | Soon | - | Medium | Number Theory, Mathematical Computations |
| - | Finding the Second Largest Number in an Array | Soon | - | Medium | Arrays, Sorting |
| - | Finding the Longest Substring Without Repeating Characters | Soon | - | Medium | String Manipulation, Sliding Window |
0+
0+
0+
0+