Empowering coders, one solution at a time
Empowering coders, one solution at a time
You are given a 0-indexed integer array nums having length n, an integer indexDifference, and an integer valueDifference. Your task is to find two indices i and j, both in the range [0, n – 1], that satisfy the following conditions: Return an integer array answer, where answer = [i, j] if there are two such indices, and answer =…
![[Solved] Maximum Difference by Remapping a Digit with Java](https://realcoder.techss24.com/wp-content/uploads/2023/02/Solved-Maximum-Difference-by-Remapping-a-Digit-with-Java-768x432.png "[Solved] Maximum Difference by Remapping a Digit with Java")
You are given an integer num. You know that Danny Mittal will sneakily remap one of the 10 possible digits (0 to 9) to another digit. Return the difference between the maximum and minimum values Danny can make by remapping exactly one digit in num. Notes: Example 1: Input: num = 11891 Output: 99009…
![[Solved] Check If It Is a Straight Line](https://realcoder.techss24.com/wp-content/uploads/2022/12/Solved-Check-If-It-Is-a-Straight-Line-768x504.png "[Solved] <a href=\"https://leetcode.com/problems/check-if-it-is-a-straight-line/?envType=study-plan&id=programming-skills-i\" target=\"_blank\" rel=\"noreferrer noopener\">Check If It Is a Straight Line</a>")
You are given an array coordinates, coordinates[i] = [x, y], where [x, y] represents the coordinate of a point. Check if these points make a straight line in the XY plane. Problem: https://leetcode.com/problems/check-if-it-is-a-straight-line/?envType=study-plan&id=programming-skills-i Example 1: Input: coordinates = [[1,2],[2,3],[3,4],[4,5],[5,6],[6,7]] Output: true Example 2: Input: coordinates…
![[Solved] Maximum Deletions on a String LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/10/Solved-Maximum-Deletions-on-a-String-LeetCode-Contest-Problem-768x512.png "[Solved] Maximum Deletions on a String LeetCode Contest Problem")
You are given a string s consisting of only lowercase English letters. In one operation, you can: Delete the entire string s, or Delete the first i letters of s if the first i letters of s are equal to the following i letters in s, for any i in the range 1 <= i <= s.length / 2. For example,…
![[Solved] Minimize XOR LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/10/Solved-Minimize-XOR-LeetCode-Contest-Problem-768x514.png "[Solved] Minimize XOR LeetCode Contest Problem")
Given two positive integers num1 and num2, find the integer x such that: x has the same number of set bits as num2, and The value x XOR num1 is minimal. Note that XOR is the bitwise XOR operation. Return the integer x. The test cases are generated such that x is uniquely determined. The number of set…
![[Solved] Maximum Sum of an Hourglass LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/10/Solved-Maximum-Sum-of-an-Hourglass-LeetCode-Contest-Problem-768x510.png "[Solved] Maximum Sum of an Hourglass LeetCode Contest Problem")
You are given an m x n integer matrix grid. We define an hourglass as a part of the matrix with the following form: Return the maximum sum of the elements of an hourglass. Note that an hourglass cannot be rotated and must be entirely contained within the matrix.…
![[Solved] Number of Common Factors LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/10/Solved-Number-of-Common-Factors-LeetCode-Contest-Problem-768x513.png "[Solved] Number of Common Factors LeetCode Contest Problem")
Given two positive integers a and b, return the number of common factors of a and b. An integer x is a common factor of a and b if x divides both a and b. Example 1: Input: a = 12, b = 6 Output: 4 Explanation: The common factors of 12 and 6 are 1, 2, 3, 6. Example 2: Input:…
![[Solved] Maximum Segment Sum After Removals LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Maximum-Segment-Sum-After-Removals-LeetCode-Contest.png "[Solved] Maximum Segment Sum After Removals LeetCode Contest")
You are given two 0-indexed integer arrays nums and removeQueries, both of length n. For the ith query, the element in nums at the index removeQueries[i] is removed, splitting nums into different segments. A segment is a contiguous sequence of positive integers in nums. A segment sum is the sum of every element in a segment. Return an integer array answer, of length n,…
![[Solved] Shifting Letters II LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Shifting-Letters-II-LeetCode-Contest.png "[Solved] Shifting Letters II LeetCode Contest")
You are given a string s of lowercase English letters and a 2D integer array shifts where shifts[i] = [starti, endi, directioni]. For every i, shift the characters in s from the index starti to the index endi (inclusive) forward if directioni = 1, or shift the characters backward if directioni = 0. Shifting a character forward means replacing it…
![[Solved] Time Needed to Rearrange a Binary String LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/08/Solved-Time-Needed-to-Rearrange-a-Binary-String-LeetCode-Contest.png "[Solved] Time Needed to Rearrange a Binary String LeetCode Contest")
You are given a binary string s. In one second, all occurrences of “01” are simultaneously replaced with “10”. This process repeats until no occurrences of “01” exist. Return the number of seconds needed to complete this process. Time Needed to Rearrange a Binary String LeetCode Contest Example 1: Input: s = “0110101”…