diff --git a/aler.js b/aler.js
new file mode 100644
index 0000000..2da81e3
--- /dev/null
+++ b/aler.js
@@ -0,0 +1,13 @@
+/*Write a JavaScript conditional statement to find the sign of product of three numbers. Display an alert box with the specified sign. Go to the editor 
+Sample numbers : 3, -7, 2 
+Output : The sign is - */
+
+let sign=(a,b,c)=>{
+ let p=a*b*c;
+  if(p<0)
+alert("the sign is -")
+  else
+    alert("the sign is +")
+}
+
+sign(3,-7,2)
\ No newline at end of file
diff --git a/arraycheck.js b/arraycheck.js
new file mode 100644
index 0000000..d6639f3
--- /dev/null
+++ b/arraycheck.js
@@ -0,0 +1,11 @@
+//to check an array
+
+let checkarray=(input)=>{
+ 
+    console.log(Array.isArray(input));
+ 
+}
+ checkarray([1,2,3]);
+
+
+
diff --git a/firstnelements.js b/firstnelements.js
new file mode 100644
index 0000000..5b0dce6
--- /dev/null
+++ b/firstnelements.js
@@ -0,0 +1,33 @@
+/*Write a JavaScript function to get the first element of an array. Passing a parameter 'n' will return the first 'n' elements of the array. 
+Test Data : 
+console.log(first([7, 9, 0, -2])); 
+console.log(first([],3));
+console.log(first([7, 9, 0, -2],3));
+console.log(first([7, 9, 0, -2],6));
+console.log(first([7, 9, 0, -2],-3));
+Expected Output : 
+7
+[] 
+[7, 9, 0] 
+[7, 9, 0, -2] 
+[] */
+
+
+let first=(arr,param)=>
+{
+  
+  
+  if(param==null)
+    param=1;
+   if(param<0)
+    param=0;
+  console.log(arr.slice(0,param));
+}
+first([7,9,0,-2]);
+first([],3)
+first([7,9,0,-2],3)
+first([7,9,0,-2],6)
+first([7,9,0,-2],-3)
+
+
+
diff --git a/freqelements.js b/freqelements.js
new file mode 100644
index 0000000..eb3bb9b
--- /dev/null
+++ b/freqelements.js
@@ -0,0 +1,26 @@
+/*Write a JavaScript program to find the most frequent item of an array. 
+Sample array : var arr1=[3, 'a', 'a', 'a', 2, 3, 'a', 3, 'a', 2, 4, 9, 3];
+Sample Output : a ( 5 times ) 
+*/
+
+let count=(input)=>{
+  let c=0;
+  let item;
+  let max=1;
+  for(let i=0;i<input.length;++i){
+    c=0;
+    for(let j=0;j<input.length;++j){
+      if(input[i]==input[j]){
+        ++c;
+      }}
+      if(c>max){
+        max=c;
+        item=input[i];
+      }
+    }
+  console.log(item+"("+max+"times)");
+  }
+  
+count([3, 'a', 'a', 'a', 2, 3, 'a', 3, 'a', 2, 4, 9, 3]);
+
+
diff --git a/insertdashes.js b/insertdashes.js
new file mode 100644
index 0000000..9c4924d
--- /dev/null
+++ b/insertdashes.js
@@ -0,0 +1,20 @@
+//Write a JavaScript program which accept a number as input and insert dashes (-) between each two even numbers. For example if you accept 025468 the output should be 0-254-6-8.
+
+let dash=(input)=>{
+  
+  let arr1=Array.from(input.toString());
+  console.log(arr1)
+  let i;
+  let j;
+  for(i=0;i<arr1.length;++i)
+    { 
+ 
+      if(arr1[i]%2==0 && arr1[i+1]%2==0)
+      {arr1.splice(i+1,0,'-')
+      }
+    }
+  console.log(arr1.join(''));
+}
+dash(025468);
+
+
diff --git a/joinelements.js b/joinelements.js
new file mode 100644
index 0000000..3943aeb
--- /dev/null
+++ b/joinelements.js
@@ -0,0 +1,14 @@
+/*Write a simple JavaScript program to join all elements of the following array into a string. 
+Sample array : myColor = ["Red", "Green", "White", "Black"];
+Expected Output : 
+"Red,Green,White,Black"
+"Red,Green,White,Black"
+"Red+Green+White+Black"*/
+
+
+let join1=(arr1)=>{
+  console.log(arr1.join(','));
+  console.log(arr1.join('+'));
+}
+join1(['red','green','blue']);
+
diff --git a/largest.js b/largest.js
new file mode 100644
index 0000000..943cf9d
--- /dev/null
+++ b/largest.js
@@ -0,0 +1,12 @@
+//Write a JavaScript program that accept two integers and display the larger.
+let large=(a,b)=>{
+  if(a>b)
+    console.log("largest is "+a);
+  else
+    console.log("largest is "+b)
+}
+large(10,15)
+/*
+Exception: SyntaxError: expected expression, got ')'
+@Scratchpad/3:1
+*/
\ No newline at end of file
diff --git a/largestcondition.js b/largestcondition.js
new file mode 100644
index 0000000..a16978a
--- /dev/null
+++ b/largestcondition.js
@@ -0,0 +1,22 @@
+/* Write a JavaScript conditional statement to sort three numbers. Display an alert box to show the result. 
+Sample numbers : 0, -1, 4 
+Output : 4, 0, -1 */
+
+
+
+let sign=(a,b,c,d,e)=>{
+  let max;
+  let arr=Array.of(a,b,c,d,e);
+  max=arr[0];
+    for(let i=0;i<arr.length;i++)
+    if(arr[i]>arr[i+1] && arr[i]>max)
+      max=arr[i];
+      
+        
+      
+ alert("largest is "+max);
+
+}
+
+sign(-5,-2,-6,0,-1);
+
diff --git a/lastnelements.js b/lastnelements.js
new file mode 100644
index 0000000..c67c13e
--- /dev/null
+++ b/lastnelements.js
@@ -0,0 +1,25 @@
+/*Write a JavaScript function to get the last element of an array. Passing a parameter 'n' will return the last 'n' elements of the array.
+Test Data : 
+console.log(last([7, 9, 0, -2])); 
+console.log(last([7, 9, 0, -2],3)); 
+console.log(last([7, 9, 0, -2],6));
+Expected Output : 
+-2 
+[9, 0, -2] 
+[7, 9, 0, -2]*/
+
+
+let last=(arr1,param1)=>{
+  if(param1==null)
+    param1=1;
+  arr1.reverse();
+  let arr2=arr1.slice(0,param1);
+  console.log(arr2.reverse())}
+last([7,9,0,-2]);
+last([7,9,0,-2],3);
+last([7,9,0,-2],6);
+
+
+
+
+
diff --git a/loop.js b/loop.js
new file mode 100644
index 0000000..9248abc
--- /dev/null
+++ b/loop.js
@@ -0,0 +1,10 @@
+let loop=()=>{
+  for(let i=0;i<=15;++i){
+    if(i%2==0)
+      console.log(i+" is even");
+    else
+      console.log(i+" is odd")
+  }
+}
+
+loop();
\ No newline at end of file
diff --git a/nestedloop.js b/nestedloop.js
new file mode 100644
index 0000000..6a743de
--- /dev/null
+++ b/nestedloop.js
@@ -0,0 +1,25 @@
+/* Write a JavaScript program which prints the elements of the following array. Go to the editor
+Note : Use nested for loops.
+Sample array : var a = [[1, 2, 1, 24], [8, 11, 9, 4], [7, 0, 7, 27], [7, 4, 28, 14], [3, 10, 26, 7]];
+Sample Output : 
+"row 0" 
+" 1" 
+" 2" 
+" 1"
+" 24"
+"row 1" 
+------
+------
+*/
+
+let nest=(input)=>{
+  
+   for(let i=0;i<input.length;++i){
+    console.log("row"+i);
+    for(let j=0;j<input.length;++j){
+
+    console.log(input[i][j]);
+    
+    } }}
+nest( [[1, 2, 1, 24], [8, 11, 9, 4], [7, 0, 7, 27], [7, 4, 28, 14], [3, 10, 26, 7]]);
+
diff --git a/sort.js b/sort.js
new file mode 100644
index 0000000..cdce0ef
--- /dev/null
+++ b/sort.js
@@ -0,0 +1,4 @@
+//Write a JavaScript program to sort the items of an array. 
+let arr1=[3,8,7,6,5,-4,-3,2,1];
+console.log(arr1.sort());
+
diff --git a/sortcondition.js b/sortcondition.js
new file mode 100644
index 0000000..9ae283f
--- /dev/null
+++ b/sortcondition.js
@@ -0,0 +1,15 @@
+let sign=(a,b,c)=>{
+  let arr=Array.of(a,b,c);
+  for(let j=0;j<arr.length;j++)
+    for(let i=0;i<arr.length;i++)
+    if(arr[i]<arr[i+1])
+      {
+        temp=arr[i];
+        arr[i]=arr[i+1]
+        arr[i+1]=temp
+      }
+ alert(arr.join(' '))
+
+}
+
+sign(0,-1,4);
diff --git a/sumproduct.js b/sumproduct.js
new file mode 100644
index 0000000..9692c31
--- /dev/null
+++ b/sumproduct.js
@@ -0,0 +1,15 @@
+//Write a JavaScript program to compute the sum and product of an array of integers.
+let sum=(input)=>{
+ let sum1=0;
+ let product=1;
+  for(let i=0;i<input.length;i++)
+    {
+      sum1+=input[i];
+      product*=input[i];
+    }
+  console.log("sum="+sum1)
+  console.log("product="+product)
+}
+
+sum([2,3,5]);
+
diff --git a/uppercase.js b/uppercase.js
new file mode 100644
index 0000000..3660dd9
--- /dev/null
+++ b/uppercase.js
@@ -0,0 +1,15 @@
+/*Write a JavaScript program which accept a string as input and swap the case of each character. For example if you input 'The Quick Brown Fox' the output should be 'tHE qUICK bROWN fOX'.*/
+
+let str=(input)=>{
+  let a=Array.from(input);
+  for(let i=0;i<a.length;i++)
+    {
+      if(a[i]==a[i].toUpperCase())
+        a[i]=a[i].toUpperCase();
+      else
+         a[i]=a[i].toLowerCase();}
+  console.log(a.join(''));
+    }
+  str('tHE qUICK bROWN fOX')
+
+