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
Programming Articles
Page 478 of 2547
Program to Find Out if an Edge is a Part of a Minimum Spanning Tree in Python
Suppose we have a 2D matrix named edges, that represents an undirected graph. Every item in the matrix edges represents an edge and is of the form (u, v, w). This means nodes u and v are connected and the edge has the weight w. We also have integers a and b, that represent an edge (a, b). We have to find out if the edge (a, b) is part of a minimum spanning tree. Note − the graph has to be connected and the edge (a, b) exists in the graph. So, if the input is like ...
Read MoreProgram to Find Out the Minimal Submatrices in Python
Suppose we have a 2D matrix and another value k. Our goal is to return a matrix that contains the minimum values of all k x k sub-matrices. So, if the input is like ? 3 5 6 8 6 5 ...
Read MoreProgram to find sum of widths of all subsequences of list of numbers in Python
Given a list of numbers, we need to find the sum of widths of all subsequences. The width of a subsequence is the difference between its maximum and minimum elements. We'll calculate this sum modulo 10^9 + 7 to handle large results. So, if the input is like nums = [7, 4, 9], then the output will be 15. The subsequences are: [7], [4], [9], [7, 4], [7, 9], [4, 9], [7, 4, 9] with widths 0, 0, 0, 3, 2, 5, 5 respectively, giving us a sum of 15. Algorithm To solve this efficiently, we follow ...
Read MoreProgram to find number of sublists containing maximum and minimum after deleting only one element in Python
Given a list of numbers, we can delete at most one element to maximize the number of sublists containing both the maximum and minimum values of the resulting list. This problem requires analyzing different scenarios when removing elements. Problem Understanding For the input nums = [3, 2, 6, 2, 4, 10], if we remove 10, we get [3, 2, 6, 2, 4] where min=2 and max=6. There are 8 sublists containing both values ? [2, 6] at indices (1, 2) [6, 2] at indices (2, 3) [2, 6, 2] at indices (1, 3) [3, 2, 6] ...
Read MoreProgram to find size of sublist where product of minimum of A and size of A is maximized in Python
Given a list of numbers called nums and an index pos, we need to find a sublist that includes the element at index pos such that (minimum of sublist) × (size of sublist) is maximized. For example, if nums = [-2, 2, 5, 4] and pos = 3, the best sublist is [5, 4] (indices 2-3). The minimum is 4, size is 2, so the product is 4 × 2 = 8. Algorithm We use a greedy approach to expand the sublist from the given position ? Start with the element at pos as both ...
Read MoreProgram to expand string represented as n(t) format in Python
String expansion in the n(t) format is a common programming problem where we need to decode compressed strings. The format n(t) means concatenate string t exactly n times, and t can be either a regular string or another encoded string recursively. So, if the input is like s = "3(pi)2(3(am))0(f)1(u)", then the output will be "pipipiamamamamamamu". Algorithm Steps To solve this problem, we will follow these steps − Initialize index i := 0 Define a recursive function parse() that processes the string Create an empty result list While i < string length and current character ...
Read MoreProgram to find minimum cost to increase heights of trees where no adjacent tree has same height in Python
Suppose we have a list of numbers called heights that represents the height of trees and we have another list of values called costs that represents the price needed to increase height of a tree by one. We have to find the smallest cost to make each height in the heights list different from adjacent heights. So, if the input is like heights = [3, 2, 2] costs = [2, 5, 3], then the output will be 3, as we can increase the last height by 1, which costs 3. Algorithm Steps To solve this, we will ...
Read MoreProgram to find maximum value of k for which we can maintain safe distance in Python
Suppose we have a binary matrix where 0 signifies an empty cell, and 1 signifies a cell with a person. The distance between two cells is the maximum value between the difference in x coordinates and the difference in y coordinates (Chebyshev distance). A matrix is considered safe with a factor k if there is an empty square such that the distance from the cell to each person in the matrix, and each side of the matrix is all greater or equal to k. We have to find the maximum value of factor k for which we can be safe. ...
Read MoreProgram to find size of smallest sublist whose sum at least target in Python
Suppose we have a list of numbers called nums, and another input called target, we have to find the size of the shortest sublist such that its sum value is same as target or larger. If there is no such sublist then return -1. So, if the input is like nums = [2, 11, -4, 17, 4] target = 19, then the output will be 2, as we can select [17, 4] to get sum of at least 19. Algorithm Approach To solve this, we will follow these steps − Create ...
Read MoreProgram to find length of shortest supersequence in Python
A supersequence is a string that contains both input strings as subsequences. The shortest supersequence problem finds the minimum length string that includes all characters from both strings while preserving their order. For example, if s = "pipe" and t = "people", then "pieople" is a supersequence with length 7. Algorithm Approach The solution uses dynamic programming to find the Longest Common Subsequence (LCS), then calculates the shortest supersequence length using the formula: Shortest Supersequence Length = len(s) + len(t) - LCS_length Step-by-Step Process Create a 2D table to store LCS lengths Fill ...
Read More