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 491 of 2547
Program to find length of longest consecutive path of a binary tree in python
Suppose we have a binary tree; we have to find the longest consecutive path in the binary tree. A consecutive path is a sequence of nodes where each node's value differs from the previous by exactly 1 (either increasing or decreasing). So, if the input is like 3 2 4 5 9 ...
Read MoreProgram to make almost BST to exact BST in python
A binary search tree (BST) has a specific property: for each node, all values in the left subtree are smaller, and all values in the right subtree are larger. When two nodes are swapped in a BST, we can identify and fix them by performing an inorder traversal and finding the nodes that violate the BST property. Understanding the Problem In an inorder traversal of a valid BST, the values should be in ascending order. When exactly two nodes are swapped, we'll find one or two violations where a node's value is less than the previous node's value. ...
Read MoreProgram to find area of largest square of 1s in a given matrix in python
Suppose we have a binary matrix, we have to find the area of the largest square of 1s in that given matrix using dynamic programming. Problem Understanding Given a binary matrix containing only 0s and 1s, we need to find the area of the largest square submatrix that contains only 1s. For example, if the input matrix is ? .cell { fill: white; stroke: #333; stroke-width: 1; } .one { fill: #4CAF50; } ...
Read MoreProgram to find largest rectangle area under histogram in python
A histogram is a graphical representation where data is displayed using bars of different heights. The largest rectangle area problem asks us to find the maximum rectangular area that can be formed under the histogram bars. Given a list of heights representing histogram bars, we need to find the area of the largest rectangle that fits completely under the bars. Problem Example For the input nums = [3, 2, 5, 7], the histogram looks like: .bar { fill: #4CAF50; stroke: #333; ...
Read MoreProgram to find minimum swaps required to make given anagram in python
Suppose we have two strings S and T and they are anagrams of each other. We have to find the minimum number of swaps required in S to make it same as T. So, if the input is like S = "kolkata" T = "katloka", then the output will be 3, as we can swap in this sequence: [katloka (given), kotlaka, koltaka, kolkata]. Algorithm To solve this, we will follow these steps − Define a function util(). This will take S, T, i if i >= size of S, then return 0 ...
Read MoreProgram to find nearest number of n where all digits are odd in python
Given a number n, we need to find the nearest number where all digits are odd. When two values are equidistant from n, we return the larger one. For example, if the input is n = 243, the output will be 199 because it's the closest number to 243 where all digits (1, 9, 9) are odd. Algorithm To solve this problem, we follow these steps: Find the first even digit from left to right If no even digit exists, return the original number ...
Read MoreProgram to find maximum difference of adjacent values after deleting k numbers in python
Given a sorted list of numbers, we need to delete k values to minimize the maximum difference between adjacent elements. This problem uses dynamic programming to find the optimal solution. Problem Understanding If we have nums = [15, 20, 30, 400, 1500] and k = 2, removing [400, 1500] leaves [15, 20, 30] with maximum adjacent difference of 10 (between 20 and 30). Algorithm Steps The approach follows these steps − Calculate differences between consecutive elements Use dynamic programming to try removing elements from both ends Find the minimum possible maximum difference ...
Read MoreProgram to find maximum credit we can get by finishing some assignments in python
Suppose we have two lists of the same size representing course assignments: deadlines and credits. Here deadlines[i] shows the deadline day for assignment i and credits[i] represents the amount of credits we get for assignment i. We have one day to complete an assignment, and it can be completed before or on the deadline day. We cannot do multiple assignments at the same time. We have to find the maximum credit we can gain by finishing some subset of assignments. So, if the input is like deadlines = [1, 2, 2, 2] and credits = [4, 5, 6, 7], ...
Read MoreProgram to check number of ways we can move k times and return back to first place in python
Suppose we are at position 0 of an n-length array, and on each step, we can move right one place, left one place (not exceeding bounds), or stay at the same position. We need to find how many unique walks of exactly k steps return us back to index 0. If the answer is very large, return it modulo 10^9 + 7. So, if the input is like n = 7, k = 4, then the output will be 9. The possible action sequences are ? [Right, Right, Left, Left] [Right, Left, Right, Left] [Stay, Stay, Stay, ...
Read MoreProgram to find number of steps to solve 8-puzzle in python
The 8-puzzle is a classic sliding puzzle game where you have a 3x3 grid with numbers 0-8, and you need to arrange them in order by sliding tiles into the empty space (represented by 0). This problem asks us to find the minimum number of steps to solve the puzzle using a breadth-first search approach. Understanding the Problem Given a 3x3 board with numbers 0-8 (no duplicates), we can swap the 0 with any of its adjacent neighbors. The goal is to arrange the numbers in sequential order from 0 to 8. For example, if we have ...
Read More