Suppose we have a string s and width w. We have to wrap this text into a paragraph with width w. This can be done very easily with fill() function present inside textwrap library. So we have to import textwrap library first.So, if the input is like s = "The quick brown fox jumps over the lazy dog" w = 9, then the output will beThe quickbrown foxjumpsover thelazy dogTo solve this, we will follow these steps −take the string into stake width into wcall textwrap.fill(s, w) by passing s as the first argument, and w as the second argumentExampleLet ... Read More
Suppose we have a number n. We have to draw a diamond pattern with asterisks with 2n-1 lines. First 1 to n lines contain 1 to n number of asterisks, and next they are decreasing from n-1 to 1.So, if the input is like n = 5, then the output will be * * * * * * * * * * * * * * * * * * * * * * * * *To solve this, we will follow these steps −for i in range ... Read More
Suppose we have a string s. We have to check whether the string contains the following or not.NumbersLowercase lettersUppercase lettersNote − There may be some other symbols, but these three must be thereSo, if the input is like s = "p25KDs", then the output will be TrueTo solve this, we will follow these steps −arr := an array of size 3 and fill with Falsefor each character c in s, doif c is alphanumeric, thenarr[0] := Trueif c is in lowercase, thenarr[1] := Trueif c is in uppercase, thenarr[2] := Truereturn true when all items of arr are trueExampleLet us ... Read More
Suppose we have a string s and a substring t. We have to count how many times t occurs in s.So, if the input is like s = "abaabcaabababaab", t = "aab", then the output will be 3 because the substrings are ab(aab)c(aab)abab(aab).To solve this, we will follow these steps −cnt := 0for i in range 0 to (size of s - size of t), doif substring of s[from index i to i + size of t - 1] is same as t, thencnt := cnt + 1return cntExampleLet us see the following implementation to get better understandingdef solve(s, t): ... Read More
Suppose we have a string s, an index i and a character c. We have to replace the ith character of s using c. Now in Python, strings are immutable in nature. We cannot write a statement like s[i] = c, it will raise an error [TypeError: 'str' object does not support item assignment]So, if the input is like s = "python", i = 3, c = 'P', then the output will be "pytPon"To solve this, we will follow these steps −left := s[from index 0 to i]right := s[from index i+1 to end]return left concatenate c concatenate rightExampleLet us ... Read More
Suppose we have few words that are separated by spaces. We have to split these words to form a list, then join them into a string by placing comma in-between.So, if the input is like s = "Programming Python Language Easy Funny", then the output will be Programming, Python, Language, Easy, FunnyTo solve this, we will follow these steps −words := a list of words by applying split function on s with delimiter " " blank space.ret := join each items present in words and place ", " in between each pair of wordsreturn retExampleLet us see the following implementation ... Read More
Suppose we have a string with English letters. We have to swap the case of the letters. So uppercase will be converted to lower and lowercase converted to upper.So, if the input is like s = "PrograMMinG", then the output will be pROGRAmmINgTo solve this, we will follow these steps −ret := blank stringfor each letter in s, doif letter is in uppercase, thenret := ret concatenate lower case equivalent of letterotherwise, ret := ret concatenate upper case equivalent of letterreturn retExampleLet us see the following implementation to get better understandingdef solve(s): ret = '' ... Read More
Suppose we have a tuple. There are few numbers are present. We have to find the hash value of this tuple by using hash() function. This is a built-in function. The hash() function can work on some datatypes like int, float, string, tuples etc, but some types like lists are not hashable. As lists are mutable in nature, we cannot hash it. This hash value is used to map other values when we use dictionary.So, if the input is like t = (2, 4, 5, 6, 7, 8), then the output will be -1970127882925375109To solve this, we will follow these ... Read More
Suppose we have a list of numbers in Python. We have to reverse and sort the lists using list operations but do not change the actual list. To reverse the list we have reverse() function for lists but if we use it, the list will be reversed in place. Similar for the sort() also. To maintain actual order we will use the reversed() function and sorted() function.So, if the input is like l = [2, 5, 8, 6, 3, 4, 7, 9], then the output will be [9, 7, 4, 3, 6, 8, 5, 2] [2, 3, 4, 5, 6, ... Read More
Suppose we have a dictionary of students marks. The keys are names and the marks are list of numbers. We have to find the average of each students.So, if the input is like scores = {'Amal' : [25, 36, 47, 45], 'Bimal' : [85, 74, 69, 47], 'Tarun' : [65, 35, 87, 14], 'Akash' : [74, 12, 36, 75]}, then the output will be [38.25, 68.75, 50.25, 49.25] so 38.25 is average score for Amal, 68.75 is average score for Bimal and so on.To solve this, we will follow these steps −avg_scores := a new mapfor each name in scores ... Read More
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP