Python Articles - Page 645 of 829

Suppose we have a number n, we have to generate a list of all prime numbers smaller than or equal to n in ascending order. We have to keep in mind that 1 is not a prime number.So, if the input is like 12, then the output will be [2, 3, 5, 7, 11].To solve this, we will follow these steps −sieve := a list of size n+1 and fill with Trueprimes := a new list, initially blankfor i in range 2 to n, doif sieve[i] is True, theninsert i at the end of primesfor j in range i to ... Read More

Suppose we have list of intervals and another input time. In each interval the structure is [start, end], this is representing the times when a programmer worked. We have to find the number of programmers that were working at time.So, if the input is like interval = [[2, 6], [4, 10], [5, 9], [11, 14]], time = 5, then the output will be 3 as at time 5, there are three programmers, working [2, 6], [4, 10], [5, 9]To solve this, we will follow these steps −count := 0for each interval in intervals, doif start of interval = time, thencount ... Read More

Suppose we have a list of words, we have to frame it in a rectangular region, line by line. See the example for better understanding.So, if the input is like ['hello', 'world', 'python', 'programming', 'nice'], then the output will be*************** * hello       * * world       * * python      * * programming * * nice        * ***************To solve this, we will follow these steps −l:= length of maximum size word in the arrayst:= put star (l+4) timesfor each i in words, dost := st concatenate '*' concatenate i then add ... Read More

Suppose we have a binary matrix mat. We have to select each row in matrix, then reverse the row. After that, flip each bit (0 to 1 and 1 to 0).So, if the input is like110010001then the output will be100101011To solve this, we will follow these steps −track:= 0for each row in mat, doreverse the rowtracker := 0for each val in row, doif val is 1, thenmat[track, tracker] := 0otherwise, mat[track, tracker] := 1tracker := tracker + 1track := track + 1return matLet us see the following implementation to get better understanding −Example Live Democlass Solution:    def solve(self, mat):   ... Read More

Suppose we have a lowercase string s, we have to check whether it's possible to pick some subsequence of characters in s such that − 1. The difference of any two successive indexes of the characters is same 2. The characters form the string "programmingquestion"So, if the input is like "pzrzozgzrzazmzmziznzgzqzuzezsztzizozn", then the output will be TrueTo solve this, we will follow these steps −p := An array of indices where p is presentr := An array of indices where r is presentfor each j in p, dofor each k in r, doif k > j, thenif "programmingquestion" in substring ... Read More

Suppose we have a string s, we have to remove all “y” and “xz” in the string in one iteration.So, if the input is like s = "xyxxzyyxxzx", then the output will be xxxxTo solve this, we will follow these steps −To solve this, we will follow these steps −temp := string after removing xzreturn temp after removing yLet us see the following implementation to get better understanding −Example Live Democlass Solution:    def solve(self, s):       return s.replace("xz","").replace("y","") ob = Solution() print(ob.solve("xyxxzyyxxzx"))Input"xyxxzyyxxzx"Outputxxxx

Suppose we have a number n, we have ot find the nth value from the sequence. The sequence is like below −xxyxxyxxyyxxyxxxyyxyyxyyxyyxyyxyy...To generate the next value, we have to follow these rules, starting with xxy as the first term −When we are at the start of the pattern, double it(concatenate the string with itself).When the last operation was doubling, reverse it.When the last operation was reversing, exchange all xs with ys and vice versa.Repeat these steps.So, if the input is like n = 5, then the output will be "yyxyyxyyxyyx"To solve this, we will follow these steps −i := 0ret ... Read More

Suppose we have two numbers n and m representing a board of size n x m. We also have an unlimited number of 1 x 2 dominos. We have to find the maximum number of dominos that can be placed on the board such that they don't overlap and every domino lies completely within the board.So, if the input is like n = 5, m = 3, then the output will be 7To solve this, we will follow these steps −t := n * mreturn quotient of (t / 2)Let us see the following implementation to get better understanding −Example Live ... Read More

Suppose we have a list of votes, where each element in the list has two elements [c_id, v_id], the c_id is the candidate id and v_id is the voter id. We have to check whether any voter has voted more than once or not.So, if the input is like [[5, 1], [5, 0], [5, 4], [5, 3], [5, 0]], then the output will be True as [5, 0] is present twiceTo solve this, we will follow these steps −make a new set named allfor each vote in votes, doinsert (vote[1]) into allreturn true when size of all is not same ... Read More

Suppose we have a string called animals and another string called dinosaurs. Every letter in animals represents a different type of animal and every unique character in dinosaurs string represents a different dinosaur. We have to find the total number of dinosaurs in animals.So, if the input is like animals = "xyxzxyZ" dinosaurs = "yZ", then the output will be 3, as there are two types of dinosaurs y and Z, in the animal string there are two y type animal and one Z type animal.To solve this, we will follow these steps −res := 0dinosaurs := a new set ... Read More