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
-
Economics & Finance
Articles by Arnab Chakraborty
Page 110 of 377
Program to convert one list identical to other with sublist sum operation in Python
Given two lists, we need to make them identical by repeatedly choosing a sublist and replacing it with its sum. The goal is to find the maximum possible length of the resulting identical lists, or return -1 if no solution exists. The key insight is to work backwards from the end of both lists, comparing elements and merging adjacent elements when needed. Algorithm Approach We use a greedy approach starting from the end of both lists ? Compare elements from the end of both lists If elements ...
Read MoreProgram to check minimum number of characters needed to make string palindrome in Python
A palindrome is a string that reads the same forwards and backwards. To make any string a palindrome, we need to find the minimum number of characters to insert. This can be solved using dynamic programming by comparing characters from both ends. Problem Statement Given a string, find the minimum number of characters needed to be inserted to make it a palindrome ? For example, if the input is s = "mad", we can insert "am" to get "madam", requiring 2 insertions. Algorithm The approach uses a recursive function dp(i, j) that compares characters at ...
Read MoreProgram to find sum of longest sum path from root to leaf of a binary tree in Python
Suppose we have a binary tree, we have to find the sum of the longest path from the root to a leaf node. If there are two same long paths, return the path with larger sum. So, if the input is like: 2 10 ...
Read MoreProgram to find the length of longest substring which has two distinct elements in Python
Suppose we have a string s, we have to find the length of the longest substring that contains at most 2 distinct characters. So, if the input is like s = "xyzzy", then the output will be 4, as "yzzy" is the longest substring with at most 2 unique characters. Algorithm To solve this problem, we will use the sliding window technique with the following steps ? Initialize start pointer to 0 Create a character frequency counter Initialize answer to 0 For each character at the end pointer: Add character to the counter While ...
Read MoreProgram to find length of longest sublist with given condition in Python
Suppose we have a list of numbers called nums. We need to find the length of the longest sublist where 2 * minimum of sublist > maximum of sublist. So, if the input is like nums = [10, 2, 6, 6, 4, 4], then the output will be 4, as the sublist [6, 6, 4, 4] is the longest sublist that satisfies the condition since 2 * 4 > 6. Algorithm We use a sliding window approach with two deques to efficiently track minimum and maximum values in the current window ? ...
Read MoreProgram to find length of longest alternating inequality elements sublist in Python
Given a list of numbers, we need to find the length of the longest sublist where the inequality relation between consecutive numbers alternates between less-than and greater-than operations. The first two numbers can start with either inequality relation. So, if the input is like nums = [1, 2, 6, 4, 5], then the output will be 4, as the longest alternating inequality sublist is [2, 6, 4, 5] where 2 < 6 > 4 < 5. Algorithm To solve this problem, we follow these steps ? Define a helper function get_direction() that returns the relationship ...
Read MoreProgram to find length of longest increasing subsequence in Python
The Longest Increasing Subsequence (LIS) problem asks us to find the length of the longest subsequence where elements are in increasing order. For example, in the array [6, 1, 7, 2, 8, 3, 4, 5], the LIS is [1, 2, 3, 4, 5] with length 5. We'll solve this using an efficient binary search approach with O(n log n) time complexity. Algorithm Steps The algorithm maintains a tails array where tails[i] stores the smallest ending element of all increasing subsequences of length i+1 ? Create a tails array of same size as input array, initialize ...
Read MoreProgram to find longest even value path of a binary tree in Python
A Binary tree is one of the data structures in Python in which each element is known as a Node. Each node should have a minimum of two child nodes. These children nodes are called as left child and the right child. The top node of the binary tree is known as the Root Node, and the nodes with no children are called Leaf Nodes. Following is the representation of the Binary Tree in Python − 10 / \ 5 ...
Read MoreProgram to partition color list in Python
Suppose we have a list of color strings containing "red", "green" and "blue". We need to partition the list so that red comes before green, and green comes before blue. So, if the input is like colors = ["blue", "green", "blue", "red", "red"], then the output will be ['red', 'red', 'green', 'blue', 'blue']. Algorithm To solve this, we will follow these steps − Initialize three pointers: red = 0, green = 0, blue = 0 For each string in the list: ...
Read MoreProgram to create linked list to binary search tree in Python
A Binary Search Tree (BST) is a tree data structure where each node has at most two children, and for every node, the left subtree contains values smaller than the node, and the right subtree contains values greater than the node. Converting a sorted linked list to a BST involves finding the middle element as the root and recursively building left and right subtrees. Algorithm The key insight is to use the two-pointer technique to find the middle node of the linked list ? Find the middle node using slow and fast pointers Make the middle ...
Read More