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 495 of 2547
Program to find number of items left after selling n items in python
Suppose we have a list of numbers called items and another value n. A salesman has items in a bag with random IDs. The salesman can remove as many as n items from the bag. We have to find the minimum number of different IDs remaining in the bag after n removals. The strategy is to remove items with the lowest frequencies first, as this minimizes the number of different IDs left. Example If the input is like items = [2, 2, 6, 6] and n = 2, then the output will be 1. We can sell ...
Read MoreProgram to check whether leaves sequences are same of two leaves or not in python
In this problem, we need to check whether two binary trees have the same sequence of leaf nodes when read from left to right. A leaf node is a node that has no left or right children. So, if the input trees are: Tree 1 1 3 2 6 ...
Read MoreProgram to reverse words separated by set of delimiters in python
Sometimes we need to reverse words in a string while keeping delimiters in their original positions. This is useful when processing formatted text where the structure must be preserved but the word order needs to be reversed. So, if the input is like s = "Computer/Network:Internet|tutorialspoint" with delimiters ["/", ":", "|"], then the output will be tutorialspoint/Internet:Network|Computer. Algorithm To solve this problem, we follow these steps ? Extract all words (non-delimiter characters) and store them in a list Iterate through the original string character by character If the character is a delimiter, add it directly ...
Read MoreProgram to reverse inner nodes of a linked list in python
Given a linked list and two positions i and j, we need to reverse the nodes from position i to position j (0-indexed). The rest of the nodes remain in their original positions. For example, if we have a linked list [1, 2, 3, 4, 5, 6, 7, 8, 9] with i = 2 and j = 6, the output will be [1, 2, 7, 6, 5, 4, 3, 8, 9]. Algorithm To solve this problem, we follow these steps: Create a dummy head node pointing to the original head Traverse to find the node ...
Read MoreProgram to evaluate ternary expression in C++
Looking at this article, I can see it's about C++ but labeled as Python. I'll improve the structure, fix the HTML issues, and make it clearer while keeping the C++ content intact. A ternary expression uses the format condition ? value1 : value2. Given a string representing nested ternary expressions with 'T' (True) and 'F' (False), we need to evaluate the final result. Problem Constraints String length ≤ 10000 Conditional expressions group right-to-left Conditions are always 'T' or 'F', never digits Final result is always 'T' or 'F' For example, "T?T?F:T:T" evaluates to "F". ...
Read MoreProgram to check we can update a list index by its current sum to reach target or not in python
Suppose we have a list of numbers called target. We start with a list X of the same length filled with 1s. We can perform the following operation repeatedly: select any index i in X and set X[i] to the current sum of all elements in X. The goal is to check whether X can be transformed into the target list. For example, if target = [5, 9, 3], we start with X = [1, 1, 1] (sum = 3). Update index 2: X = [1, 1, 3] (sum = 5). Update index 0: X = [5, 1, 3] ...
Read MoreProgram to convert gray code for a given number in python
Gray code is a binary numeral system where consecutive numbers differ by exactly one bit. For example, the gray code sequence starts as: 000, 001, 011, 010, 110, 111, 101, 100. Given a number n, we need to find the nth gray code in decimal representation. The key insight is that gray codes follow a recursive pattern where we can find the nth gray code by determining the highest power of 2 less than or equal to n, then recursively solving for the remaining part. Algorithm Steps To convert a number to its corresponding gray code position: ...
Read MoreProgram to recover shuffled queue of people in python
Suppose we have a 2D matrix where each row contains two values [height, count] that indicates a person has given height and there are 'count' number of people in front of them that are at least as tall as them. When this queue is shuffled, we need to recover the original ordering. Problem Understanding Given a shuffled queue representation, we need to reconstruct the original queue order. Each person is represented as [height, count] where count is the number of people in front who are taller or equal in height. Example Input and Output Input ...
Read MoreProgram to find number of distinct quadruple that forms target sum in python
Finding distinct quadruples from four arrays that sum to a target value is a common algorithmic problem. We can solve this efficiently using a hash map to store intermediate sums and reduce the time complexity from O(n⁴) to O(n²). Problem Understanding Given four arrays A, B, C, D and a target sum, we need to find the count of distinct quadruples (i, j, k, l) where A[i] + B[j] + C[k] + D[l] equals the target. For example, with A = [5, 4, 3], B = [8, 4], C = [6, 2], D = [4, 10], target ...
Read MoreProgram to find state of prison cells after k days in python
We need to simulate the state of prison cells after k days. Each cell becomes occupied (1) if both adjacent cells have the same state, otherwise it becomes empty (0). The first and last cells are always empty since they don't have two neighbors. Understanding the Problem Given a binary list representing prison cells and a number k, we need to find the state after k days. The transformation rule is: If a cell has two neighbors with the same state (both 0 or both 1), it becomes occupied (1) Otherwise, it becomes empty (0) First ...
Read More