From 3e80b296a5eb365e2b53c64c4f2b1f1d72dad366 Mon Sep 17 00:00:00 2001 From: Asifur Rahaman Date: Sat, 6 Aug 2022 11:38:11 +0600 Subject: [PATCH] diplicate point deleted there was a duplicate point in level 3, point 4 & 6 --- 06_Day_Loops/06_day_loops.md | 1 - 1 file changed, 1 deletion(-) diff --git a/06_Day_Loops/06_day_loops.md b/06_Day_Loops/06_day_loops.md index c093495..8847143 100644 --- a/06_Day_Loops/06_day_loops.md +++ b/06_Day_Loops/06_day_loops.md @@ -474,7 +474,6 @@ for(let i = 0; i <= 5; i++){ 1. Sort the webTechs array and mernStack array 1. Extract all the countries contain the word 'land' from the [countries array](https://github.com/Asabeneh/30DaysOfJavaScript/tree/master/data/countries.js) and print it as array 1. Find the country containing the hightest number of characters in the [countries array](https://github.com/Asabeneh/30DaysOfJavaScript/tree/master/data/countries.js) -1. Extract all the countries contain the word 'land' from the [countries array](https://github.com/Asabeneh/30DaysOfJavaScript/tree/master/data/countries.js) and print it as array 1. Extract all the countries containing only four characters from the [countries array](https://github.com/Asabeneh/30DaysOfJavaScript/tree/master/data/countries.js) and print it as array 1. Extract all the countries containing two or more words from the [countries array](https://github.com/Asabeneh/30DaysOfJavaScript/tree/master/data/countries.js) and print it as array 1. Reverse the [countries array](https://github.com/Asabeneh/30DaysOfJavaScript/tree/master/data/countries.js) and capitalize each country and stored it as an array