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 on Trending Technologies
Technical articles with clear explanations and examples
Program to find length of longest possible stick in Python?
Suppose we have a list of integers representing sticks. Each element in the list represents a stick with two ends, where values are between 1 and 6. We can connect two sticks together if any of their ends are the same. The resulting stick's ends will be the leftover ends and its length is increased. We have to find the length of the longest stick possible. So, if the input is like sticks = [[2, 3], [2, 4], [3, 5], [6, 6]], then the output will be 3. We can connect [2, 3] and [2, 4] to get [3, ...
Read MoreProgram to find a matrix for each condominium's height is increased to the maximum possible height in Python?
Suppose we have a 2D matrix where matrix[r][c] represents the height of a condominium in a city. The west-east skyline is visible by taking the maximum of each row in the matrix, and the north-south skyline can be visible by taking the maximum of each column. We have to find a new matrix where each condominium's height is increased to the maximum possible height while keeping the same west-east and north-south skyline. Understanding the Problem Given a matrix like this: 2 3 4 5 6 7 8 9 10 ...
Read MoreProgram to find sum of concatenated pairs of all each element in a list in Python?
Given a list of numbers, we need to find the sum of all possible concatenated pairs. Each pair (i, j) where i and j are indices is considered different from pair (j, i). For example, with nums = [5, 3], we get concatenations: 55, 53, 35, 33, which sum to 176. Algorithm We use memoization to avoid recalculating concatenations for duplicate numbers ? def find_concatenated_sum(nums): memo = {} total_sum = 0 n = len(nums) ...
Read MoreProgram to find length of concatenated string of unique characters in Python?
Given a list of strings, we need to find the maximum length of a concatenated string formed by selecting a subsequence of words where each character appears only once in the final string. The problem requires us to explore all possible combinations of words and find the one with maximum length that contains only unique characters. Algorithm Approach We use a recursive backtracking approach: For each word, we have two choices: include it or exclude it We can only include a word if it has unique characters and doesn't create duplicates when combined with our ...
Read MoreProgram to find maximum number of courses we can take based on interval time in Python?
Suppose we have a list of intervals in the form [start, end], representing the start and end time of courses. We need to find the maximum number of courses we can take, assuming we can only take one course at a time and the start of a course must be after the end of the previous course. So, if the input is like times = [[3, 6], [6, 9], [7, 8], [9, 11]], then the output will be 3, as we can take courses [[3, 6], [7, 8], [9, 11]]. Algorithm To solve this, we will follow ...
Read MoreProgram to find number of boxes that form longest chain in Python?
Suppose we have a list of boxes, where each entry has two values [start, end] (start < end). We can join two boxes if the end of one is equal to the start of another. We have to find the length of the longest chain of boxes. So, if the input is like boxes = [[4, 5], [5, 6], [4, 8], [1, 2], [2, 4]], then the output will be 4, as we can form the chain: [1, 2] → [2, 4] → [4, 5] → [5, 6] Algorithm To solve this, we will follow these steps ...
Read MoreProgram to check whether first player win in candy remove game or not in Python?
Suppose we have a list of numbers called candies and someone is playing a game against their friend. In each round, a player can remove any two consecutive candies with the same value. Whoever cannot pick up any candies loses. If player1 starts first, we have to check whether player1 will win or not. So, if the input is like candies = [2, 2, 5], then the output will be True, as if player1 picks the consecutive 2s, then the other player cannot pick any candies and loses. Algorithm To solve this, we will follow these steps ...
Read MoreProgram to evaluate Boolean expression from a string in Python?
Boolean expressions in strings can be evaluated by parsing the tokens and using a stack to handle operator precedence and parentheses. This approach splits the expression into components and processes them systematically. Problem Statement Given a string containing a boolean expression with operators "and" and "or", we need to evaluate it and return the result. The expression may contain parentheses that should be evaluated first. For example, if the input is s = "T and (F or T)", the output should be True. Algorithm Approach The solution uses a stack-based approach to handle the expression ...
Read MoreProgram to find minimum bus fare for travelling all days in Python?
When traveling by bus on specific days, we need to find the minimum cost using three ticket types: 1-day pass ($2), 7-day pass ($7), and 30-day pass ($25). This is a classic dynamic programming problem where we optimize the cost for each day. Problem Understanding Given a list of travel days, we need to choose the best combination of tickets. For example, if we travel on days [1, 3, 5, 6, 28], buying a 7-day pass covers days 1-7, and a 1-day pass for day 28 gives us a total cost of $9. Algorithm Steps ...
Read MoreProgram to count number of swaps required to change one list to another in Python?
Suppose we have two lists of numbers L1 and L2, the length of each list is n and each value is unique to its list, and values are in range 1 to n. We need to find the minimum number of adjacent swaps required to transform L1 to L2. So, if the input is like L1 = [0, 1, 2, 3] and L2 = [2, 0, 1, 3], then the output will be 2. We can swap 1 and 2 to get [0, 2, 1, 3], then swap 0 and 2 to get [2, 0, 1, 3], which matches ...
Read More