Arnab Chakraborty

Arnab Chakraborty

3,768 Articles Published

Articles by Arnab Chakraborty

Page 26 of 377

Check if a string can become empty by recursively deleting a given sub-string in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 246 Views

Suppose, we are given two strings, str1 and str2. str2 is a substring of str1, and we can delete str2 from str1. It is possible, that the string str2 appears multiple times in str1. Our goal here is to find out if str1 becomes a null string if we keep removing str2 from str1 multiple times. If it is possible we return 1, otherwise 0.So, if the input is like str1 = "CCCPPPPPP", str2 = "CPP"; then the output will be true.To solve this, we will follow these steps −while size of str1 > 0, do −index := return the ...

Read More

Program to count number of unique paths that includes given edges in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 403 Views

Suppose we have a list of edges in the form (u, v) and these are representing a tree. For each edge we have to find the total number of unique paths that includes said edge, in the same order as given in the input.So, if the input is like edges = [[0, 1], [0, 2], [1, 3], [1, 4]]then the output will be [6, 4, 4, 4].To solve this, we will follow these steps −adj := adjacency list from given edgescount := an empty mapDefine a function dfs() . This will take x, parentcount[x] := 1for each nb in adj[x], ...

Read More

Check if Decimal representation of an Octal number is divisible by 7 in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 232 Views

Suppose we have one octal number. We have to check whether the decimal representation of the given octal number is divisible by 7 or not.So, if the input is like n = 61, then the output will be True as the decimal representation of 61 is 6*8 + 1 = 48 + 1 = 49 which is divisible by 7.So, if the input is like n = 61, then the output will be True as the decimal representation of 61 is 6*8 + 1 = 48 + 1 = 49 which is divisible by 7.To solve this, we will follow ...

Read More

Check if difference of areas of two squares is prime in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 325 Views

Suppose we have two numbers x and y. We have to check whether difference of their areas is prime or not.So, if the input is like x = 7, y = 6, then the output will be True as the difference of their square is 49 - 36 = 13 which is prime.To solve this, we will follow these steps −if (x + y) is prime number and (x - y) is 1, thenreturn Trueotherwise,return FalseLet us see the following implementation to get better understanding −Exampledef is_prime(num) :    if num

Read More

Check if a string contains a palindromic sub-string of even length in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 346 Views

Suppose, we are given a string that contains only lowercase letters. Our task is to find if there exists a substring in the given string that is a palindrome and is of even length. If found, we return 1 otherwise 0.So, if the input is like "afternoon", then the output will be true.To solve this, we will follow these steps −for initialize x := 0, when x < length of string - 1, increase x by 1, do −if string[x] is same as string[x + 1], then:return truereturn falseExample (C++)Let us see the following implementation to get better understanding −#include ...

Read More

Check if each internal node of a BST has exactly one child in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 354 Views

Suppose we have the preorder traversal of a binary search tree (BST). We have to check whether each internal node has only one child or not.So, if the input is like preorder = [22, 12, 13, 15, 14], then the output will be True as BST is like −To solve this, we can follow one efficient approach. As all decedents of a node is either smaller or larger, then we can we can follow these steps −Get the next preorder successor of the nodeGet the last preorder successor of the nodeNow when both the successors are less than or greater ...

Read More

Check if a string follows anbn pattern or not in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 370 Views

Suppose, we are given a string that is made of only two letters a and b. We have to find out if the string is of the form anbn, or in other words it contains n number of a's followed by n number of b's. If true, we return 1 otherwise 0.So, if the input is like "aaaaaaaaaaaabbbbbbbbbbbb", then the output will be true.To solve this, we will follow these steps −length := length of input_stringfor initialize i := 0, when i < length, update (increase i by 1), do &minusif input_string[i] is not equal to 'a', then −Come out ...

Read More

Program to check regular expression pattern is matching with string or not in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 639 Views

Suppose we have a string s and a regular expression pattern. We have to check whether the given pattern matches with given string or not. In the regular expression, there are few rules −. (period) which matches any single character* (asterisk) which matches zero or more of the preceding element.So, if the input is like pattern = "h.l*o" s = "hello", then the output will be True, as We have ra and then a single characterTo solve this, we will follow these steps −n := size of sm := size of pDefine a function dp() . This will take i, ...

Read More

Program to find number of operations required to remove palindromic sublists in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 310 Views

Suppose we have a list of numbers called nums. Now let us consider an operation where we delete some sublist which is a palindrome. We have to find the minimum number of operations required such that the list is empty.So, if the input is like nums = [6, 2, 4, 4, 2, 10, 6], then the output will be 2, as we can remove the sublist [2, 4, 4, 2] first then the list is like [6, 10, 6] this is also a palindrome, so remove it to make list empty.To solve this, we will follow these steps −Define an ...

Read More

Check if a string is Pangrammatic Lipogram in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 327 Views

Suppose, we have been provided with three strings and we are asked to find which of the strings are a Pangram, Lipogram, and a Pangrammatic Lipogram. A Pangram is a string or a sentence, where every letter in the alphabet appears at least once. A Lipogram is a string or a sentence where one or more letters in the alphabet do not appear. A Pangrammatic Lipogram is a string or sentence where all letters in the alphabet appear except one.So, if the input is like −pack my box with five dozen liquor jugs to stay in this mortal world or ...

Read More
Showing 251–260 of 3,768 articles
« Prev 1 24 25 26 27 28 377 Next »
Advertisements