npy and npz files added

Class

@@ -0,0 +1,60 @@
+class Employee:
+	raise_amount = 1.02
+
+	def __init__(self,first,last,pay):
+		self.first = first
+		self.last = last
+		self.pay = pay
+		self.email = first + '.' + last +'@gmail.com'
+
+	def fullname(self):
+	    print(self.first ,self.last) 
+
+	def apply_raise(self):
+		self.pay = int(self.pay * self.raise_amount)
+
+
+class Developer(Employee):
+	raise_amount = 1.10
+
+	def __init__(self,first,last,pay,prog_lang):
+		super().__init__(first,last,pay)
+		self.prog_lang = prog_lang
+
+
+class Manager(Employee):
+	raise_amount = 1.05
+
+	def __init__(self,first,last,pay,employees):
+		super().__init__(first,last,pay)
+		self.employees = employees
+
+	def add_emp(self,emp):
+		if emp not in self.employees:
+			self.employees.append(emp)
+
+	def remove_emp(self,emp):
+		if emp in self.employees:
+			self.employees.remove(emp)
+
+	def print_emp(self):
+		for emp in self.employees:
+			print(emp.fullname())
+
+
+
+dev_1 = Developer('Pranjal','RMCF',140000,'Python')
+dev_2 = Developer('James','Dean',115000,'Java')
+dev_3 = Developer('Michael','Jackson',90000,'Ruby')
+dev_4 = Developer('Daniel',"Radcliffe",85000,'C')
+
+mgr_1 = Manager('Steven','Spielberg',120000,[dev_1,dev_4])
+mgr_2 = Manager('James','Cameron',110000,[dev_2,dev_3])
+
+#print(dev_1.email)
+mgr_1.print_emp()
+#mgr_1.add_emp(dev_3)
+#mgr_1.print_emp()
+#print(dev_4.prog_lang)
+#print(isinstance(dev_4,Manager))
+#print(issubclass(Developer,Manager))

New code

@@ -0,0 +1 @@
+print('Hello-World')

Phone.py

@@ -0,0 +1,7 @@
+import re
+n=input()
+pattern = re.compile("[789]")
+if pattern.match(n)!=None and len(n)==10:
+	print("Valid")
+else:
+	print("Invalid")

Qspace.py

@@ -0,0 +1,7 @@
+f=str(input("Name:"))
+f=f+".txt"
+f=open(f,'r')
+y=str(f.read())
+l=[]
+l=y.split(' ')
+print(len(l)-1)

biased coin simulator

@@ -0,0 +1,8 @@
+import random
+x=random.choice(['heads','tails'])
+print(x)
+y=random.random()
+if  y<0.6:
+	print('heads')
+else:
+	print('tailsb')

codes/check_cons_ones.py

@@ -0,0 +1,9 @@
+n=input('enter the binary number: ')
+k=input('enter the value of K: ')
+g=0
+l=int(k)
+g='1'*l
+if(g in n):
+	print("yes there are given no. of consecutive 1's in the binary number")
+else:
+	print('NO')

diagonal elements

@@ -0,0 +1,5 @@
+import numpy as np 
+a=np.array([[1,2,3],[5,6,7],[9,10,11]])
+print(a)
+for i in range(3):
+    print(a[i,i],a[i,2-i])

pallindrome

@@ -0,0 +1,24 @@
+s = []
+copy = ""
+count = -1
+n = int(input("enter number of strings: "))
+for i in range(n):
+	s.append(input())
+for i in s:
+	if i == i[::-1]:
+		print("-1")
+	else:
+		for j in range(0,len(i)):
+			copy=""
+			for k in range(0,len(i)):
+				if k == j:
+					continue
+				copy+=i[k]
+			# print(copy)
+			count+=1
+			if copy == copy[::-1]:
+				print(count)
+				break
+		else:
+			print("-1")
+		count = -1

pattern.py

@@ -0,0 +1,9 @@
+n = int(input("Enter an odd number for a beautiful pattern: "))
+if n%2 != 0:
+  for i in range(n):
+      for j in range(n):
+         print(n-min(i,j,n-1-i,n-1-j),end="")
+      print()
+else:
+  print("Not an odd number")
+