-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathpython.py
More file actions
622 lines (452 loc) · 10.2 KB
/
python.py
File metadata and controls
622 lines (452 loc) · 10.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
'''
#1
def solveMefirst(a,b):
return a + b;
num1 = int(input())
num2 = int(input())
res = solveMefirst(num1,num2)
print(res)
#2
def simpleArraySum(arr):
return sum(arr)
myArray = [1,2,3,4,5];
print(simpleArraySum(myArray));
#3
def campareTriplets(a,b):
alice = 0
bob = 0
for i in range(3):
if a[i] > b[i]:
alice+=1
elif a[i] < b[i]:
bob+=1
return alice, bob;
array1 = 5, 6, 7
array2 = 3, 6, 10
print(campareTriplets(array1, array2));
#4
def aVeryBigSum(ar):
return sum(ar)
a1 = 100000002
a2 = 100000003
a3 = a2, a1
result = aVeryBigSum(a3);
print(result);
#5
def diagonalDifferce(arr):
leftdiag = rightdiag = 0
for i in range(n):
leftdiag = leftdiag + arr[i][i]
rightdiag = rightdiag + arr[i][n - 1 - i]
return abs(leftdiag - rightdiag);
n = int(input().strip())
arr = []
for _ in range(n):
arr.append(list(map(int, input().rstrip().split())))
print(diagonalDifferce(arr));
#6
def hashPattern(n):
for i in range(1, n + 1):
s = "#" * i;
print(s.rjust(n))
n = int(input())
result = hashPattern(n);
print(result)
# 7
def miniMaxSum(arr):
s = 0
minnum = 999999999999
maxnum = 0
n = len(arr)
for i in range(n):
s = s + arr[i]
minnum = min(minnum, arr[i])
maxnum = max(maxnum, arr[i])
print(s-maxnum, s-minnum);
arr = [1,3,5,7,9];
print(miniMaxSum(arr))
#8
def birthdayCakeCandles(arr):
n = len(arr)
maxnum = 0
count = 0
for i in range(n):
if(arr[i] > maxnum):
maxnum = arr[i]
count = 1
elif arr[i] == maxnum:
count+=1
return count
# return arr.count(max(arr)) #another method
print(birthdayCakeCandles([4,4,1,3]));
#9
def timeComversion(time):
meridian = time[-2:]
if meridian == 'AM' and time[:2] == '12':
time = '00' + time[2:]
if meridian == 'PM' and time[:2]!= '12' :
time = str(12 + int(time[:2])) + time[2:]
return time
result = '07:05:45PM'
print(timeComversion(result));
def fibonacci_recursive(n):
if n <= 0:
return "Please enter a positive integer"
elif n == 1:
return 0
elif n == 2:
return 1
else:
return fibonacci_recursive(n - 1) + fibonacci_recursive(n - 2)
# Example usage
n = 10
print(f"The {n}th Fibonacci number is: {fibonacci_recursive(n)}")
#febonacci in another method
def febonacci(num):
a = 0
b = 1
if num <= 0:
return "please enter a positive integer"
else:
for i in range(num):
print(a)
c = a + b
a = b
b = c
return c
# print(febonacci(9))
def palidroma(n):
rem = 0
sum = 0
while(n > 0):
rem = n % 10
sum = sum * 10 + rem
n = n // 10
return sum
def main():
n = int(input("enter your number: "))
m = palidroma(n)
if(n == m):
print("Its is a palidroma number")
else:
print("its not a palidroma")
p = int(input("enter your number: "))
o = febonacci(p)
main()
'''
'''
# factorial number
def factorial(num):
result = 1
for i in range(1, num+1):
result = result * i
return result
print(factorial(5))
def perfect_number(n):
sum = 0
for i in range(1, n):
if(n % i == 0):
sum += i
return sum
def main():
n = int(input("enter your number: "))
m = perfect_number(n)
if(n == m):
print("it is a perfect number")
else:
print("it's not a perfect number")
main()
#sum of digit given number
def sum_digit(num):
sum = 0
while(num > 0):
remainder = num % 10
sum = sum + remainder
num = num // 10
return sum
def main():
n = int(input("enter your number: "))
print(sum_digit(n))
main()
# Prime number
def prime_num(num):
count = 0
for i in range(1,num + 1):
if(num % i == 0):
count = count + 1
return count
def main():
n = int(input("enter num: "))
m = prime_num(n)
if(m == 2):
print("prime number")
else:
print("not a prime number")
main()
# Range of prime number
def prime_num(num):
count = 0
for i in range(1,num + 1):
if(num % i == 0):
count = count + 1
if(count == 2):
return 1
else:
return 0
def main():
n = int(input("from: "))
m = int(input("to: "))
for i in range(n, m+1):
result = prime_num(i)
if(result == 1):
print(i)
main()
# strong number program
def strong_num(num):
temp = num
sum = 0
while(num > 0):
rem = num % 10
fact = 1
for i in range(rem, 1, -1): #range(start, stop, step)
fact = fact * i
sum += fact
num = num // 10
if(sum == temp):
return True
else:
return False
def main():
n = int(input("enter the number: "))
k = int(input("enter the last number: "))
for i in range(n, k+1):
m = strong_num(i)
if(m == True):
print(i)
# if (n == m):
# print("it is a strong number")
# else:
# print("it is not a strong number")
main()
def perfect_num(num):
temp = num
sum = 0
for i in range(1, num):
if(num % i == 0):
sum += i
if(temp == sum):
return True
else:
return False
def main() :
n = int(input("enter from number: "))
m = int(input("enter last number: "))
for i in range(n, m+1):
k = perfect_num(i)
if(k == True):
print(i)
main()
# find a number is arm strong or not
def armStrong_num(num):
sum = 0
while(num > 0):
rem = num % 10
sum += (rem ** 3)
num = num // 10
return sum
def main():
n = int(input("enter the number: "))
m = armStrong_num(n)
if(n == m):
print("Its is an arm strong number: ")
else:
print("Its not a arm strong number")
main()
# range of armstrong number
def armStrong_num(num):
temp = num
sum = 0
while(num > 0):
rem = num % 10
sum += (rem ** 3)
num = num // 10
if(sum == temp):
return True
else:
return False
def main():
n = int(input("enter the from number: "))
m = int(input("enter the to number: "))
for i in range(n, m + 1):
m = armStrong_num(i)
if(m == True):
print(i)
main()
#reverse the number
def reverse_num(num):
sum = 0
while(num > 0):
rem = num % 10
sum = sum * 10 + rem
num = num // 10
return sum
def main():
n = int(input("enter the numbers: "))
print(reverse_num(n))
main()
# factorial of given number using recursive function
def fact_recursion(num):
if(num == 0):
result = 1
else:
result = num * fact_recursion(num - 1)
return result
def main():
n = int(input("enter the number: "))
m = fact_recursion(n)
print(m)
main()
# fibonacci of given number using recursive function
def fibonacci_recursive(num):
res = 1
if(num == 0):
return "Invalid number, give number more than 0"
elif(num == 1):
res = 0
elif(num == 2):
res = 1
else:
res = fibonacci_recursive(num - 1) + fibonacci_recursive(num - 2)
return res
def main():
n = int(input("enter the position of number you want to display in a fibonacci series: "))
m = fibonacci_recursive(n)
print(m)
main()
# Arrays
arr = [10,20,30,40,50]
arr[1] = 21
for i in arr:
print(i)
#Range of Array input
Input = int(input("Enter num: "))
Array = []
for i in range(0, Input):
loop_input = int(input())
Array.append(loop_input)
print(Array)
#2D ARRAY
reginal_country = [
["US", "CANADA"],
["INDIA", "UK"],
["GOA", "DEHLI"]
]
print(reginal_country[2][1])
# for i in reginal_country:
# print(i[1])
#swap two number
def swap_two_num(a, b):
temp = a
a = b
b = temp
return a, b
print(swap_two_num(2,1))
#Biggest of two interger
def biggest_of_two_num():
a = int(input("enter a: "))
b = int(input("enter b: "))
if(a > b):
print("A is biggest number")
else:
print("B is biggest number")
print(biggest_of_two_num())
#sum of first N number
def sum_of_first_N():
n = int(input("enter first number: "))
m = int(input("enter last number: "))
sum = 0
for i in range(n, m+1):
sum += i
return sum
print(sum_of_first_N())
def ternary_oparator():
a = int(input())
b = int(input())
c = int(input())
k = a if ((a > b) and (a > c)) else b if (b > c) else c
return k
print(ternary_oparator())
# print 1 - 10 number using while loop
def whileloop(n):
i = 1
while (n > i):
print(i)
i += 1
return i
print(whileloop(10))
# display even number in a range using while loop
def even_num(num):
i = 1
while (i < num):
if(i % 2 == 0):
print(i)
i += 1
return i
def main():
n = int(input("=> : "))
m = even_num(n)
print(m)
main()
# swapping two numbers without temp variable
def swapping(a, b):
a = 10
b = 20
#imp is logic =
a = a + b
b = a - b
a = a - b
return a , b
print(swapping(10, 20));
# count length given number
def count_given_num(num):
count = 0
while(num > 0):
# rem = num % 10
count += 1
num = num // 10
return count
print(count_given_num(1234567))
def sum_of_digit(num):
sum = 0
while(num > 0):
rem = num % 10
sum = sum + rem
num = num // 10
return sum
print(sum_of_digit(1234))
# Insert an element in an array given position
a = []
size = int(input("Enter the size of the array: "))
for i in range(size):
val = int(input())
a.append(val)
print(a)
key = int(input("Enter the value to insert: "))
pos = int(input("Enter the position: "))
a.append(None)
for i in range(size - 1, pos - 2, -1):
a[i + 1] = a[i]
a[pos] = key
print(a)
'''
#check whether a word is anagram or not
def are_anagram(str1, str2):
str1 = str1.replace(" ","").lower()
str2 = str2.replace(" ","").lower()
return sorted(str1) == sorted(str2)
word1 = input("Enter the 1st String: ")
word2 = input("Enter the 2nd String: ")
if(are_anagram(word1, word2)):
print("The given string is Anagram")
else:
print("The given String is not an Anagarm")