Arnab Chakraborty

Arnab Chakraborty

3,768 Articles Published

Articles by Arnab Chakraborty

Page 20 of 377

Check if all elements of the array are palindrome or not in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 2K+ Views

Suppose we have a list of numbers nums. We have to check whether the list is palindrome or not.So, if the input is like nums = [10, 12, 15, 12, 10], then the output will be True.To solve this, we will follow these steps −n := size of numsreset is_palindromei := 0while i

Read More

Check if all enemies are killed with bombs placed in a matrix in Python

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

Suppose we have a matrix mat. There are few different values as follows The cells of matrix can hold any of these 3 characters0 for empty area.1 for bomb.2 for Enemies.Now bomb can blast in only horizontal and vertical directions from one end to another. We have to check whether all enemies will die when bomb explodes or not.So, if the input is like0020010002000010then the output will be True, because bomb at place [1, 1] can fill enemy at place [2, 1] and enemy at [0, 2] will be killed by bomb placed at [3, 2].To solve this, we will ...

Read More

Program to find length of longest substring which contains k distinct characters in Python

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

Suppose we have a number k and another string s, we have to find the size of the longest substring that contains at most k distinct characters.So, if the input is like k = 3 s = "kolkata", then the output will be 4, as there are two longest substrings with 3 distinct characters these are "kolk" and "kata", which have length 4.To solve this, we will follow these steps −ans := 0, left := 0table := a new mapfor right is in range 0 to size of s − 1, dotable[s[right]] := 1 + (s[right] if exists otherwise 0)if ...

Read More

Check if all occurrences of a character appear together in Python

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

Suppose we have a string s and another character c, we have to check whether all occurrences of c appear together in s or not. If the character c is not present in s then also return true.So, if the input is like s = "bbbbaaaaaaaccddd", c = 'a', then the output will be True.To solve this, we will follow these steps −flag := Falseindex := 0n := size of stringwhile index < n, doif string[index] is same as c, thenif flag is True, thenreturn Falsewhile index < n and string[index] is same as c, doindex := index + 1flag ...

Read More

Program to find length of longest sublist whose sum is 0 in Python

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

Suppose we have a list with only two values 1 and −1. We have to find the length of the longest sublist whose sum is 0.So, if the input is like nums = [1, 1, −1, 1, 1, −1, 1, −1, 1, −1], then the output will be 8, as the longest sublist is [−1, 1, 1, −1, 1, −1, 1, −1] whose sum is 0.To solve this, we will follow these steps −table := a new empty mapcs := 0, max_diff := 0for i in range 0 to size of nums − 1, docs := cs + nums[i]if cs ...

Read More

Program to find max values of sublists of size k in Python

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

Suppose we have a list nums and another value k, we have to find the maximum values of each sublist of size k.So, if the input is like nums = [12, 7, 3, 9, 10, 9] k = 3, then the output will be [12, 9, 10, 10]To solve this, we will follow these steps −if k > size of nums, thenreturn a blank listres := a new listtemp := nums[0]temp := npoint := 0for i in range 0 to k − 1, doif nums[i] > temp, thentemp := nums[i]point := iinsert temp at the end of resfor i in ...

Read More

Program to find maximum value by inserting operators in between numbers in Python

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

Suppose we have a list of numbers called nums, we have to find the maximal value that can be generated by adding any binary operators like +, −, and * between the given numbers as well as insert any valid brackets.So, if the input is like nums = [−6, −4, −10], then the output will be 100, as we can make the expression like: ((−6) + (−4)) * −10.To solve this, we will follow these steps −OPS := a list of operators [+, −, *]N := size of Aif all elements in A is 0, thenreturn 0Define a function dp() ...

Read More

Program to find out the efficient way to study in Python

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

Suppose, we have three lists whose lengths are same. These are deadlines, credits, and durations. They are representing course assignments. For the i−th assignment deadlines[i] shows its deadline, credits[i] shows its credit, and durations[i] shows the number of days it takes to finish the assignment. One assignment must be completed before starting another one. We have to keep in mind that we can complete an assignment on the day it's due and we are currently on the start of day 0.So, if the input is like, deadlines = [7, 5, 10], credits = [8, 7, 10], durations = [5, 4, ...

Read More

Program to Find Out the Best Interval to Remove in C++

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

Suppose we have a list of intervals (inclusive) that are potentially overlapping. Now consider there is an operation where we delete one interval, then merge the remaining intervals and then count the number of intervals left over. We have to find the maximum number of leftover intervals possible after removal.So, if the input is like intervals = [ [5, 8], [6, 7], [7, 10], [9, 11]], then the output will be 2. This is because −If we delete the interval [5, 8] we get [6, 11] as the merge.If we delete the interval [6, 7] we get [5, 11] as ...

Read More

Program to Connect a Forest in Python

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

Suppose we have graphs as an adjacency lists. This graph is actually a set of disjoint trees. We have to add a certain number of edges to the forest such that it becomes a single tree. We have to return the minimum distance possible of the longest path between any two nodes. So, if the input is likethen the output will be 4.We can add the edge 0 −> 5. Then, the longest path can be any of 3 −> 1 −> 0 −> 5 −> 7 or 4 −> 1 −> 0 −> 5 −> 7; and also these ...

Read More
Showing 191–200 of 3,768 articles
« Prev 1 18 19 20 21 22 377 Next »
Advertisements