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 105 of 377
Program to check whether given tree is symmetric tree or not in Python
A symmetric binary tree is one that looks identical to its mirror image. To check if a tree is symmetric, we need to verify that the left subtree is a mirror reflection of the right subtree. Symmetric Tree 1 2 2 3 4 4 ...
Read MoreProgram to check whether two trees can be formed by swapping nodes or not in Python
Binary trees can sometimes be transformed into each other by swapping left and right subtrees at any node. This problem checks whether two given trees can be made identical through such swapping operations. Algorithm Overview The solution uses level-order traversal (BFS) to compare both trees level by level. At each level, we check if the node values can match either in the same order or in reverse order (indicating a possible swap). Step-by-Step Approach Use two queues to store nodes from both trees level by level For ...
Read MoreProgram to check whether each node value except leaves is sum of its children value or not in Python
A binary tree has a special property when each internal node's value equals the sum of its children's values. We need to check if this property holds for all non-leaf nodes in the tree. In this problem, we traverse the tree recursively and verify that each internal node satisfies the sum condition. Algorithm Steps The solution uses a depth-first search (DFS) approach ? If the current node is null, return True (empty subtree is valid) If the current node is a leaf (no children), return True ...
Read MoreProgram to find three unique elements from list whose sum is closest to k Python
Given a list of numbers and a target value k, we need to find three unique elements whose sum is closest to k and return the absolute difference between their sum and k. For example, if nums = [2, 5, 25, 6] and k = 14, the triplet [2, 5, 6] gives us the sum 13, which is closest to 14 with an absolute difference of 1. Approach We'll use a two-pointer technique after sorting the array: Sort the input list to enable two-pointer traversal For each element as the first element of the triplet, ...
Read MoreProgram to check number of triplets from an array whose sum is less than target or not Python
Given a list of numbers and a target value, we need to find the count of triplets (i < j < k) where the sum nums[i] + nums[j] + nums[k] is less than the target. For example, with nums = [−2, 6, 4, 3, 8] and target = 12, we have 5 valid triplets: [−2, 6, 4], [−2, 6, 3], [−2, 4, 3], [−2, 4, 8], [−2, 3, 8]. Algorithm We use a three-pointer approach after sorting the array ? Sort the array to enable efficient two-pointer technique For each element at index i, use ...
Read MoreProgram to check we can find four elements whose sum is same as k or not in Python
Suppose we have a list of numbers called nums and a value k, we have to check whether there are four unique elements in the list that add up to k. So, if the input is like nums = [11, 4, 6, 10, 5, 1] and k = 25, then the output will be True, as we have [4, 6, 10, 5] whose sum is 25. Algorithm To solve this, we will follow these steps − Sort the list nums n := size of nums For i in range 0 to n − 4, do ...
Read MoreProgram to check whether one tree is subtree of other or not in Python
Suppose we have two binary trees. We have to check whether the second tree is a subtree of the first one or not. A subtree means that there exists a node in the main tree such that the subtree rooted at that node has the same structure and node values as the given target tree. So, if the input is like ? Main Tree: 6 4 10 ...
Read MoreProgram to find maximum sum of the subsequence, where difference of two values is same as their position difference in Python
Given a list of numbers, we need to find a subsequence where the difference between consecutive values equals the difference between their original indices. Our goal is to find the maximum sum of such a subsequence. For example, if we have nums = [6, 7, 9, 9, 8, 5], we can select subsequence [6, 7, 9] at indices [0, 1, 3]. The value differences are [1, 2] and index differences are also [1, 2], giving us a sum of 22. Algorithm The key insight is that for any valid subsequence, if we have values a and b ...
Read MoreProgram to check sublist sum is strictly greater than the total sum of given list Python
Suppose we have a list of numbers called nums, we have to check whether there is a sublist such that its sum is strictly greater than the total sum of the list. So, if the input is like nums = [1, −2, 3, 4], then the output will be True, as the sum of the list is 6 and the sum of the sublist [3, 4] is 7 which is strictly larger. Algorithm Approach To solve this, we will follow these steps − Calculate total sum of all elements in the list Use prefix sum ...
Read MoreProgram to find product of few numbers whose sum is given in Python
Suppose we have a number n, we have to find two or more numbers such that their sum is equal to n, and the product of these numbers is maximized. We need to find the maximum product. So, if the input is like n = 12, then the output will be 81, as 3 + 3 + 3 + 3 = 12 and 3 * 3 * 3 * 3 = 81. Algorithm To solve this, we will follow these steps ? Define a function dp() that takes parameter n If n is equal to ...
Read More