Code

Author: sagargoswami2001

32Bit_or_64Bit_Mode.py

@@ -0,0 +1,3 @@
+# Write a Python Program to determine if the python shell is executing in 32bit or 64bit mode on operating system.
+import struct
+print(struct.calcsize('P') * 8)

Accept_Positive_&_Subtract_Number.py

@@ -0,0 +1,13 @@
+'''Write a Python program that accept a positive number and subtract from this number the sum of its digits
+and so on. Continues this operation until the number is positive.'''
+
+def repeat_times(n):
+    s = 0
+    n_str = str(n)
+    while (n > 0):
+        n -= sum([int(i) for i in list(n_str)])
+        n_str = list(str(n))
+        s += 1
+    return s
+print(repeat_times(9))
+print(repeat_times(21))

Accept_Two_Integers.py

@@ -0,0 +1,6 @@
+# Write a python function to check whether a number is divisible by another number. accept two integers values from the user.
+def multiple(m, n):
+    return True if m % n == 0 else False
+
+print(multiple(20, 5))
+print(multiple(7, 2))

Accepts_Six_Numbers.py

@@ -0,0 +1,11 @@
+# Write a Python Program that accepts six numbers as input and sorts them in descending Order.
+
+'''Input: Input Consists of six numbers n1,n2,n3,n4,n5,n6 (-100000 ≤ n1,n2,n3,n4,n5,n6 ≤ 100000).
+   The Six Numbers are Separated by a Space.'''
+
+print("Input Six Integers: ")
+nums = list(map(int, input().split()))
+nums.sort()
+nums.reverse()
+print("After Sorting the said integers: ")
+print(*nums)

Actual_Module_Object.py

@@ -0,0 +1,5 @@
+# Write a Python Program to Get the Actual Module Object for a Given Object.
+
+from inspect import getmodule
+from math import sqrt
+print(getmodule(sqrt))

Add_2_Integers_without_using_'+'_opr.py

@@ -0,0 +1,12 @@
+# Write a Python Program to add two positive integers without using '+' operator.
+# Note: Use bitwise operations to add two numbers.
+
+def add_without_plus_operator(a, b):
+    while b != 0:
+        data = a & b
+        a = a ^ b
+        b = data << 1
+    return a
+print(add_without_plus_operator(2, 10))
+print(add_without_plus_operator(-20, 10))
+print(add_without_plus_operator(-10, -20))

Anonymous_Function.py

@@ -0,0 +1,10 @@
+# Write a Python Program to Get Numbers Divisible by Fifteen From a List Using an Anonymous Function.
+
+from unittest import result
+
+
+num_list = [45, 55, 60, 37, 100, 105, 220]
+
+# Use Anonymous Function to Filter
+result = list(filter(lambda x: (x % 15 == 0), num_list))
+print('Numbers Divisible by 15 are', result)

Calculate_Run_Time.py

@@ -0,0 +1,11 @@
+# Write a python program to calculate the time runs (difference between start and current time) of a program.
+from timeit import default_timer
+def timer(n):
+    start = default_timer()
+    # some code here
+    for row in range(0,n):
+        print(row)
+    print(default_timer() - start)
+
+timer(5)
+timer(15)

Check_Installed_Python_Module.py

@@ -0,0 +1,9 @@
+# Write a Python Program to get a list of locally installed python modules.
+
+import pkg_resources
+installed_packages = pkg_resources.working_set
+installed_packages_list = sorted(["%s==%s" %(i.key, i.version)
+    for i in installed_packages])
+
+for m in installed_packages_list:
+    print(m)

Check_Integer_64_Bits.py

@@ -0,0 +1,6 @@
+# Write a Python Program to Check Whether an Integer Fits in 64 Bits.
+
+int_val = 30
+if int_val.bit_length() <= 63:
+    print((-2 ** 63).bit_length())
+    print((2 ** 63).bit_length())

Check_Positive_Negative.py

@@ -0,0 +1,11 @@
+# Write a Python Program to Check if a Number is Positive, Negative or Zero.
+
+num = int(input("Enter the Number: "))
+if num > 0:
+    print('It is Positive Number')
+
+elif num == 0:
+    print('It is Zero')
+
+else:
+    print('It is a Negative Number')

Check_three_given_lengths.py

@@ -0,0 +1,13 @@
+'''Write a Python program to check whether three given lengths(integers) of three sides from a right triangle.
+Print "Yes" if the given sides form a right triangle otherwise print "No".
+'''
+
+# Input: Integers Separated by a single space. 1 ≤ lenght of the side ≤ 1,000
+print("Input three integers(sides of a triangle)")
+int_num = list(map(int, input().split()))
+x,y,z = sorted(int_num)
+
+if x**2+y**2==z**2:
+    print('Yes')
+else:
+    print('No')

Combo_of_3_digit.py

@@ -0,0 +1,7 @@
+# Write a Python program to create the combinatons of 3 digit combo.
+
+nums = []
+for num in range(1000):
+    num = str(num).zfill(3)
+print(num)
+nums.append(num)

Common_divisors_between_two_no.py

@@ -0,0 +1,25 @@
+# Write a Python program to find common divisors between two numbers in a given pair.
+def ngcd(x, y):
+    i = 1
+    while(i<=x and i<=y):
+        if(x%i==0 and y%i==0):
+            gcd=i;
+        i+=1
+    return gcd;
+
+def num_comm_div(x, y):
+    n = ngcd(x, y)
+    result = 0
+    z = int(n**0.5)
+    i = 1
+    while(i <= z):
+        if(n % i == 0):
+            result += 2
+            if(i == n/i):
+                result-=1
+        i+=1
+    return result
+
+print("Number of Common Divisors: ",num_comm_div(2, 4))
+print("Number of Common Divisors: ",num_comm_div(6, 12))
+print("Number of Common Divisors: ",num_comm_div(12, 24))

Compute_Product_List.py

@@ -0,0 +1,7 @@
+# Write a Python Program to Compute the Product of a List of Integers (Without Using For Loop)
+
+from functools import reduce
+nums = [10, 20, 30]
+
+nums_product = reduce((lambda x, y: x * y), nums)
+print("Product of the Numbers:", nums_product)

Compute_digit_num_sum_two_integers.py

@@ -0,0 +1,9 @@
+# Write a Python program to compute the digit number of sum of two given integers.
+'''
+Input: Each test case consists of two non-negative integers x and y which are separated by a space in a line.
+0 ≤ x,y ≤ 1000000
+'''
+print("Input Two Integers(A B): ")
+a,b = map(int, input().split(" "))
+print("Number of Digit of A and B: ")
+print(len(str(a+b)))

Contiguous_Subsequence.py

@@ -0,0 +1,26 @@
+'''Write a python program to find the maximum sum of a contiguous subsequence from a given sequence of numbers 
+a1, a2, a3, ... An. A subsequence of one element is also a continuous subsequence.'''
+# Input: You Can Assume That 1 ≤ N ≤ 5000 and -100000 ≤ Ai ≤ 100000. 
+# Input Numbers Are Separated by a Space. Input 0 to Exit.
+
+while True:
+    print("Input Number of Sequence of Numbers you want to input (0 to exit): ")
+    n = int(input())
+    if n == 0:
+        break
+    else:
+        A = []
+        Sum = []
+        print("Input Number: ")
+        for i in range(n):
+            A.append(int(input()))
+        Wa = 0
+        for i in range(0,n):
+            Wa += A[i]
+            Sum.append(Wa)
+        for i in range(0, n):
+            for j in range(0, i):
+                Num = Sum[i] - Sum[j]
+                Sum.append(Num)
+        print("Maximum Sum of the Said Contiguous Subsequence: ")
+        print(max(Sum))

Convert_Int_to_Binary.py

@@ -0,0 +1,4 @@
+# Write a python program to convert an integer to binary keep leading zeros.
+x = 12
+print(format(x, '08b'))
+print(format(x, '010b'))

Convert_String_to_List.py

@@ -0,0 +1,34 @@
+# Write a Python Program to Print a long text, convert the string to a list and print all the words and their frequencies.
+
+string_words = '''Bitcoin(₿) is the first decentralized digital currency created in January 2009. Bitcoin was
+created by Satoshi Nakamoto. The word bitcoin first originated from a white paper published on 31 October 2008.
+It is a compound of the words "bit" and "coin." Bitcoin uses peer-to-peer technology to operate with no central
+authority or banks. Managing transactions and the issuing of bitcoins is carried out collectively by the whole
+peer to peer network of bitcoin. Its implementation was released as open source for it can be seen and accessed
+by anyone.
+
+Bitcoins are created as a reward for a process known as Bitcoin mining. Bitcoin is widely accepted for
+currencies, products, and services. Bitcoin has been censured for its use in illegal transactions,
+the large amount of electricity used by mining, a purely peer-to-peer version of electronic cash would allow
+online payments to be sent directly from one party to another without going through a central autority or
+financial institution.
+
+Bitcoin mining is a highly complex computing process that uses complicated computer code to create a secure
+cryptographic system, as well as the process by which new bitcoin enters into circulation.
+mining is a record-keeping service done through the use of bitcoin mining rigs processing power.
+It involves very large, decentralized networks of computers connected through peer to peer technology
+throughout the world that verify and secure blockchains. Bitcoin mining takes over the Bitcoin database,
+which is called the blockchain.
+
+Crypto miners compete to be the first one to verify Crypto transactions and earn rewards paid in
+Cryptocurrencies for their efforts. Crypto miners need to first invest in computer equipment that is 
+specialized for mining (usually high-end GPUs among other powerful PC components), and typically require
+access to a low cost energy source.'''
+
+words_list = string_words.split()
+
+words_freq = [words_list.count(n) for n in words_list]
+
+print("String:\n {} \n".format(string_words))
+print("List:\n {} \n".format(str(words_list)))
+print("Pairs (Words and Frequencies:\n {}".format(str(list(zip(words_list, words_freq)))))

Count_no_of_carry_operations.py

@@ -0,0 +1,25 @@
+# Write a Python program to count the number of carry operations for each of a set of addition problems.
+def carry_no(x, y):
+    ctr = 0
+    if(x == 0 and y == 0):
+        return 0
+    z = 0
+    for i in reversed(range(10)):
+        z = x%10 + y%10 + z
+        if z > 9:
+            z = 1
+        else:
+            z = 0
+            ctr += z
+            x //= 10
+            y //= 10
+
+    if ctr == 0:
+        return "No Carry Operation."
+    elif ctr == 1:
+        return ctr
+    else:
+        return ctr
+
+print(carry_no(786, 457))
+print(carry_no(5, 6))

Create_Bytearray_List.py

@@ -0,0 +1,8 @@
+# Write a Python Program to Create a Bytearray from a List.
+print()
+nums = [10, 20, 56, 35, 17, 99]
+
+# Create Bytearray from List of Integers.
+values = bytearray(nums)
+for x in values: print(x)
+print()

Create_Possible_Strings.py

@@ -0,0 +1,5 @@
+# Write a python program to create all possible strings by using 'a','e','i','o','u'. Use the characters exactly once.
+import random
+char_list = ['a','e','i','o','u']
+random.shuffle(char_list)
+print(''.join(char_list))

Day_of_the_date.py

@@ -0,0 +1,11 @@
+'''Write a Python program to that reads a date (from 2016/1/1 to 2016/12/31) and prints the day of the date. 
+Jan. 1, 2016, is Friday. Note that 2016 is a leap year.'''
+
+# Input: Two integers m and d separated by a single space in a line, m ,d represent the month and the day.
+
+from datetime import date
+print("Input Month and Date (Separated by a Single Space): ")
+m, d = map(int, input().split())
+weeks = {1:'Monday',2:'Tuesday',3:'Wednesday',4:'Thursday',5:'Friday',6:'Saturday',7:'Sunday'}
+w = date.isoweekday(date(2016, m, d))
+print("Name of the Date: ",weeks[w])

Debt_in_n_months.py

@@ -0,0 +1,19 @@
+'''
+Write a Python Program to compute the amount of the debt in n months. The borrowing amount is $100,000 and the
+loan adds 5% interest of the debt and rounds it to the nearest 1,000 above month by month.
+'''
+# Input: An integer n (0 ≤ n ≤ 100)
+
+def round_n(n):
+    if n%1000:
+        return (1+n//1000)*1000
+    else:
+        return n
+
+def compute_debt(n):
+    if n==0: return 100000
+    return int(round_n(compute_debt(n-1)*1.05))
+
+print("Input Number of Months: ")
+result = compute_debt(int(input()))
+print("Amount of Debt: ","$"+str(result).strip())

Decimal_to_Hexadecimal.py

@@ -0,0 +1,6 @@
+# Write a Python Program to Convert Decimal to Hexadecimal.
+
+x = 30
+print(format(x, '02x'))
+x = 4
+print(format(x, '02x'))

Difference_distinct_pairs_array.py

@@ -0,0 +1,12 @@
+'''Write a Python program to compute the summation of the absolute difference of all distinct pairs in an 
+given array (non-decreasing order).'''
+
+def sum_distinct_pairs(arr):
+    result = 0
+    i = 0
+    while i<len(arr):
+        result += i*arr[i]-(len(arr)-i-1)*arr[i]
+        i += 1
+    return result
+print(sum_distinct_pairs([1,2,3]))
+print(sum_distinct_pairs([1,4,5]))

Difference_largest_&_smallest_int.py

@@ -0,0 +1,11 @@
+'''
+Write a Python program to find the difference between the largest integer and the smallest integer which 
+are created by 8 numbers from 0 to 9. The number that can be rearranged shall start with 0 as in 00135668.
+'''
+# Input: Data is a sequence of 8 numbers (numbers from 0 to 9).
+# Output: The difference between the largest integer and the smallest integer.
+
+print("Input an integer Created by 8 Numbers from 0 to 9: ")
+num = list(input())
+print("Difference Between the Largest and the Smallest Integer from the Given Integer: ")
+print(int("".join(sorted(num,reverse=True))) - int("".join(sorted(num))))

Directory_Wildcard.py

@@ -0,0 +1,4 @@
+# Write a Python Program to Make File Lists From Current Directory Using a Wildcard.
+import glob
+file_list = glob.glob('*.*')
+print(file_list)

Divisors_num_given_even_or_odd.py

@@ -0,0 +1,10 @@
+# Write a Python program to find the number of divisors of a given integer is even or odd.
+def divisors(n):
+    for i in range(n):
+        x = len([i for i in range (1,n+1) if not n % i])
+    return x
+print(divisors(3))
+print(divisors(6))
+print(divisors(9))
+print(divisors(12))
+print(divisors(15))

Double_Quotes_Display_Strings.py

@@ -0,0 +1,3 @@
+# Write a Python Program to Use Double Quotes to Display Strings.
+import json
+print(json.dumps({'Sagar': 1, 'Mohit': 2, 'Goswami': 3}))