Empowering coders, one solution at a time
Empowering coders, one solution at a time
![[Solved] Minimum Recolors to Get K Consecutive Black Blocks LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Minimum-Recolors-to-Get-K-Consecutive-Black-Blocks-LeetCode-Contest.png "[Solved] Minimum Recolors to Get K Consecutive Black Blocks LeetCode Contest")
You are given a 0-indexed string blocks of length n, where blocks[i] is either ‘W’ or ‘B’, representing the color of the ith block. The characters ‘W’ and ‘B’ denote the colors white and black, respectively. You are also given an integer k, which is the desired number of consecutive black blocks. In one operation, you can recolor a white block…
![[Solved] Count Special Integers LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Count-Special-Integers-LeetCode-Contest-Problem.png "[Solved] Count Special Integers LeetCode Contest Problem")
We call a positive integer special if all of its digits are distinct. Given a positive integer n, return the number of special integers that belong to the interval [1, n]. Count Special Integers LeetCode Contest Example 1: Input: n = 20 Output: 19 Explanation: All the integers…
![[Solved] Construct Smallest Number From DI String LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Construct-Smallest-Number-From-DI-String-LeetCode-Contest-Problem.png "[Solved] Construct Smallest Number From DI String LeetCode Contest Problem")
You are given a 0-indexed string pattern of length n consisting of the characters ‘I’ meaning increasing and ‘D’ meaning decreasing. A 0-indexed string num of length n + 1 is created using the following conditions: num consists of the digits ‘1’ to ‘9’, where each digit is used at most once. If pattern[i] == ‘I’, then num[i] < num[i + 1]. If pattern[i] == ‘D’, then num[i] >…
![[Solved] Node With Highest Edge Score LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Node-With-Highest-Edge-Score-LeetCode-Contest-Problem.png "[Solved] Node With Highest Edge Score LeetCode Contest Problem")
You are given a directed graph with n nodes labeled from 0 to n – 1, where each node has exactly one outgoing edge. The graph is represented by a given 0-indexed integer array edges of length n, where edges[i] indicates that there is a directed edge from node i to node edges[i]. The edge score of a node i is defined as…
![[Solved] Largest Local Values in a Matrix LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Largest-Local-Values-in-a-Matrix-LeetCode-Contest-Problem.png "[Solved] Largest Local Values in a Matrix LeetCode Contest Problem")
You are given an n x n integer matrix grid. Generate an integer matrix maxLocal of size (n – 2) x (n – 2) such that: maxLocal[i][j] is equal to the largest value of the 3 x 3 matrix in grid centered around row i + 1 and column j + 1. In other words, we want…
![[Solved] Write a program to find the node with the minimum value in a binary search tree and print it with Java](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Write-a-program-to-find-the-node-with-the-minimum-value-in-a-binary-search-tree-and-print-it-with-Java.png "[Solved] Write a program to find the node with the minimum value in a binary search tree and print it with Java")
Write a program to find the node with the minimum value in a binary search tree and print it. For example, if the input tree as below then output is 6 where 6 is a node with the minimum value in…
![[Solved] Define a function that takes the head of a linked list and an integer x as arguments with Java](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Define-a-function-that-takes-the-head-of-a-linked-list-and-an-integer-x-as-arguments-with-Java.png "[Solved] Define a function that takes the head of a linked list and an integer x as arguments with Java")
Define a function that takes the head of a linked list and an integer x as arguments. This function deletes the xth node from a singly linked list(index starts from 1). The function returns the head of the modified linked list. The…
![[Solved] countNumbers Given an array and two numbers L and R, the task is to write a program which prints the count of numbers in the given range with Java](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-countNumbers-Given-an-array-and-two-numbers-L-and-R-the-task-is-to-write-a-program-which-prints-the-count-of-numbers-in-the-given-range-with-Java.png "[Solved] countNumbers Given an array and two numbers L and R, the task is to write a program which prints the count of numbers in the given range with Java")
countNumbers: Given an array and two numbers L and R, the task is to write a program which prints the count of numbers in the given range L – R which are divisible by all the numbers in the array. Suppose the given…
![[Solved] repeatingMissing You are given an array of size N. It contains numbers in the range 1-N(Both inclusive) with Java](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-repeatingMissing-You-are-given-an-array-of-size-N.-It-contains-numbers-in-the-range-1-NBoth-inclusive-with-Java.png "[Solved] repeatingMissing You are given an array of size N. It contains numbers in the range 1-N(Both inclusive) with Java")
repeatingMissing: You are given an array of size N. It contains numbers in the range 1-N(Both inclusive). One of these numbers is repeating and one is missing in the array. Write a program to display these 2 numbers. The output…
![[Solved] You are given two strings str1 and str2. Find the minimum number of edits (operations) that can be performed on str1 to transform it into str2 with Java](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-You-are-given-two-strings-str1-and-str2.-Find-the-minimum-number-of-edits-operations-that-can-be-performed-on-str1-to-transform-it-into-str2-with-Java.png "[Solved] You are given two strings str1 and str2. Find the minimum number of edits (operations) that can be performed on str1 to transform it into str2 with Java")
You are given two strings str1 and str2. Find the minimum number of edits (operations) that can be performed on str1 to transform it into str2. The operations that can be performed on str1 are :-1. Insert – You can insert…