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
Python Articles
Page 343 of 855
Program to merge in between linked lists in Python
Suppose we have two linked lists L1 and L2 of length m and n respectively, we also have two positions a and b. We have to remove nodes from L1 from a-th node to b-th node and merge L2 in between. So, if the input is like L1 = [1, 5, 6, 7, 1, 6, 3, 9, 12] L2 = [5, 7, 1, 6] a = 3 b = 6, then the output will be [1, 5, 6, 5, 7, 1, 6, 9, 12] Algorithm To solve this, we will follow these steps − ...
Read MoreProgram to find out the number of people who get a food packet using Python
Suppose in a conference, there are two types of people. The first type prefers vegetarian lunch (denoted by 0), and the other type prefers non-vegetarian lunch (denoted by 1). There are limited food packets, and if vegetarians receive a non-vegetarian packet or vice versa, they will not take that packet and wait until they get their preferred one. We are given two arrays: one containing food packets and another containing the queue of people with their preferences. If a person does not receive their preferred packet, they re-enter the queue at the end. We need to find the number ...
Read MoreProgram to find ways to make a fair array in Python
Suppose we have an array called nums. We can select exactly one index and remove the element from that index. (The index of the elements may change after the removal). We can say an array is fair when the sum of the odd-indexed values equals the sum of the even-indexed values. We have to find the number of indices that we could select such that after the removal, nums is fair. Problem Understanding Let's understand with an example. If the input is nums = [5, 3, 7, 2], let's check each removal ? ...
Read MoreProgram to find smallest string with a given numeric value in Python
Given two values n and k, we need to find the lexicographically smallest string whose length is n and numeric value equals k. The numeric value of a lowercase character is its position in the alphabet (starting from 1), so 'a' = 1, 'b' = 2, and so on. The numeric value of a string is the sum of its characters' numeric values. For example, if n = 4 and k = 16, the output will be "aaam" because the numeric value is 1+1+1+13 = 16, and this is the smallest string with length 4 and value 16. ...
Read MoreProgram to find minimum operations to reduce X to zero in Python
We have an array called nums and a value x. In one operation, we can delete either the leftmost or rightmost element from the array and subtract its value from x. We need to find the minimum number of operations to reduce x to exactly 0. The key insight is to use prefix and suffix sums. We can precompute all possible left prefix sums, then iterate through right suffix sums to find the optimal combination. Algorithm Steps The approach involves these steps − Create a map of left prefix sums with their indices For each ...
Read MoreProgram to count minimum deletions needed to make character frequencies unique in Python
Given a string s, we need to make it "good" by ensuring no two different characters have the same frequency. A good string has unique frequencies for each character. We must find the minimum number of character deletions required. For example, if s = "ssstttuu", we have 3 's', 3 't', and 2 'u' characters. Since both 's' and 't' have frequency 3, we need to delete characters to make frequencies unique. Approach The strategy is to count character frequencies, sort them, and reduce duplicate frequencies by deleting characters − Count ...
Read MoreProgram to count sorted vowel strings in Python
Suppose we have a number n, we have to find the number of strings of size n that consist only of vowels (a, e, i, o, u) and they are lexicographically sorted. We can say that a string s is lexicographically sorted when for all valid index i, s[i] is the same as or comes before s[i+1] in the alphabet. So, if the input is like n = 2, then the output will be 15 because there are many strings like ["aa", "ae", "ai", "ao", "au", "ee", "ei", "eo", "eu", "ii", "io", "iu", "oo", "ou", "uu"]. Understanding the ...
Read MoreProgram to count substrings that differ by one character in Python
Suppose we have two strings s and t, we have to find the number of ways we can select a nonempty substring of s and replace one single character by another different character such that the resulting substring is one of the substring of t. We have to find the number of substrings that satisfy the condition above. So, if the input is like s = "sts" t = "tsts", then the output will be 6 because the following are the pairs of substrings from s and t that differ by 1 character − ...
Read MoreProgram to find path with minimum effort in Python
Finding the path with minimum effort involves navigating through a 2D matrix where we need to minimize the maximum absolute difference between consecutive cells. This problem is solved efficiently using Dijkstra's algorithm with a priority queue. Problem Understanding Given a 2D matrix heights of size m × n, we start at position (0, 0) and want to reach (m-1, n-1). We can move in four directions: up, down, left, or right. The effort of a path is defined as the maximum absolute difference between consecutive cells along that path. For example, with the matrix: 234 ...
Read MoreProgram to find best team with no conflicts in Python
Suppose we have two lists called scores and ages, where scores[i] and ages[i] represent the score and age of the ith player in a basketball game. We want to select the team with the highest overall score, where the team score is the total sum of scores of all selected players. However, we must avoid conflicts − a conflict exists if a younger player has a strictly higher score than an older player. So, if the input is like scores = [5, 7, 9, 14, 19], ages = [5, 6, 7, 8, 9], then the output will be 54 ...
Read More