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 516 of 2109
Program to find k-sized list where difference between largest and smallest item is minimum in Python
Given a list of numbers and an integer k, we need to select k elements to create a sublist where the difference between the largest and smallest elements is minimized. This problem requires finding the optimal contiguous subsequence after sorting. For example, if nums = [3, 11, 6, 2, 9] and k = 3, the output will be 4 because the best sublist we can make is [2, 3, 6] with difference 6 - 2 = 4. Algorithm To solve this problem, we follow these steps: Sort the input list to group similar numbers together ...
Read MoreProgram to find the largest grouping of anagrams from a word list in Python
Suppose we have a list of strings words, we have to group all anagrams together and return the size of the largest grouping. Anagrams are words formed by rearranging the letters of another word, like "xyz" and "zyx". So, if the input is like words = ["xy", "yx", "xyz", "zyx", "yzx", "wwwww"], then the output will be 3, as ["xyz", "zyx", "yzx"] is the largest grouping. Algorithm To solve this, we will follow these steps − Create a dictionary to store anagram groups Initialize result as 0 For each ...
Read MoreProgram to find minimum required chances to form a string with K unique characters in Python
Suppose we have a string s of lowercase alphabet characters, and another number k. We need to find the minimum number of required changes in the string so that the resulting string has at most k distinct characters. A change means modifying a single character to any other character. So, if the input is like s = "wxxyyzzxx", k = 3, then the output will be 1, as we can change the letter "w" to get 3 distinct characters (x, y, and z). Approach To solve this problem, we will follow these steps − count ...
Read MoreProgram to find the K-th last node of a linked list in Python
Suppose we have a singly linked list, we have to find the value of the k-th last node (0-indexed) in a single pass. This is a classic two-pointer technique problem. So, if the input is like node = [5, 4, 6, 3, 4, 7], k = 2, then the output will be 3, as the second last (index 3) node has the value of 3. Algorithm To solve this, we will follow these steps − Initialize two pointers: klast and last, both pointing to the head Move the last pointer k steps ahead Move both ...
Read MoreProgram to find maximum sum of popped k elements from a list of stacks in Python
This problem involves finding the maximum sum by popping exactly k elements from a list of stacks. We can only pop elements from the top of each stack, making this a dynamic programming problem where we explore different combinations of popping elements. The key insight is that for each stack, we can choose to pop 0, 1, 2, ... up to all elements from that stack, and recursively solve for the remaining stacks with the remaining number of elements to pop. Algorithm Approach We use a recursive function that takes the current stack index and the number ...
Read MoreProgram to find a list of numbers where each K-sized window has unique elements in Python
Given a list of numbers and a window size k, we need to find the count of distinct numbers in each sliding window of size k. This is a common sliding window problem that can be efficiently solved using a dictionary to track element frequencies. So, if the input is like nums = [2, 2, 3, 3, 4], k = 2, then the output will be [1, 2, 1, 2], as the windows are [2, 2], [2, 3], [3, 3], and [3, 4]. Algorithm To solve this, we will follow these steps − ...
Read MoreProgram to find the perimeter of an island shape in Python
Finding the perimeter of an island shape in a binary matrix involves counting the exposed edges of all connected 1s. Each cell with value 1 contributes to the perimeter based on how many of its four sides are exposed (not adjacent to another 1). Problem Understanding Given a binary matrix where 0 represents empty cells and 1 represents land blocks, we need to calculate the total perimeter. Each land block initially has 4 sides, but we subtract 1 for each adjacent land block. For the input matrix: 00000 00111 00110 ...
Read MoreProgram to interleave list elements from two linked lists in Python
Suppose we have two linked lists l1 and l2, we have to return one linked list by interleaving elements of these two lists starting with l1. If there are any leftover nodes in a linked list, they should be appended to the result. So, if the input is like l1 = [5, 4, 6, 3, 4, 7] l2 = [8, 6, 9], then the output will be [5, 8, 4, 6, 6, 9, 3, 4, 7] Algorithm To solve this, we will follow these steps − ans := l1 ...
Read MoreProgram to count n digit integers where digits are strictly increasing in Python
Suppose we have a number n, we have to find the number of n-digit positive integers such that the digits are in strictly increasing order. So, if the input is like n = 3, then the output will be 84, as numbers are 123, 124, 125, ..., 678, 789. Understanding the Problem For n-digit numbers with strictly increasing digits, we need to choose n different digits from {1, 2, 3, ..., 9}. We cannot use 0 as the first digit in an n-digit number. This becomes a combination problem: C(9, n). Algorithm To solve this, ...
Read MoreProgram to find minimum number of heights to be increased to reach destination in Python
Sometimes we need to find the minimum height increase required to reach from the top-left corner to the bottom-right corner of a matrix. We can only move to adjacent cells if their height is less than or equal to our current cell's height, but we can increase any cell's height before moving. Problem Understanding Given a matrix M where M[r][c] represents the height of that cell, we need to find the minimum total height increase to create a path from (0, 0) to (R-1, C-1). Movement is allowed to adjacent cells (up, down, left, right) only if the ...
Read More