Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles by Arnab Chakraborty
Page 87 of 377
Domino Covering Board in Python
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 −Exampleclass ...
Read MoreProgram to find the index of first Recurring Character in the given string in Python
Suppose we have a string s, we have to find the index of the first recurring character in it. If we cannot find no recurring characters, then return -1.So, if the input is like "abcade", then the output will be 3, as 'a' is again present at index 3.To solve this, we will follow these steps −define a map charsfor i in range 0 to size of s, doif s[i] in chars, thenreturn iotherwise, chars[s[i]] := chars[s[i]] + 1return -1Let us see the following implementation to get better understanding −Examplefrom collections import defaultdict class Solution: def solve(self, s): ...
Read MorePattern After Double, Reverse, and Swap in Python
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 MoreProgram to count number of elements present in a set of elements with recursive indexing in Python
Suppose we have a list of numbers called A and another number k, we have to make a new set of possible elements {A[k], A[A[k]], A[A[A[k]]], ... } stopping before it's out of index. We have to find the size of this set, otherwise -1 when there is a cycle.So, if the input is like A = [1, 2, 3, 4, 5, 6, 7], k = 1, then the output will be 6 as A[1] = 2, A[2] = 3, A[3] = 4, A[4] = 5, A[5] = 6, A[6] = 7, So the set is {2, 3, 4, 5, ...
Read MoreRemove Substrings in One Iteration in python
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 −Exampleclass Solution: def solve(self, s): return s.replace("xz","").replace("y","") ob = Solution() print(ob.solve("xyxxzyyxxzx"))Input"xyxxzyyxxzx"Outputxxxx
Read MoreProgram to find duplicate elements and delete last occurrence of them in Python
Suppose we have a list of numbers A, we have to find all duplicate numbers and remove their last occurrences.So, if the input is like [10, 30, 40, 10, 30, 50], then the output will be [10, 30, 40, 50]To solve this, we will follow these steps −seen:= a new mapd:= a new mapfor i in range 0 to size of nums, doif nums[i] is not in d, thend[nums[i]]:= 1otherwise, d[nums[i]] := d[nums[i]] + 1i:= 0while i < size of nums, don:= d[nums[i]]if nums[i] is not in seen, thenseen[nums[i]]:= 1otherwise, seen[nums[i]] := seen[nums[i]] + 1if n is same as seen[nums[i]] ...
Read MoreProgram to find sum of digits until it is one digit number in Python
Suppose we have a positive number n, we will add all of its digits to get a new number. Now repeat this operation until it is less than 10.So, if the input is like 9625, then the output will be 4.To solve this, we will follow these steps −Define a method solve(), this will take nif n < 10, thenreturn ns := 0l := the floor of (log(n) base 10 + 1)while l > 0, dos := s + (n mod 10)n := quotient of n / 10l := l - 1return solve(s)Let us see the following implementation to get ...
Read MorePython finding programming question in a String
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 MoreProgram to count k length substring that occurs more than once in the given string in Python
Suppose we have a string s and a number k, we have to find the number of k-length substrings of s, that occur more than once in s.So, if the input is like s = "xxxyyy", k = 2, then the output will be 2To solve this, we will follow these steps −seen := a new listfor i in range 0 to size of s - k, dot := substring of s [from index i to i + k - 1]insert t at the end of seenmp := a map for all distinct element in seen and their occurrencesreturn sum ...
Read MoreFlip and Invert Matrix in Python
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 −Exampleclass Solution: def solve(self, mat): ...
Read More