# Python Basic(Part-II) - Exercises, Practice, Solution

## Python Basic (Part-II) [120 exercises with solution]

[*An editor is available at the bottom of the page to write and execute the scripts.*]

**1.** Write a Python function that takes a sequence of numbers and determines whether all the numbers are different from each other. Go to the editor

Click me to see the sample solution

**2.** Write a Python program to create all possible strings by using 'a', 'e', 'i', 'o', 'u'. Use the characters exactly once. Go to the editor

Click me to see the sample solution

**3.** Write a Python program to remove and print every third number from a list of numbers until the list becomes empty.

Click me to see the sample solution

**4.** Write a Python program to find unique triplets whose three elements gives the sum of zero from an array of n integers. Go to the editor

Click me to see the sample solution

**5.** Write a Python program to create the combinations of 3 digit combo. Go to the editor

Click me to see the sample solution

**6.** Write a Python program to print a long text, convert the string to a list and print all the words and their frequencies. Go to the editor

Click me to see the sample solution

**7.** Write a Python program to count the number of each character of a given text of a text file. Go to the editor

Click me to see the sample solution

**8.** Write a Python program to get the top stories from Google news. Go to the editor

Click me to see the sample solution

**9.** Write a Python program to get a list of locally installed Python modules. Go to the editor

Click me to see the sample solution

**10.** Write a Python program to display some information about the OS where the script is running. Go to the editor

Click me to see the sample solution

**11.** Write a Python program to check the sum of three elements (each from an array) from three arrays is equal to a target value. Print all those three-element combinations. Go to the editor

Sample data:

/*

X = [10, 20, 20, 20]

Y = [10, 20, 30, 40]

Z = [10, 30, 40, 20]

target = 70

*/

Click me to see the sample solution

**12.** Write a Python program to create all possible permutations from a given collection of distinct numbers.Go to the editor

Click me to see the sample solution

**13.** Write a Python program to get all possible two digit letter combinations from a digit (1 to 9) string. Go to the editor

string_maps = {

"1": "abc",

"2": "def",

"3": "ghi",

"4": "jkl",

"5": "mno",

"6": "pqrs",

"7": "tuv",

"8": "wxy",

"9": "z"

}

Click me to see the sample solution

**14.** Write a Python program to add two positive integers without using the '+' operator. Go to the editor

Note: Use bit wise operations to add two numbers.

Click me to see the sample solution

**15.** Write a Python program to check the priority of the four operators (+, -, *, /). Go to the editor

Click me to see the sample solution

**16.** Write a Python program to get the third side of right angled triangle from two given sides. Go to the editor

Click me to see the sample solution

**17.** Write a Python program to get all strobogrammatic numbers that are of length n. Go to the editor

A strobogrammatic number is a number whose numeral is rotationally symmetric, so that it appears the same when rotated 180 degrees. In other words, the numeral looks the same right-side up and upside down (e.g., 69, 96, 1001).

For example,

Given n = 2, return ["11", "69", "88", "96"].

Given n = 3, return ['818', '111', '916', '619', '808', '101', '906', '609', '888', '181', '986', '689']

**18.** Write a Python program to find the median among three given numbers. Go to the editor

Click me to see the sample solution

**19.** Write a Python program to find the value of n where n degrees of number 2 are written sequentially in a line without spaces. Go to the editor

Click me to see the sample solution

**20.** Write a Python program to find the number of zeros at the end of a factorial of a given positive number. Go to the editor

Range of the number(n): (1 <= n <= 2*109).

Click me to see the sample solution

**21. ** Write a Python program to find the number of notes (Sample of notes: 10, 20, 50, 100, 200 and 500 ) against a given amount. Go to the editor

Range - Number of notes(n) : n (1 <= n <= 1000000).

Click me to see the sample solution

**22.** Write a Python program to create a sequence where the first four members of the sequence are equal to one, and each successive term of the sequence is equal to the sum of the four previous ones. Find the Nth member of the sequence. Go to the editor

Click me to see the sample solution

**23.** 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. Go to the editor

Click me to see the sample solution

**24.** Write a Python program to find the number of divisors of a given integer is even or odd. Go to the editor

Click me to see the sample solution

**25.** Write a Python program to find the digits which are absent in a given mobile number. Go to the editor

Click me to see the sample solution

**26.** Write a Python program to compute the summation of the absolute difference of all distinct pairs in an given array (non-decreasing order). Go to the editor

Sample array: [1, 2, 3]

Then all the distinct pairs will be:

1 2

1 3

2 3

Click me to see the sample solution

**27.** Write a Python program to find the type of the progression (arithmetic progression/geometric progression) and the next successive member of a given three successive members of a sequence. Go to the editor

According to Wikipedia, an arithmetic progression (AP) is a sequence of numbers such that the difference of any two successive members of the sequence is a constant. For instance, the sequence 3, 5, 7, 9, 11, 13, . . . is an arithmetic progression with common difference 2. For this problem, we will limit ourselves to arithmetic progression whose common difference is a non-zero integer.

On the other hand, a geometric progression (GP) is a sequence of numbers where each term after the first is found by multiplying the previous one by a fixed non-zero number called the common ratio. For example, the sequence 2, 6, 18, 54, . . . is a geometric progression with common ratio 3. For this problem, we will limit ourselves to geometric progression whose common ratio is a non-zero integer.

Click me to see the sample solution

**28.** Write a Python program to print the length of the series and the series from the given 3rd term, 3rd last term and the sum of a series. Go to the editor

Sample Data:

Input third term of the series: 3

Input 3rd last term: 3

Sum of the series: 15

Length of the series: 5

Series:

1 2 3 4 5

Click me to see the sample solution

**29.** Write a Python program to find common divisors between two numbers in a given pair. Go to the editor

Click me to see the sample solution

**30.** Write a Python program to reverse the digits of a given number and add it to the original, If the sum is not a palindrome repeat this procedure. Go to the editor

Note: A palindrome is a word, number, or other sequence of characters which reads the same backward as forward, such as madam or racecar.

Click me to see the sample solution

**31.** Write a Python program to count the number of carry operations for each of a set of addition problems. Go to the editor

According to Wikipedia " In elementary arithmetic, a carry is a digit that is transferred from one column of digits to another column of more significant digits. It is part of the standard algorithm to add numbers together by starting with the rightmost digits and working to the left. For example, when 6 and 7 are added to make 13, the "3" is written to the same column and the "1" is carried to the left".

Click me to see the sample solution

**32.** Write a python program to find heights of the top three building in descending order from eight given buildings. Go to the editor

**Input:**

0 <= height of building (integer) <= 10,000

Input the heights of eight buildings:

25

35

15

16

30

45

37

39

Heights of the top three buildings:

45

39

37

Click me to see the sample solution

**33.** Write a Python program to compute the digit number of sum of two given integers. Go to the editor

**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 <= 1,000,000

Input two integers(a b):

5 7

Sum of two integers a and b.:

2

Click me to see the sample solution

**34.** Write a Python program to check whether three given lengths (integers) of three sides form a right triangle. Print "Yes" if the given sides form a right triangle otherwise print "No". Go to the editor

**Input:**

Integers separated by a single space.

1 <= length of the side <= 1,000

Input three integers(sides of a triangle)

8 6 7

No

Click me to see the sample solution

**35.** Write a Python program which solve the equation: Go to the editor

ax+by=c

dx+ey=f

Print the values of x, y where a, b, c, d, e and f are given.

**Input:**

a,b,c,d,e,f separated by a single space.

(-1,000 <= a,b,c,d,e,f <= 1,000)

Input the value of a, b, c, d, e, f:

5 8 6 7 9 4

Values of x and y:

-2.000 2.000

Click me to see the sample solution

**36.** 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. Go to the editor

**Input:**

An integer n (0 <= n <= 100)

Input number of months: 7

Amount of debt: $144000

Click me to see the sample solution

**37.** Write a Python program which reads an integer n and find the number of combinations of a,b,c and d (0 <= a,b,c,d <= 9) where (a + b + c + d) will be equal to n. Go to the editor

**Input:**

n (1 <= n <= 50)

Input the number(n): 15

Number of combinations: 592

Click me to see the sample solution

**38.** Write a Python program to print the number of prime numbers which are less than or equal to a given integer. Go to the editor

**Input:**

n (1 <= n <= 999,999)

Input the number(n): 35

Number of prime numbers which are less than or equal to n.: 11

Click me to see the sample solution

**39.** Write a program to compute the radius and the central coordinate (x, y) of a circle which is constructed by three given points on the plane surface. Go to the editor

**Input:**

x1, y1, x2, y2, x3, y3 separated by a single space.

Input three coordinate of the circle:

9 3 6 8 3 6

Radius of the said circle:

3.358

Central coordinate (x, y) of the circle:

6.071 4.643

Click me to see the sample solution

**40.** Write a Python program to check whether a point (x,y) is in a triangle or not. There is a triangle formed by three points. Go to the editor

**Input:**

x1,y1,x2,y2,x3,y3,xp,yp separated by a single space.

Input three coordinate of the circle:

9 3 6 8 3 6

Radius of the said circle:

3.358

Central coordinate (x, y) of the circle:

6.071 4.643

Click me to see the sample solution

**41.** Write a Python program to compute and print sum of two given integers (more than or equal to zero). If given integers or the sum have more than 80 digits, print "overflow". Go to the editor

Input first integer:

25

Input second integer:

22

Sum of the two integers: 47

Click me to see the sample solution

**42.** Write a Python program that accepts six numbers as input and sorts them in descending order. Go to the editor

**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.

Input six integers:

15 30 25 14 35 40

After sorting the said integers:

40 35 30 25 15 14

Click me to see the sample solution

**43.** Write a Python program to test whether two lines PQ and RS are parallel. The four points are P(x1, y1), Q(x2, y2), R(x3, y3), S(x4, y4). Go to the editor

**Input: **

x1,y1,x2,y2,x3,y3,xp,yp separated by a single space

Input x1,y1,x2,y2,x3,y3,xp,yp:

2 5 6 4 8 3 9 7

PQ and RS are not parallel

Click me to see the sample solution

**44.** 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. Go to the editor

**Input: **

You can assume that 1 <= n <= 5000 and -100000 <= ai <= 100000.

Input numbers are separated by a space.

Input 0 to exit.

Input number of sequence of numbers you want to input (0 to exit):

3

Input numbers:

2

4

6

Maximum sum of the said contiguous subsequence: 12

Input number of sequence of numbers you want to input (0 to exit):

0

Click me to see the sample solution

**45.** There are two circles C1 with radius r1, central coordinate (x1, y1) and C2 with radius r2 and central coordinate (x2, y2). Go to the editor

Write a Python program to test the followings -

- "C2 is in C1" if C2 is in C1
- "C1 is in C2" if C1 is in C2
- "Circumference of C1 and C2 intersect" if circumference of C1 and C2 intersect, and
- "C1 and C2 do not overlap" if C1 and C2 do not overlap.

**Input:**

Input numbers (real numbers) are separated by a space.

Input x1, y1, r1, x2, y2, r2:

5 6 4 8 7 9

C1 is in C2

Click me to see the sample solution

**46.** 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. Go to the editor

**Input: **

Two integers m and d separated by a single space in a line, m ,d represent the month and the day.

Input month and date (separated by a single space):

5 15

Name of the date: Sunday

Click me to see the sample solution

**47.** Write a Python program which reads a text (only alphabetical characters and spaces.) and prints two words. The first one is the word which is arise most frequently in the text. The second one is the word which has the maximum number of letters. Go to the editor

Note: A word is a sequence of letters which is separated by the spaces.

**Input:**

A text is given in a line with following condition:

a. The number of letters in the text is less than or equal to 1000.

b. The number of letters in a word is less than or equal to 32.

c. There is only one word which is arise most frequently in given text.

d. There is only one word which has the maximum number of letters in given text.

Input text: Thank you for your comment and your participation.

Output: your participation.

Click me to see the sample solution

**48.** Write a Python program that reads n digits (given) chosen from 0 to 9 and prints the number of combinations where the sum of the digits equals to another given number (s). Do not use the same digits in a combination. Go to the editor

**Input: **

Two integers as number of combinations and their sum by a single space in a line. Input 0 0 to exit.

Input number of combinations and sum, input 0 0 to exit:

5 6

2 4

0 0

2

Click me to see the sample solution

**49.** Write a Python program which reads the two adjoined sides and the diagonal of a parallelogram and check whether the parallelogram is a rectangle or a rhombus. Go to the editor

According to Wikipedia-

parallelograms: In Euclidean geometry, a parallelogram is a simple (non-self-intersecting) quadrilateral with two pairs of parallel sides. The opposite or facing sides of a parallelogram are of equal length and the opposite angles of a parallelogram are of equal measure.

rectangles: In Euclidean plane geometry, a rectangle is a quadrilateral with four right angles. It can also be defined as an equiangular quadrilateral, since equiangular means that all of its angles are equal (360°/4 = 90°). It can also be defined as a parallelogram containing a right angle.

rhombus: In plane Euclidean geometry, a rhombus (plural rhombi or rhombuses) is a simple (non-self-intersecting) quadrilateral whose four sides all have the same length. Another name is equilateral quadrilateral, since equilateral means that all of its sides are equal in length. The rhombus is often called a diamond, after the diamonds suit in playing cards which resembles the projection of an octahedral diamond, or a lozenge, though the former sometimes refers specifically to a rhombus with a 60° angle, and the latter sometimes refers specifically to a rhombus with a 45° angle.

Input:

Two adjoined sides and the diagonal.

1 <= ai, bi, ci <= 1000, ai + bi > ci

Input two adjoined sides and the diagonal of a parallelogram (comma separated):

3,4,5

This is a rectangle.

Click me to see the sample solution

**50.** Write a Python program to replace a string "Python" with "Java" and "Java" with "Python" in a given string. Go to the editor

**Input:**

English letters (including single byte alphanumeric characters, blanks, symbols) are given on one line. The length of the input character string is 1000 or less.

Input a text with two words 'Python' and 'Java'

Python is popular than Java

Java is popular than Python

Click me to see the sample solution

**51.** 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. Go to the editor

**Input:**

Input an integer created by 8 numbers from 0 to 9.:

2345

Difference between the largest and the smallest integer from the given integer:

3087

Click me to see the sample solution

**52.** Write a Python program to compute the sum of first n given prime numbers. Go to the editor

**Input:**

n ( n <= 10000). Input 0 to exit the program.

Input a number (n<=10000) to compute the sum:(0 to exit)

25

Sum of first 25 prime numbers:

1060

Click me to see the sample solution

**53.** Write a Python program that accept an even number (>=4, Goldbach number) from the user and create a combinations that express the given number as a sum of two prime numbers. Print the number of combinations. Go to the editor

Goldbach number: A Goldbach number is a positive even integer that can be expressed as the sum of two odd primes.[4] Since four is the only even number greater than two that requires the even prime 2 in order to be written as the sum of two primes, another form of the statement of Goldbach's conjecture is that all even integers greater than 4 are Goldbach numbers.

The expression of a given even number as a sum of two primes is called a Goldbach partition of that number. The following are examples of Goldbach partitions for some even numbers:

6 = 3 + 3

8 = 3 + 5

10 = 3 + 7 = 5 + 5

12 = 7 + 5

...

100 = 3 + 97 = 11 + 89 = 17 + 83 = 29 + 71 = 41 + 59 = 47 + 53

Input an even number (0 to exit):

100

Number of combinations:

6

Click me to see the sample solution

**54.** if you draw a straight line on a plane, the plane is divided into two regions. For example, if you pull two straight lines in parallel, you get three areas, and if you draw vertically one to the other you get 4 areas.

Write a Python program to create maximum number of regions obtained by drawing n given straight lines. Go to the editor

**Input:**

(1 <= n <= 10,000)

Input number of straight lines (o to exit):

5

Number of regions:

16

Click me to see the sample solution

**55.** There are four different points on a plane, P(x_{p},y_{p}), Q(x_{q}, y_{q}), R(x_{r}, y_{r}) and S(x_{s}, y_{s}). Write a Python program to test AB and CD are orthogonal or not. Go to the editor

**Input:**

x_{p},y_{p}, x_{q}, y_{q}, x_{r}, y_{r}, x_{s} and y_{s} are -100 to 100 respectively and each value can be up to 5 digits after the decimal point It is given as a real number including the number of.
Output:

Output AB and CD are not orthogonal! or AB and CD are orthogonal!.

Click me to see the sample solution

**56.** Write a Python program to sum of all numerical values (positive integers) embedded in a sentence.

Write a Python program to create maximum number of regions obtained by drawing n given straight lines. Go to the editor

**Input:**

Sentences with positive integers are given over multiple lines. Each line is a character string containing one-byte alphanumeric characters, symbols, spaces, or an empty line. However the input is 80 characters or less per line and the sum is 10,000 or less.

Input some text and numeric values (

Sum of the numeric values: 80

None

Input some text and numeric values (

Sum of the numeric values: 17

None

Input some text and numeric values (

Sum of the numeric values: 10

None

Click me to see the sample solution

**57.** There are 10 vertical and horizontal squares on a plane. Each square is painted blue and green. Blue represents the sea, and green represents the land. When two green squares are in contact with the top and bottom, or right and left, they are said to be ground. The area created by only one green square is called "island". For example, there are five islands in the figure below.

Write a Python program to read the mass data and find the number of islands. Go to the editor

**Input:**

Input 10 rows of 10 numbers representing green squares (island) as 1 and blue squares (sea) as zeros

1100000111

1000000111

0000000111

0010001000

0000011100

0000111110

0001111111

1000111110

1100011100

1110001000

Number of islands:

5

Click me to see the sample solution

**58.** When character are consecutive in a string , it is possible to shorten the character string by replacing the character with a certain rule. For example, in the case of the character string YYYYY, if it is expressed as # 5 Y, it is compressed by one character.

Write a Python program to restore the original string by entering the compressed string with this rule. However, the # character does not appear in the restored character string. Go to the editor

Note: The original sentences are uppercase letters, lowercase letters, numbers, symbols, less than 100 letters, and consecutive letters are not more than 9 letters.

**Input:**

The restored character string for each character on one line.

Original text: XY#6Z1#4023

XYZZZZZZ1000023

Original text: #39+1=1#30

999+1=1000

Click me to see the sample solution

**59.** A convex polygon is a simple polygon in which no line segment between two points on the boundary ever goes outside the polygon. Equivalently, it is a simple polygon whose interior is a convex set. In a convex polygon, all interior angles are less than or equal to 180 degrees, while in a strictly convex polygon all interior angles are strictly less than 180 degrees.

Write a Python program that compute the area of the polygon . The vertices have the names vertex 1, vertex 2, vertex 3, ... vertex n according to the order of edge connections Go to the editor

Note: The original sentences are uppercase letters, lowercase letters, numbers, symbols, less than 100 letters, and consecutive letters are not more than 9 letters.

**Input:**

Input is given in the following format.

x1 , y1

x2 , y2

:

xn , yn

xi , yi are real numbers representing the x and y coordinates of vertex i , respectively.

Input the coordinates (ctrl+d to exit):

1.0, 0.0

0.0, 0.0

1.0, 1.0

2.0, 0.0

-1.0, 1.0

Area of the polygon;

1.50000000.

Click me to see the sample solution

**60.** Internet search engine giant, such as Google accepts web pages around the world and classify them, creating a huge database. The search engines also analyze the search keywords entered by the user and create inquiries for database search. In both cases, complicated processing is carried out in order to realize efficient retrieval, but basics are all cutting out words from sentences.

Write a Python program to cut out words of 3 to 6 characters length from a given sentence not more than 1024 characters. Go to the editor

**Input:**

English sentences consisting of delimiters and alphanumeric characters are given on one line.

Input a sentence (1024 characters. max.)

The quick brown fox

3 to 6 characters length of words:

The quick brown fox

Click me to see the sample solution

**61.** Arrange integers (0 to 99) as narrow hilltop, as illustrated in Figure 1. Reading such data representing huge, when starting from the top and proceeding according to the next rule to the bottom. Write a Python program that compute the maximum value of the sum of the passing integers. Go to the editor

**Input:**

A series of integers separated by commas are given in diamonds. No spaces are included in each line. The input example corresponds to Figure 1. The number of lines of data is less than 100 lines.

Output:

The maximum value of the sum of integers passing according to the rule on one line.

Input the numbers (ctrl+d to exit):

8

4, 9

9, 2, 1

3, 8, 5, 5

5, 6, 3, 7, 6

3, 8, 5, 5

9, 2, 1

4, 9

8

Maximum value of the sum of integers passing according to the rule on one line.

64

Click me to see the sample solution

**62.** Write a Python program to find the number of combinations that satisfy p + q + r + s = n where n is a given number <= 4000 and p, q, r, s in the range of 0 to 1000. Go to the editor

Input a positive integer: (ctrl+d to exit)

252

Number of combinations of a,b,c,d: 2731135

Click me to see the sample solution

**63.** Write a Python program which adds up columns and rows of given table as shown in the specified figure. Go to the editor

Input number of rows/columns (0 to exit)

4

Input cell value:

25 69 51 26

68 35 29 54

54 57 45 63

61 68 47 59

Result:

25 69 51 26 171

68 35 29 54 186

54 57 45 63 219

61 68 47 59 235

208 229 172 202 811

Input number of rows/columns (0 to exit)

Click me to see the sample solution

**64.** Given a list of numbers and a number k, write a Python program to check whether the sum of any two numbers from the list is equal to k or not. Go to the editor

For example, given [1, 5, 11, 5] and k = 16, return true since 11 + 5 is 16.

Sample Input:

([12, 5, 0, 5], 10)

([20, 20, 4, 5], 40)

([1, -1], 0)

([1, 1, 0], 0)

Sample Output:

True

True

True

False

Click me to see the sample solution

**65.** In mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements. For example, the sequence (A,B,D) is a subsequence of (A,B,C,D,E,F) obtained after removal of elements C, E, and F. The relation of one sequence being the subsequence of another is a preorder.

The subsequence should not be confused with substring (A,B,C,D) which can be derived from the above string (A,B,C,D,E,F) by deleting substring (E,F). The substring is a refinement of the subsequence.

The list of all subsequences for the word "apple" would be "a", "ap", "al", "ae", "app", "apl", "ape", "ale", "appl", "appe", "aple", "apple", "p", "pp", "pl", "pe", "ppl", "ppe", "ple", "pple", "l", "le", "e", "".

Write a Python program to find the longest word in set of words which is a subsequence of a given string. Go to the editor

Sample Input:

("Green", {"Gn", "Gren", "ree", "en"})

("pythonexercises", {"py", "ex", "exercises"})

Sample Output:

Gren

exercises

Click me to see the sample solution

**66.** From Wikipedia, the free encyclopaedia:

A happy number is defined by the following process:

Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers, while those that do not end in 1 are unhappy numbers.

Write a Python program to check whether a number is "happy" or not. Go to the editor

Sample Input:

(7)

(932)

Sample Output:

True

True

Click me to see the sample solution

**67.** From Wikipedia,

A happy number is defined by the following process:

Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers, while those that do not end in 1 are unhappy numbers.

Write a Python program to find and print the first 10 happy numbers. Go to the editor

Sample Input:

[:10]

Sample Output:

[1, 7, 10, 13, 19, 23, 28, 31, 32, 44]

Click me to see the sample solution

**68.** Write a Python program to count the number of prime numbers less than a given non-negative number. Go to the editor

Sample Input:

(10)

(100)

Sample Output:

4

25

Click me to see the sample solution

**69.** In abstract algebra, a group isomorphism is a function between two groups that sets up a one-to-one correspondence between the elements of the groups in a way that respects the given group operations. If there exists an isomorphism between two groups, then the groups are called isomorphic.

Two strings are isomorphic if the characters in string A can be replaced to get string B

Given "foo", "bar", return false.

Given "paper", "title", return true.

Write a Python program to check if two given strings are isomorphic to each other or not. Go to the editor

Sample Input:

("foo", "bar")

("bar", "foo")

("paper", "title")

("title", "paper")

("apple", "orange")

("aa", "ab")

("ab", "aa")

Sample Output:

False

False

True

True

False

False

False

Click me to see the sample solution

**70.** Write a Python program to find the longest common prefix string amongst a given array of strings. Return false If there is no common prefix.

For Example, longest common prefix of "abcdefgh" and "abcefgh" is "abc". Go to the editor

Sample Input:

["abcdefgh","abcefgh"]

["w3r","w3resource"]

["Python","PHP", "Perl"]

["Python","PHP", "Java"]

Sample Output:

abc

w3r

P

Click me to see the sample solution

**71.** Write a Python program to reverse only the vowels of a given string. Go to the editor

Sample Input:

("w3resource")

("Python")

("Perl")

("USA")

Sample Output:

w3resuorce

Python

Perl

ASU

Click me to see the sample solution

**72.** Write a Python program to check whether a given integer is a palindrome or not. Go to the editor

Note: An integer is a palindrome when it reads the same backward as forward. Negative numbers are not palindromic.

Sample Input:

(100)

(252)

(-838)

Sample Output:

False

True

False

Click me to see the sample solution

**73.** Write a Python program to remove the duplicate elements of a given array of numbers such that each element appear only once and return the new length of the given array. Go to the editor

Sample Input:

[0,0,1,1,2,2,3,3,4,4,4]

[1, 2, 2, 3, 4, 4]

Sample Output:

5

4

Click me to see the sample solution

**74.** Write a Python program to calculate the maximum profit from selling and buying values of stock. An array of numbers represent the stock prices in chronological order. Go to the editor

For example, given [8, 10, 7, 5, 7, 15], the function will return 10, since the buying value of the stock is 5 dollars and sell value is 15 dollars.

Sample Input:

([8, 10, 7, 5, 7, 15])

([1, 2, 8, 1])

([])

Sample Output:

10

7

0

Click me to see the sample solution

**75.** Write a Python program to remove all instances of a given value from a given array of integers and find the length of the new array. Go to the editor

Sample Input:

([1, 2, 3, 4, 5, 6, 7, 5], 5)

([10,10,10,10,10], 10)

([10,10,10,10,10], 20)

([], 1)

Sample Output:

6

0

5

0

Click me to see the sample solution

**76.** Write a Python program to find the starting and ending position of a given value in a given array of integers, sorted in ascending order. Go to the editor

If the target is not found in the array, return [0, 0].

Input: [5, 7, 7, 8, 8, 8] target value = 8

Output: [0, 5]

Input: [1, 3, 6, 9, 13, 14] target value = 4

Output: [0, 0]

Click me to see the sample solution

**77.** The price of a given stock on each day is stored in an array.

Write a Python program to find the maximum profit in one transaction i.e., buy one and sell one share of the stock from the given price value of the said array. You cannot sell a stock before you buy one. Go to the editor

Input (Stock price of each day): [224, 236, 247, 258, 259, 225]

Output: 35

Explanation:

236 - 224 = 12

247 - 224 = 23

258 - 224 = 34

259 - 224 = 35

225 - 224 = 1

247 - 236 = 11

258 - 236 = 22

259 - 236 = 23

225 - 236 = -11

258 - 247 = 11

259 - 247 = 12

225 - 247 = -22

259 - 258 = 1

225 - 258 = -33

225 - 259 = -34

Click me to see the sample solution

**78.** Write a Python program to print a given N by M matrix of numbers line by line in forward > backwards > forward >... order. Go to the editor

Input matrix:

[[1, 2, 3,4],

[5, 6, 7, 8],

[0, 6, 2, 8],

[2, 3, 0, 2]]

Output:

1

2

3

4

8

7

6

5

0

6

2

8

2

0

3

2

Click me to see the sample solution

**79.** Write a Python program to compute the largest product of three integers from a given list of integers. Go to the editor

Sample Input:

[-10, -20, 20, 1]

[-1, -1, 4, 2, 1]

[1, 2, 3, 4, 5, 6]

Sample Output:

4000 8 120Click me to see the sample solution

**80.** Write a Python program to find the first missing positive integer that does not exist in a given list. Go to the editor

Sample Input:

[2, 3, 7, 6, 8, -1, -10, 15, 16]

[1, 2, 4, -7, 6, 8, 1, -10, 15]

[1, 2, 3, 4, 5, 6, 7]

[-2, -3, -1, 1, 2, 3]

Sample Output:

4 3 8 4Click me to see the sample solution

**81.** Write a Python program to randomly generate a list with 10 even numbers between 1 and 100 inclusive. Go to the editor

Note: Use random.sample() to generate a list of random values.

Sample Input:

(1,100)

Sample Output:

[4, 22, 8, 20, 24, 12, 30, 98, 28, 48]Click me to see the sample solution

**82.** Write a Python program to calculate the median from a list of numbers. Go to the editor

Sample Input:

[1,2,3,4,5]

[1,2,3,4,5,6]

[6,1,2,4,5,3]

[1.0,2.11,3.3,4.2,5.22,6.55]

[1.0,2.11,3.3,4.2,5.22]

[2.0,12.11,22.3,24.12,55.22]

Sample Output:

3

3.5

3.5

3.75

3.3

22.3

Click me to see the sample solution

**83.** Write a Python program to test whether a given number is symmetrical or not. Go to the editor

A number is symmetrical when it is equal of its reverse.

Sample Input:

(121)

(0)

(122)

(990099)

Sample Output:

True

True

False

True

Click me to see the sample solution

**84.** Write a Python program that accept a list of numbers and create a list to store the count of negative number in first element and store the sum of positive numbers in second element. Go to the editor

Sample Input:

[1, 2, 3, 4, 5]

[-1, -2, -3, -4, -5]

[1, 2, 3, -4, -5]

[1, 2, -3, -4, -5]

Sample Output:

[0, 15]

[5, 0]

[2, 6]

[3, 3]

Click me to see the sample solution

**85.** From Wikipedia:

An isogram (also known as a "nonpattern word") is a logological term for a word or phrase without a repeating letter. It is also used by some people to mean a word or phrase in which each letter appears the same number of times, not necessarily just once. Conveniently, the word itself is an isogram in both senses of the word, making it autological.

Write a Python program to check whether a given string is an "isogram" or not. Go to the editor

Sample Input:

("w3resource")

("w3r")

("Python")

("Java")

Sample Output:

False

True

True

False

Click me to see the sample solution

**86.** Write a Python program to count the number of equal numbers from three given integers. Go to the editor

Sample Input:

(1, 1, 1)

(1, 2, 2)

(-1, -2, -3)

(-1, -1, -1)

Sample Output:

3

2

0

3

Click me to see the sample solution

**87.** Write a Python program to check whether a given employee code is exactly 8 digits or 12 digits. Return True if the employee code is valid and False if it's not. Go to the editor

Sample Input:

('12345678')

('1234567j')

('12345678j')

('123456789123')

('123456abcdef')

Sample Output:

True

False

False

True

False

Click me to see the sample solution

**88.** Write a Python program that accept two strings and test if the letters in the second string are present in the first string. Go to the editor

Sample Input:

["python", "ypth"]

["python", "ypths"]

["python", "ypthon"]

["123456", "01234"]

["123456", "1234"]

Sample Output:

True

False

True

False

True

Click me to see the sample solution

**89.** Write a Python program to compute the sum of the three lowest positive numbers from a given list of numbers. Go to the editor

Sample Input:

[10, 20, 30, 40, 50, 60, 7]

[1, 2, 3, 4, 5]

[0, 1, 2, 3, 4, 5]

Sample Output:

37

6

6

Click me to see the sample solution

**90.** Write a Python program to replace all but the last five characters of a given string into "*" and returns the new masked string. Go to the editor

Sample Input:

("kdi39323swe")

("12345abcdef")

("12345")

Sample Output:

******23swe

******bcdef

12345

Click me to see the sample solution

**91.** Write a Python program to count the number of arguments in a given function. Go to the editor

Sample Input:

()

(1)

(1, 2)

(1, 2, 3)

(1, 2, 3, 4)

[1, 2, 3, 4]

Sample Output:

0

1

2

3

4

1

Click me to see the sample solution

**92.** Write a Python program to compute cumulative sum of numbers of a given list. Go to the editor

Note: Cumulative sum = sum of itself + all previous numbers in the said list.

Sample Input:

[10, 20, 30, 40, 50, 60, 7]

[1, 2, 3, 4, 5]

[0, 1, 2, 3, 4, 5]

Sample Output:

[10, 30, 60, 100, 150, 210, 217]

[1, 3, 6, 10, 15]

[0, 1, 3, 6, 10, 15]

Click me to see the sample solution

**93.** Write a Python program to find the middle character(s) of a given string. If the length of the string is odd return the middle character and return the middle two characters if the string length is even. Go to the editor

Sample Input:

("Python")

("PHP")

("Java")

Sample Output:

th

H

av

Click me to see the sample solution

**94.** Write a Python program to find the largest product of the pair of adjacent elements from a given list of integers. Go to the editor

Sample Input:

[1,2,3,4,5,6]

[1,2,3,4,5]

[2,3]

Sample Output:

30

20

6

Click me to see the sample solution

**95.** Write a Python program to check whether every even index contains an even number and every odd index contains odd number of a given list. Go to the editor

Sample Input:

[2, 1, 4, 3, 6, 7, 6, 3]

[2, 1, 4, 3, 6, 7, 6, 4]

[4, 1, 2]

Sample Output:

True

False

True

Click me to see the sample solution

**96.** Write a Python program to check whether a given number is a narcissistic number or not. Go to the editor

If you are a reader of Greek mythology, then you are probably familiar with Narcissus. He was a hunter of exceptional beauty that he died because he was unable to leave a pool after falling in love with his own reflection. That's why I keep myself away from pools these days (kidding).

In mathematics, he has kins by the name of narcissistic numbers - numbers that can't get enough of themselves. In particular, they are numbers that are the sum of their digits when raised to the power of the number of digits.

For example, 371 is a narcissistic number; it has three digits, and if we cube each digits 3^{3} + 7^{3} + 1^{3} the sum is 371. Other 3-digit narcissistic numbers are

153 = 1^{3} + 5^{3} + 3^{3}

370 = 3^{3} + 7^{3} + 0^{3}

407 = 4^{3} + 0^{3} + 7^{3}.

There are also 4-digit narcissistic numbers, some of which are 1634, 8208, 9474 since

1634 = 1^{4}+6^{4}+3^{4}+4^{4}

8208 = 8^{4}+2^{4}+0^{4}+8^{4}

9474 = 9^{4}+4^{4}+7^{4}+4^{4}

It has been proven that there are only 88 narcissistic numbers (in the decimal system) and that the largest of which is

115,132,219,018,763,992,565,095,597,973,971,522,401

has 39 digits.

Sample Input:

(153)

(370)

(407)

(409)

(1634)

(8208)

(9474)

(9475)

Sample Output:

True

True

True

False

True

True

True

False

Click me to see the sample solution

**97.** Write a Python program to find the highest and lowest number from a given string of space separated integers. Go to the editor

Sample Input:

("1 4 5 77 9 0")

("-1 -4 -5 -77 -9 0")

("0 0")

Sample Output:

(77, 0)

(0, -77)

(0, 0)

Click me to see the sample solution

**98.** Write a Python program to check whether a sequence of numbers has an increasing trend or not. Go to the editor

Sample Input:

[1,2,3,4]

[1,2,5,3,4]

[-1,-2,-3,-4]

[-4,-3,-2,-1]

[1,2,3,4,0]

Sample Output:

True

False

False

True

False

Click me to see the sample solution

**99.** Write a Python program to find the position of the second occurrence of a given string in another given string. If there is no such string return -1. Go to the editor

Sample Input:

("The quick brown fox jumps over the lazy dog", "the")

("the quick brown fox jumps over the lazy dog", "the")

Sample Output:

-1

31

Click me to see the sample solution

**100.** Write a Python program to compute the sum of all items of a given array of integers where each integer is multiplied by its index. Return 0 if there is no number. Go to the editor

Sample Input:

[1,2,3,4]

[-1,-2,-3,-4]

[]

Sample Output:

20

-20

0

Click me to see the sample solution

**101.** Write a Python program to find the name of the oldest student from a given dictionary containing the names and ages of a group of students. Go to the editor

Sample Input:

{"Bernita Ahner": 12, "Kristie Marsico": 11,
"Sara Pardee": 14, "Fallon Fabiano": 11,
"Nidia Dominique": 15}

{"Nilda Woodside": 12, "Jackelyn Pineda": 12.2,
"Sofia Park": 12.4, "Joannie Archibald": 12.6,
"Becki Saunder": 12.7}

Sample Output:

Nidia Dominique

Becki Saunder

Click me to see the sample solution

**102.** Write a Python program to create a new string with no duplicate consecutive letters from a given string. Go to the editor

Sample Input:

("PPYYYTTHON")

("PPyyythonnn")

("Java")

("PPPHHHPPP")

Sample Output:

PYTHON

Python

Java

PHP

Click me to see the sample solution

**103.** Write a Python program to check whether two given lines are parallel or not. Go to the editor

Note: Parallel lines are two or more lines that never intersect. Parallel Lines are like railroad tracks that never intersect.

The General Form of the equation of a straight line is: ax + by = c

The said straight line is represented in a list as [a, b, c]

Example of two parallel lines:

x + 4y = 10 and x + 4y = 14

Sample Input:

([2,3,4], [2,3,8])

([2,3,4], [4,-3,8])

Sample Output:

True

False

Click me to see the sample solution

**104.** Write a Python program to find the lucky number(s) in a given matrix. Go to the editor

Sample Input:

Original matrix: [[1, 2], [2, 3]]

Lucky number(s) in the said matrix: [2]

Original matrix: [[1, 2, 3], [3, 4, 5]]

Lucky number(s) in the said matrix: [3]

Original matrix: [[7, 5, 6], [3, 4, 4], [6, 5, 7]]

Lucky number(s) in the said matrix: [5]

Click me to see the sample solution

**105.** Write a Python program to check whether a given sequence is linear, quadratic or cubic. Go to the editor

Sequences are sets of numbers that are connected in some way.

Linear sequence:

A number pattern which increases or decreases by the same amount each time is called a linear sequence. The amount it increases or decreases by is known as the common difference.

Quadratic sequence:

In quadratic sequence, the difference between each term increases, or decreases, at a constant rate.

Cubic sequence:

Sequences where the 3rd difference are known as cubic sequence.

Sample Input:

[0,2,4,6,8,10]

[1,4,9,16,25]

[0,12,10,0,-12,-20]

[1,2,3,4,5]

Sample Output:

Linear Sequence

Quadratic Sequence

Cubic Sequence

Linear Sequence

Click me to see the sample solution

**106.** Write a Python program to test whether a given integer is pandigital number or not. Go to the editor

From Wikipedia,

In mathematics, a pandigital number is an integer that in a given base has among its significant digits each digit used in the base at least once.

For example,

1223334444555556666667777777888888889999999990 is a pandigital number in base 10.

The first few pandigital base 10 numbers are given by:

1023456789, 1023456798, 1023456879, 1023456897, 1023456978, 1023456987, 1023457689

Sample Input:

(1023456897)

(1023456798)

(1023457689)

(1023456789)

(102345679)

Sample Output:

True

True

True

True

False

Click me to see the sample solution

**107.** Write a Python program to check whether a given number is Oddish or Evenish. Go to the editor

A number is called "Oddish" if the sum of all of its digits is odd, and a number is called "Evenish" if the sum of all of its digits is even.

Sample Input:

(120)

(321)

(43)

(4433)

(373)

Sample Output:

Oddish

Evenish

Oddish

Evenish

Oddish

Click me to see the sample solution

**108.** Write a Python program that takes three integers and check whether the last digit of first number * the last digit of second number = the last digit of third number. Go to the editor

Sample Input:

(12, 22, 44)

(145, 122, 1010)

(0, 22, 40)

(1, 22, 40)

(145, 122, 101)

Sample Output:

True

True

True

False

False

Click me to see the sample solution

**109.** Write a Python program find the indices of all occurrences of a given item in a given list. Go to the editor

Sample Input:

([1,2,3,4,5,2], 2)

([3,1,2,3,4,5,6,3,3], 3)

([1,2,3,-4,5,2,-4], -4)

Sample Output:

[1, 5]

[0, 3, 7, 8]

[3, 6]

Click me to see the sample solution

**110.** Write a Python program to remove two duplicate numbers from a given number of list. Go to the editor

Sample Input:

([1,2,3,2,3,4,5])

([1,2,3,2,4,5])

([1,2,3,4,5])

Sample Output:

[1, 4, 5]

[1, 3, 4, 5]

[1, 2, 3, 4, 5]

Click me to see the sample solution

**111.** Write a Python program to check whether two given circles (given center (x,y) and radius) are intersecting. Return true for intersecting otherwise false. Go to the editor

Sample Input:

([1,2, 4], [1,2, 8])

([0,0, 2], [10,10, 5])

Sample Output:

True

False

Click me to see the sample solution

**112.** Write a Python program to compute the digit distance between two integers. Go to the editor

The digit distance between two numbers is the absolute value of the difference of those numbers.

For example, the distance between 3 and -3 on the number line given by the |3 - (-3) | = |3 + 3 | = 6 units

Digit distance of 123 and 256 is

Since |1 - 2| + |2 - 5| + |3 - 6| = 1 + 3 + 3 = 7

Sample Input:

(123, 256)

(23, 56)

(1, 2)

(24232, 45645)

Sample Output:

7

6

1

11

Click me to see the sample solution

**113.** Write a Python program to reverse all the words which have even length. Go to the editor

Sample Input:

("The quick brown fox jumps over the lazy dog")

("Python Exercises")

Sample Output:

The quick brown fox jumps revo the yzal dog

nohtyP Exercises

Click me to see the sample solution

**114.** Write a Python program to print letters from the English alphabet from a-z and A-Z. Go to the editor

Sample Input:

("Alphabet from a-z:")

("\nAlphabet from A-Z:")

Sample Output:

Alphabet from a-z:

a b c d e f g h i j k l m n o p q r s t u v w x y z

Alphabet from A-Z:

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Click me to see the sample solution

**115.** Write a Python program to generate and prints a list of numbers from 1 to 10. Go to the editor

Sample Input:

range(1,10)

Sample Output:

[1, 2, 3, 4, 5, 6, 7, 8, 9]

['1', '2', '3', '4', '5', '6', '7', '8', '9']

Click me to see the sample solution

**116.** Write a Python program to identify nonprime numbers between 1 to 100 (integers). Print the nonprime numbers. Go to the editor

Sample Input:

range(1, 101)

Sample Output:

Nonprime numbers between 1 to 100:

4

6

8

9

10

..

96

98

99

100

Click me to see the sample solution

**117.** Write a Python program to make a request to a web page, and test the status code, also display the html code of the specified web page. Go to the editor

Sample Output:

Web page status: <Response [200]>

HTML code of the above web page:

<!doctype html>

<html>

<head>

<title>Example Domain</title>

<meta charset="utf-8" />

<meta http-equiv="Content-type" content="text/html; charset=utf-8" />

<meta name="viewport" content="width=device-width, initial-scale=1" />

</head>

<body>

<div>

<h1>Example Domain</h1>

<p>This domain is for use in illustrative examples in documents. You may use this

domain in literature without prior coordination or asking for permission.</p>

<p><a href="https://www.iana.org/domains/example">More information...</a></p>

</div>

</body>

</html>

Click me to see the sample solution

**118.** In multiprocessing, processes are spawned by creating a Process object. Write a Python program to show the individual process IDs (parent process, process id etc.) involved. Go to the editor

Sample Output:

Main line

module name: __main__

parent process: 23967

process id: 27986

function f

module name: __main__

parent process: 27986

process id: 27987

hello bob

Click me to see the sample solution

**119.** Write a Python program to check if two given numbers are coprime or not. Return True if two numbers are coprime otherwise return false. Go to the editor

Sample Input:

(17, 13)

(17, 21)

(15, 21)

(25, 45)

Sample Output:

True

True

False

False

Click me to see the sample solution

**120.** Write a Python program to calculate Euclid's totient function of a given integer. Use a primitive method to calculate Euclid's totient function. Go to the editor

Sample Input:

(10)

(15)

(33)

Sample Output:

4

8

20

Click me to see the sample solution

Python Code Editor:

**More to Come !**

**Do not submit any solution of the above exercises at here, if you want to contribute go to the appropriate exercise page.**

Test your Python skills with w3resource's quiz

## Python: Tips of the Day

**Python: While-else construct**

i = 5 while i > 1: print("Whil-ing away!") i -= 1 if i == 3: break else: print("Finished up!")

**New Content published on w3resource:**- Scala Programming Exercises, Practice, Solution
- Python Itertools exercises
- Python Numpy exercises
- Python GeoPy Package exercises
- Python Pandas exercises
- Python nltk exercises
- Python BeautifulSoup exercises
- Form Template
- Composer - PHP Package Manager
- PHPUnit - PHP Testing
- Laravel - PHP Framework
- Angular - JavaScript Framework
- React - JavaScript Library
- Vue - JavaScript Framework
- Jest - JavaScript Testing Framework