day9

Author: mahtab04

Day9/q34.py

@@ -0,0 +1,25 @@
+# Find the Missing Number
+# You are given a list of n-1 integers and these integers are in
+# the range of 1 to n. There are no duplicates in list. One of
+# the integers is missing in the list. Write an efficient code
+# to find the missing integer.
+
+
+def missing(arr):
+    size = len(arr)
+    a1 = arr[0]
+    a2 = 1
+    for i in range(1, size):
+        a1 = a1 ^ arr[i]
+    for i in range(2, size+2):
+        a2 = a2 ^ i
+
+    return a1 ^ a2
+
+
+if __name__ == '__main__':
+
+    a = [1, 2, 4, 5, 6]
+
+    miss = missing(a)
+    print(miss)

Day9/q35.py

@@ -0,0 +1,15 @@
+# check given number is odd or even without using modulus operator.
+
+
+def check_Even_odd(number):
+    """This function check whether the given number is odd or even"""
+    if(number & 1) == 1:
+        print("Odd Number")
+    else:
+        print("Even Number")
+
+
+a = 5
+b = 6
+check_Even_odd(a)
+check_Even_odd(b)

Day9/q36.py

@@ -0,0 +1,28 @@
+# Program to find whether a no is power of two
+# Given a positive integer, write a function to find if it is a power of two or not.
+
+# Input : n = 4
+# Output : Yes
+# 22 = 4
+
+# Input : n = 7
+# Output : No
+
+# Input : n = 32
+# Output : Yes
+# 25 = 32
+
+
+def check_Power(number):
+    if(number & number-1) == 0:
+        print("yes")
+    else:
+        print("NO")
+
+
+a = 4
+b = 7
+c = 32
+check_Power(a)
+check_Power(b)
+check_Power(c)