/DSA

Primary LanguageJavaScript

DSA Practice

1. Basics

1.1 Patterns

This JavaScript code generates patterns using nested loops. Click to expand and see all the patterns it prints.
-----------
pattern 1
-----------
####
####
####
####

-----------
pattern 2
-----------
#
##
###
####

-----------
pattern 3
-----------
1
12
123
1234
12345

-----------
pattern 4
-----------
1
22
333
4444
55555

-----------
pattern 5
-----------
#####
####
###
##
#

-----------
pattern 6
-----------
54321
4321
321
21
1

-----------
pattern 7
-----------
    #    
   ###   
  #####  
 ####### 
#########

-----------
pattern 8
-----------
#########
 ####### 
  #####  
   ###   
    #    

-----------
pattern 9
-----------
    #    
   ###   
  #####  
 ####### 
#########
#########
 ####### 
  #####  
   ###   
    #    

-----------
pattern 10
-----------
#    
##   
###  
#### 
#####
#####
#### 
###  
##   
#    

-----------
pattern 11
-----------
1
01
101
0101
10101

-----------
pattern 11
-----------
1
01
101
0101
10101

-----------
pattern 12
-----------
1      1
12    21
123  321
12344321

-----------
pattern 13
-----------
1
23
456
78910
1112131415

-----------
pattern 14
-----------
A
AB
ABC
ABCD
ABCDE

-----------
pattern 15
-----------
ABCDE
ABCD
ABC
AB
A

-----------
pattern 16
-----------
A
BB
CCC
DDDD
EEEEE

-----------
pattern 17
-----------
   A   
  ABA  
 ABCBA 
ABCDCBA

-----------
pattern 18
-----------
E
DE
CDE
BCDE
ABCDE

-----------
pattern 19
-----------
##########
####  ####
###    ###
##      ##
#        #
#        #
##      ##
###    ###
####  ####
##########

-----------
pattern 20
-----------
#        #
##      ##
###    ###
####  ####
##########
####  ####
###    ###
##      ##
#        #

-----------
pattern 21
-----------
####
#  #
#  #
####

-----------
pattern 22
-----------
4444444
4333334
4322234
4321234
4322234
4333334
4444444

1.2 Basic Math

Solves following problems:

1.Count Digits		
2.Reverse a Number		
3.Check Palindrome		
4.GCD Or HCF		
5.Armstrong Numbers		
6.Print all Divisors		
7.Check for Prime

1.3 Basic Recursion

Solves following problems:

1.Understand recursion by print somet…		
2.Print name N times using recursion		
3.Print 1 to N using recursion		
4.Print N to 1 using recursion		
5.Sum of first N numbers		
6.Factorial of N numbers		
7.Reverse an array		
8.Check if a string is palindrome 		
9.Fibonacci Number