ProDeveloperTutorialonAugust 31, 2026 Greedy: Replace the integer to 1 by following given conditions Problem Statement: You are given a number, you need to apply below operations: 1. If n is even, then replace n with n/2 2. If n is odd, then…
ProDeveloperTutorialonAugust 31, 2026 Greedy: Reorganize String Problem Statement: You are given a string, you need to re-arrange the staring such that no two adjacent characters are not the same. Example:…
ProDeveloperTutorialonAugust 31, 2026 Greedy: Insert new interval Problem Statement: You are given set of non overlapping interval. You are given a new interval. You need to insert the new interval and the…
ProDeveloperTutorialonAugust 31, 2026 Greedy: Minimum swaps to make strings equal Problem Statement: You are given 2 strings, s1 and s2 of same size of letter x and y. You need make both of the strings equal by swapping any…
ProDeveloperTutorialonAugust 31, 2026 Greedy: Non overlapping intervals Problem Statement: You are given a 2D array which represents interval. You need to find the minimum number of interval need to be removed to…
ProDeveloperTutorialonAugust 31, 2026 Greedy: Given three stacks, you need to find maximum equal sum Problem Statement: You are given 3 stacks s1, s2, s3. You need to find the maximum possible equal sum that can be achieved by removing from…
ProDeveloperTutorialonAugust 30, 2026 Greedy: Assign maximum cookies Problem Statement: You are given 2 arrays, greed[] and cookie[]. greed[i] is the minimum cookie size wanted by ith child. cookie[i] is the…
ProDeveloperTutorialonAugust 30, 2026 Greedy: Assign holes to mice Problem Statement: You are given 2 arrays one for mice and one for hole. There are N mice and N holes and placed in a straight line. Each hole…
ProDeveloperTutorialonAugust 30, 2026 Greedy: Maximum odd binary number Problem Statement: You are given a string, that has atleast one. Re-arrange the bits so that the number is the odd binary number and is the…
ProDeveloperTutorialonAugust 30, 2026 Binary Tree: Given a binary tree, invert it Problem Statement Given a binary tree, invert it Example: Input: /* * 10 * / \ * 8 12 * / \ / \ * 2 9 11 14 */ Output: /* * 10 * / \ * 12 8 *…