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 65 of 377
One Edit Distance in C++
Suppose we have two strings s and t; we have to check whether they are both one edit distance apart. The one edit distance has three types −Insert a character into s to get tDelete a character from s to get tReplace a character of s to get tSo, if the input is like s = "ab", t = "acb", then the output will be TrueTo solve this, we will follow these steps −n := size of s, m := size of tif n < m, then −return isOneEditDistance(t, s)for initialize i := 0, when i < m, update (increase ...
Read MoreProgram to pack same consecutive elements into sublist in Python
Suppose we have a list of numbers nums, we will pack consecutive elements of the same value into sublists. We have to keep in mind that there is only one occurrence in the list it should still be in its own sublist.So, if the input is like nums = [5, 5, 2, 7, 7, 7, 2, 2, 2, 2], then the output will be [[5, 5], [2], [7, 7, 7], [2, 2, 2, 2]]To solve this, we will follow these steps −if nums is empty, thenreturn a new listresult := a list with another list that contains nums[0]j := 0for ...
Read MoreMissing Ranges in C++
Suppose we have a sorted integer array nums, the range of elements are in the inclusive range [lower, upper], we have to find the missing ranges.So, if the input is like nums = [0, 1, 3, 50, 75], and lower value is 0 and upper value is 99, then the output will be ["2", "4->49", "51->74", "76->99"]To solve this, we will follow these steps −Define an array numsDefine one set vfor initialize i := 0, when i < size of t, update (increase i by 1), do −if t[i] is not in v, then −insert t[i] into vinsert t[i] at ...
Read MoreProgram to check we can update a list index by its current sum to reach target or not in python
Suppose we have a list of numbers called target. Now let us consider a list X with the same length as given list and X is filled with 1s. We can perform the following operation as many times as we want: Take any index i in X and set X[i] to the current sum of X. Finally check whether X can be turned into target or not.So, if the input is like target = [5, 9, 3], then the output will be True as initially X = [1, 1, 1], then update it with total sum 3, array will be ...
Read MoreProgram to fill with color using floodfill operation in Python
Suppose we have a 2D grid, containing colors as strings "r", "g", and "b". We have to perform floodfill operation at row r, column c with the color target. As we know the Floodfill operation should replace all elements that are both connected to grid[r, c] (up/right/down/left) and have the same color as grid[r, c] with the same color as target.So, if the input is likeRRRRGBGBBthen the output will beGGGGGBGBBas the red cells connected to grid[0, 0] are replaced with green ("g").To solve this, we will follow these steps −define a new set seenoldcolor := matrix[r, c]Define a function dfs() ...
Read MoreProgram to evaluate ternary expression in C++
Suppose we have an expression that holds the ternary expression, we have to evaluate the result of the expression. It supports some values like T and F for True and False and “?” and “:” characters. There are some properties:The length of the given string must be less than or equal to 10000.The conditional expressions group right-to-left.The condition will always be either T or F. So the condition will never be a digit.The result of the expression will always evaluate to T or F.So for example, if the input is like “T ? T ? F : T : T”, ...
Read MoreProgram to count maximum number of distinct pairs whose differences are larger than target in Python
Suppose we have a list of numbers called nums and another value target. We have to find the maximum number of pairs where for each pair i < j, i and j are not in any other pair, and |nums[i] - nums[j]| >= target.So, if the input is like nums = [2, 4, 6, 10, 11], target = 5, then the output will be 2, as we can get pairs: (2, 6), (5, 10)To solve this, we will follow these steps −N := size of Asort the list Aans := 0j := N / 2for i in range 0 to ...
Read MoreShortest Word Distance II in C++
Suppose there is a class that receives a list of words in the constructor, there will be a method that takes two words word1 and word2 and find the shortest distance between these two words in the list. That method will be called repeatedly many times with different parameters.Let us assume that words = ["practice", "makes", "perfect", "skill", "makes"].So, if the input is like word1 = “skill”, word2 = “practice”, then the output will be 3To solve this, we will follow these steps −Define one map mThe initializer takes an array of wordsfor initialize i := 0, when i < ...
Read MoreProgram to reverse inner nodes of a linked list in python
Suppose we have linked list, we also have two values i and j, we have to reverse the linked list from i to jth nodes. And finally return the updated list.So, if the input is like [1, 2, 3, 4, 5, 6, 7, 8, 9] i = 2 j = 6, then the output will be [1, 2, 7, 6, 5, 4, 3, 8, 9, ]To solve this, we will follow these steps:prev_head := create a linked list node with value same as null and that points to nodeprev := prev_head, curr := nodeiterate through all values from 0 to ...
Read MoreProgram to reverse words separated by set of delimiters in python
Suppose we have a string and a set of delimiters, we have to reverse the words in the string while the relative ordering of the delimiters should not be changed.So, if the input is like s = "Computer/Network:Internet|tutorialspoint" delims = ["/", ":", '|'], then the output will be tutorialspoint/Internet:Network|ComputerTo solve this, we will follow these steps:words := a new listans := blank stringtemp := a map whereSeparate the words except the delimiter characters and insert them into words arrayseparate words when the character is in delimiter then add them into ans, otherwise read word from words array reversely and add ...
Read More