ποΈ 3100-Water-Bottles-II
This document provides solutions for Water-bottles-II solution of leetcode questions
ποΈ 3101-Count-Alternating-subarrays
This document provides solutions for Count-Alternating-subarrays solution of leetcode questions
ποΈ 3102-Minimize Manhattan Distances
This document provides solutions for Minimize Manhattan Distances using dynamic implemented in C++, Java, and Python.
ποΈ 3105-LongestStrictlySubarray
Return the length of the longest subarray of nums which is either strictly increasing or strictly decreasing.
ποΈ 3106. Lexicographically Smallest String After Operations With Constraint
This document provides a solution where we Return a string denoting the lexicographically smallest string t
ποΈ 3107-Minimum-operation-to-make-median-of-array-equal-to-k
This document provides a solution of Minimum-operation-to-make-median-of-array-equal-to-k
ποΈ 3108-Minimum-cost-walk-in-weighted-graph
This document provides a solution of Minimum-cost-walk-in-weighted-graph
ποΈ 3109 Find the Index of Permutation
This is a solution to the Find the Index of Permutation problem on LeetCode.
ποΈ 3110 - Score of a string
This is a solution to the Two Score of a string on LeetCode.
ποΈ 3110 - Score of a string
This is a solution to the Two Score of a string on LeetCode.
ποΈ 3111-minimum-rectangle-to-cover-point
This document provides a solution of minimum-rectangle-to-cover-point
ποΈ 3115. Maximum Prime Difference
This is a solution to the 3115. Maximum Prime Difference problem on LeetCode.
ποΈ 3116 Kth Smallest Amount With Single Denomination Combination
This document provides a solution where we Return the $k^th$ smallest amount that can be made using these coins.
ποΈ 3131-FindIntegerAddedToArray
Given two arrays of equal length, nums1 and nums2, find the integer that has been added to each element of nums1 to obtain nums2.
ποΈ 3139 Minimum Cost to Equalize Array
This document provides a solution where we Return the minimum cost required to make all elements in the array equal.
ποΈ 3143-MaximumPointsInsideSquare
Given an array of points in the XY-plane, find the maximum number of points that can be inside a square with side length K.
ποΈ 3144-minimum-substring-partition-of-equal-charater-frequency
this discription is for the solution of minimum-substring-partition-of-equal-charater-frequency
ποΈ 3145-find-product-of-element-of-big-array
this discription is for the solution of find-product-of-element-of-big-array
ποΈ 3146-permutation-difference-between-two-string
this discription is for the solution of permutation-difference-between-two-string
ποΈ 3147-Taking Maximum Energy From the Mystic Dungeon
this discription is for the solution of Taking Maximum Energy From the Mystic Dungeon
ποΈ 3152-Special Array II
This document provides solutions to this problem implemented in C++, Java, and Python.
ποΈ Fenwick Tree Solution
This document provides solutions to a problem using the Fenwick Tree (Binary Indexed Tree) data structure, implemented in C++, Java, and Python.
ποΈ 3162-Find the Number of Good Pairs 1
This is a solution to the Find the number of good pairs 1 in leetcode
ποΈ 3169. Count Days Without Meetings
This is a solution to the Count Days Without Meetings problem on LeetCode.
ποΈ 3170 . Lexicographically Minimum String After Removing Stars
This is a solution to the Lexicographically Minimum String After Removing Stars problem on LeetCode.
ποΈ 3171-Find Subarray With Bitwise OR Closest to K
This description is for the solution of Find Subarray With Bitwise OR Closest to K
ποΈ 3174-Clear Digits
This is a solution to clear digits in leetcode
ποΈ 3175-Find The First Player to Win K Games in a Row
Solution for finding the first player to win K games in a row.
ποΈ 3178-Find the Child Who Has the Ball After K Seconds
Solution for finding the child who has the ball after K seconds.
ποΈ 3179. Find the N-th Value After K Seconds
This is a solution to the Find the N-th Value After K Seconds problem on LeetCode.
ποΈ Max Total Reward
This document provides solutions for finding the maximum total reward using dynamic programming and bit manipulation, implemented in C++, Java, and Python.
ποΈ 3184 - Count Pairs That Form a Complete Day I
This is a solution to the Search in a Binary Search Tree problem on LeetCode.
ποΈ Count Pairs That Form a Complete Day II
This document provides solutions for finding the maximum total reward using dynamic programming and bit manipulation, implemented in C++, Java, and Python.
ποΈ Minimum Operations to Make All Elements Divisible by Three
This document provides solutions for the Find Minimum Operations to Make All Elements Divisible by Three problem.
ποΈ 3191-Minimum Operations to Make Binary Array Elements Equal to One I
This is a solution to the Minimum Operations to Make Binary Array Elements Equal to One I in leetcode
ποΈ Minimum Operations II
This document provides solutions for the Minimum Operations to Make Binary Array Elements Equal to One II problem on LeetCode.
ποΈ Minimum Average of Smallest and Largest Elements
This document provides solutions for the Minimum Average of Smallest and Largest Elements problem.
ποΈ 3195. Find the Minimum Area to Cover All Ones I
This is a solution to the Find the Minimum Area to Cover All Ones I problem on LeetCode.
ποΈ 3119. maximum number of potholes that can be fixed
The given Solution class uses a greedy approach to maximize the number of potholes repaired within the given budget by prioritizing the repair of larger contiguous pothole segments first.