Programming Articles - Page 1695 of 3366

Suppose we have a Unix path, in a list of strings, we have to find its resolved version. As we know in Unix, ".." denotes the previous directory and "." denotes stay on the current directory. Here resolving indicates evaluation of the two symbols so that we get the final directory we're currently in.So, if the input is like path = ["usr", "..", "usr", ".", "local", "etc", "foo"], then the output will be ['usr', 'local', 'etc', 'foo'], as the part represents "/usr/../usr/./local/etc" which resolves to "/usr/local/etc/foo"To solve this, we will follow these steps −s := a new listfor each element ... Read More

Suppose we have a list of sorted numbers called nums we have to find the number of unique elements in the list.So, if the input is like nums = [3, 3, 3, 4, 5, 7, 7], then the output will be 4, as The unique numbers are [3, 4, 5, 7]To solve this, we will follow these steps −s:= a new setcnt:= 0for each i in nums, doif i is not in s, theninsert i into scnt := cnt + 1return cntLet us see the following implementation to get better understanding −Example Live Democlass Solution:    def solve(self, nums):     ... Read More

Suppose we have a string s with only "a" and "b". "a"s can stay "a" or turn into "b", but "b"s can not be changed. We have to find the number of unique strings that we can make.So, if the input is like s = "baab", then the output will be 4, as We can make these strings − ["baab", "babb", "bbab", "bbbb"]To solve this, we will follow these steps −counts := frequency of 'a' in sreturn 2^countsLet us see the following implementation to get better understanding −Example Live Democlass Solution:    def solve(self, s):       counts = s.count('a') ... Read More

Suppose we have a number n, we have to check whether its prime factors only include 2, 3 or 5 or not.So, if the input is like n = 18, then the output will be True, as 18's prime factors are 2 and 3.To solve this, we will follow these steps −if n < 0, thenreturn Falsefactor := a list with elements [2, 3, 5]for each i in factor, dowhile n mod i is same as 0, don := n / ireturn true when n is same as 1, otherwise falseLet us see the following implementation to get better understanding ... Read More

Suppose we have a number n, we have to find a string of stairs with n steps. Here each line in the string is separated by a newline separator.So, if the input is like n = 5, then the output will be         *       ** *** **** *****To solve this, we will follow these steps −s := blank stringfor i in range 0 to n-1, dos := s concatenate (n-i-1) number of blank space concatenate ... Read More

Suppose we have a matrix M, we have to check whether it is a Toeplitz matrix or not. As we know a matrix is said to be Toeplitz when every diagonal descending from left to right has the same value.So, if the input is like726372537then the output will be True.To solve this, we will follow these steps −for each row i except the last one, dofor each column except the last one, doif matrix[i, j] is not same as matrix[i+1, j+1], thenreturn Falsereturn TrueLet us see the following implementation to get better understanding −Example Live Democlass Solution:    def solve(self, matrix): ... Read More

Suppose we have three numbers, x, y, and z, we have to find their product, but if any two numbers are equal, they do not count.So, if the input is like x = 5, y = 4, z = 2, then the output will be 40, as all three numbers are distinct so their product is 5 * 4 * 2 = 40To solve this, we will follow these steps −temp_set := a new setremove := a new setfor each i in [x, y, z], doif i is in temp_set, theninsert i into the set called removeinsert i in to ... Read More

Suppose we have a string s that represents characters that typed into an editor, the symbol "

Suppose we have a list of tasks and another list of people. The tasks[i] determines the amount of strength required to perform the ith task. And the people[i] determines the amount of strength the ith person has. Finally, we have to find the number of tasks that can be finished if one person can perform at most one task.So, if the input is like tasks = [4, 3, 9, 15], people = [10, 5, 3, 2], then the output will be 3, as the first person can perform task 9, second person can perform task 4, third person can perform ... Read More

Suppose we have a number start and another number end (start < end), we have to find the minimum number of operations required to convert start to end using these operations −Increment by 1Multiply by 2So, if the input is like start = 5, end = 11, then the output will be 2, as we can multiply 2 to get 10, then add 1 to get 11.To solve this, we will follow these steps −ct:= 0while end/2 >= start, doif end mod 2 is same as 1, thenend := end - 1end := end/2ct := ct + 2otherwise, end:= end/2ct ... Read More