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
Server Side Programming Articles
Page 509 of 2109
Program 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 MoreProgram to find smallest intersecting element of each row in a matrix in Python
Suppose we have a 2D matrix where each row is sorted in ascending order. We have to find the smallest number that exists in every row. If there's no such result, then return −1. So, if the input is like ? 2 3 5 5 10 10 1 3 5 then the output will be 5 because it's the smallest element present in all three rows. Algorithm To solve this, we will follow these steps ? If matrix is empty, then return −1 ...
Read MoreProgram to split a set into equal sum sets where elements in first set are smaller than second in Python
We need to split a list of numbers into two groups A and B such that they have equal sums, and every number in A is strictly smaller than every number in B. For example, with nums = [3, 4, 5, 12], we can split into A = [3, 4, 5] and B = [12], both having sum 12. Algorithm The key insight is that after sorting, we need to find a split point where: All elements before the split form group A All elements from the split onwards form group B Both groups have ...
Read MoreProgram to count total number of set bits of all numbers in range 0 to n in Python
Suppose we have a number n. For each number i in the range 0 ≤ i ≤ n, we need to count the number of set bits (1's) in their binary representation and return the total count. For example, if n = 5, the numbers are [0, 1, 2, 3, 4, 5] with binary representations [0, 1, 10, 11, 100, 101]. The count of 1's are [0, 1, 1, 2, 1, 2], so the total is 7. Approach We use dynamic programming with bit manipulation. The key insight is that for any number i, if i & (i-1) ...
Read MoreProgram to count minimum number of animals which have no predator in Python
Suppose we have a list of numbers called nums where nums[i] shows the predator of the ith animal and if there is no predator, it will hold −1. We have to find the smallest number of groups of animals such that no animal is in the same group with its direct or indirect predator. So, if the input is like nums = [1, 2, −1, 4, 5, −1], then the output will be 3, as we can have the groups like: [0, 3], [1, 4], [2, 5]. Approach To solve this, we will follow these steps − ...
Read More