initial commit

codeperfectplus · codeperfectplus · commit c54740712bd1 · 2020-04-27T19:52:20.000+05:30
diff --git a/JavaScript/Day10 Binary Number.js b/JavaScript/Day10 Binary Number.js
@@ -0,0 +1,8 @@
+function main() {
+    const n = parseInt(readLine(), 10);
+    var decNum = dec2bin(n)
+    
+}
+dec2bin = (dec) => {
+    return (dec >>> 0).toString(2);
+}
diff --git a/JavaScript/Day7 Array.js b/JavaScript/Day7 Array.js
@@ -0,0 +1,6 @@
+function main() {
+    const n = parseInt(readLine(), 10);
+
+    const arr = readLine().split(' ').map(arrTemp => parseInt(arrTemp, 10));
+    console.log(arr.reverse());
+}
diff --git a/JavaScript/Day8 Dictionaries and Maps.js b/JavaScript/Day8 Dictionaries and Maps.js
diff --git a/JavaScript/Day9 Recursion.js b/JavaScript/Day9 Recursion.js
@@ -0,0 +1,9 @@
+function factorial(n) {
+    if(n<0) {
+        return 1;
+    }else if(n==1){
+        return 1;
+    }else{
+        return n * factorial(n-1);
+    }
+}
diff --git a/Python/Day10 Binary Number.py b/Python/Day10 Binary Number.py
@@ -0,0 +1,7 @@
+if __name__ == '__main__':
+    def func(num):
+        return num[2:]
+    
+n = int(input().strip())
+a = max(func(bin(n)).split('0')).count('1')
+print(a)
diff --git a/Python/Day7 Arrays.py b/Python/Day7 Arrays.py
@@ -0,0 +1,5 @@
+if __name__ == '__main__':
+    n = int(input())
+
+    arr = list(map(int, input().rstrip().split()))
+    print(*reversed(arr))
diff --git a/Python/Day8 Dictionaries and Maps.py b/Python/Day8 Dictionaries and Maps.py
@@ -0,0 +1,13 @@
+N = int(input())
+entry = [input().split() for _ in range(N)]
+phoneBook = {name:number for name,number in entry}
+    
+while True:
+    try:
+        name = input()
+        if name in phoneBook:
+            print(f"{name}={phoneBook[name]}")
+        else:
+            print('Not found')
+    except:
+        break
diff --git a/Python/Day9 Recursion.py b/Python/Day9 Recursion.py
@@ -0,0 +1,8 @@
+def factorial(n):
+    if n<0:
+        return 1
+    elif n == 1:
+        return 1
+    else:
+        return n * factorial(n-1)
+
