# 100 Days Challenge Leetcode

## LeetCode 880. Decoded String at Index (Medium)

LeetCode 880. Decoded String at Index: Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Decoded String at Index” or “LeetCode 880.” Leet Code 2612 Minimum Reverse Operations (Hard) Approach: Reverse LeetCode 880. Decoded String at Index Leet code 880, “Decoded String at […]

## LeetCode 2233 Maximum Product After K Increments (Medium)

LeetCode 2233 Maximum Product After K Increments: Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Maximum Product After K Increments” or “LeetCode 2233.” problem. Approach: LeetCode 2233 Maximum Product After K Increments Visualization LeetCode 2233 Priority Queue In this Leetcode problem, we are tasked

## Leetcode 316. Remove Duplicate Letters (Medium)

Leetcode 316. Remove Duplicate Letters : Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Remove Duplicate Letters ” or “Leetcode 316.” problem. Leet Code 287 Find the Duplicate Number (Medium) Approach Stack : Leetcode 316. Remove Duplicate Letters Our Objective is, Leet code 316

## LeetCode 389. Find The Difference (Easy)

Leetcode 389. Find The Difference :Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Find The Difference ” problem. Bruteforce Approach 1: Understand the Problem 2: Read the Input 3: Count Character Occurrences 4: Compare the Counts 5: Return the Result leet Code

## Leet code 799. Champagne Tower (Medium)

Leetcode 799. Champagne Tower: Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Champagne Tower” problem. Problem Explanation : In summary, LeetCode 799 Champagne Tower is a coding problem that involves pouring champagne into a tower of glasses and calculating how much champagne a

## Leet Code 1048. Longest String Chain (Medium)

Leetcode 1048. Longest String Chain: Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Longest String Chain” problem. A naive approach would be to check every word against every other word looking for predecessors, but that would lead to a TLE result. The first important realization

## leet Code 392. Is Subsequence (easy)

Is Subsequence Leetcode 392 : Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Is Subsequence” problem. Step 1: Problem Overview : The “Is Subsequence” problem, as presented in LeetCode 392, aims to determine if one given string, denoted as ‘s,‘ is a subsequence

## Leet Code 1658. Minimum Operations to Reduce X to Zero (Medium)

Minimum Operations to Reduce X to Zero (Medium) : Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Minimum Operations to Reduce X to Zero (Medium)” problem. Problem explanation: We were given an array, and we were tasked with reducing the elements present

## Leet Code 835. Image Overlap (Medium)

Image Overlap Leetcode:Initially, this problem provides an engaging opportunity for solving as one would eventually discover its enjoyment factor. Moreover, it holds practical significance in real-world scenarios as well. For instance, by determining the maximal overlapping region between two images and subsequently clipping them accordingly, one can enhance their focus and reduce their size effectively.

## Leet Code 662. maximum width of binary tree (Medium)

maximum width of binary tree :Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Maximum Width of Binary Tree” problem.   Binary Tree Level Order Traversal Method 1: Level Order Traversal using Queue Algorithm: Note : Level oder Travesal is equivalent to BFS search

## Leet Code 287 Find the Duplicate Number (Medium)

Find the Duplicate Number : Finding a sneaky duplicate number in an array can be a real brain-teaser, especially when you’re told not to mess with the array or use too much memory. But fear not! We’ve got a clever trick up our sleeves to crack this code conundrum. Understanding the Puzzle:Imagine this: You’re handed

## Leetcode 135 Candy (Hard) Solution

Leetcode 135 Candy (Hard) Solution:Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Candy” problem. Imagine you have a bunch of kids lined up, each with a rating assigned to them. Your task is to distribute candies to these kids following two simple

## Leet Code 2612 Minimum Reverse Operations (Hard)

Minimum Reverse Operations : Once upon a time, there was a magical array called “A.” This array had lots of zeros, but it had one special number: the number 1. The number 1 could move around in this array, but it had some rules to follow. Rule 1: The 1 could do a special trick

## Leet code 206 Reverse Linked List (EAZY)

Reverse Linked List :You can solve this problem in C++, Java, Python, or JavaScript using the following algorithm to reverse a singly linked list: Leet Code : Reverse Nodes in k-Group Java, Python ,C++ JavaScript Solution Imagine you have a chain of beads, and you want to reverse their order. That’s what this code does

## Leet Code 420 Strong Password Checker (HARD)

Leet Code . 420 Strong Password Checker: Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Strong Password Checker” or “Leet Code .420‘ Approach The code achieves this by following these steps: C++ Solution Leet Code 420 Leet Code : Longest Palindromic Substring

## Leetcode 1359 Count All Valid Pickup and Delivery Options (HARD)

Counting Valid Pickup and Delivery Sequences: A Dynamic Programming Approach 1. Introduction What is the Problem? You are given n orders, each comprising both pickup and delivery services. The task is to count all the valid sequences of these orders, ensuring that the delivery for each order always occurs after its corresponding pickup. To manage

## LeetCode: Solving Snakes and Ladders with BFS Algorithm

The problem “Snakes and Ladders” is a problem where the goal is to find the minimum number of dice rolls required to reach the final square in a game of snakes and ladders. The game is represented by a square grid with snakes and ladders on some of the squares. Landing on a ladder square

## Maximum Sum Circular Subarray Leet Code with C++, Python, Java, and JavaScript Solutions

Example 1: Input: [3,-2,2,-3] Output: 3 Explanation: Subarray [3] and [3,-2,2] both have the maximum sum 3 Example 2: Input: [-2,-3,-1] Output: -1 Explanation: Subarray [-1] has the maximum sum -1 Solution Explanation: We iterate through the array and keep track of the maximum sum subarray seen so far, the maximum sum subarray ending at