# 100 Days Challenge Leetcode

## Leetcode 342. Power of Four (Easy)

LeetCode 342. Power of Four :Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Power of Four” or “LeetCode 342. Method we are using are Mathematical approach and Bit Manipulation. Approach : Mathematical Line Explanation n x fmod(x, 1.0) Output 1 Check if n <= 0. 16 – […]

## LeetCode 1793. Maximum Score of a Good Subarray (Hard)

LeetCode 1793. Maximum Score of a Good Subarray :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 Score of a Good Subarray” or “LeetCode 1793. ‘ Appraoch : Two Pointer dry run of the given code with the example ‘A = [1,4,3,7,4,5]’ and ‘k =

## LeetCode1425. Constrained Subsequence Sum (Medium) – DP + Heap Appraoch

LeetCode 1425. Constrained Subsequence Sum :Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Constrained Subsequence Sum” or “LeetCode 1425. ‘ Approach: Dynamic Programming with a Heap table representing the step-by-step calculation of the example with the input array nums = [10, 2, -10, 5, 20]

## Leetcode 1361. Validate Binary Tree Nodes (Medium)

In the world of competitive programming, Leetcode stands as a ubiquitous platform where aspiring developers and programmers sharpen their skills. It offers a wide array of problems that challenge your ability to think critically and come up with innovative solutions. One such problem is Leetcode 1361 – “Validate Binary Tree Nodes.” This problem not only

## LeetCode 353. Snake Game – Medium

Introduction LeetCode 353. Snake Game :Are you ready to dive into the world of game design and programming? In this blog post, we’ll be exploring a fascinating journey of designing a classic snake game while tackling LeetCode 353. Get ready to embark on this adventure with us! Understanding LeetCode 353 – Design Snake Game Before

## Leetcode 2742. Painting the Walls

Leetcode 2742. – Painting the Walls:Welcome to the world of dynamic programming, where we tackle complex problems with elegant solutions. Today, we’re diving into the intriguing challenge of Leetcode 2742. – Painting the Walls. This problem, while seemingly simple, can be quite tricky to solve efficiently. We’ll guide you through the process step by step,

## leetcode 1095. Find in Mountain Array (hard)

Welcome, fellow coding enthusiasts! Today, we’re going to embark on an exciting journey into the world of Leetcode and explore the fascinating problem of “leetcode 1095.” or “Find in Mountain Array.” In this blog post, we’ll break down this problem, guide you through the concept of Mountain Arrays, and provide a solution to tackle it.

## Leetcode 53. Maximum Subarray (Medium)

LeetCode 53. Maximum Subarray :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 Subarray” or “LeetCode 53. ‘ There are various approach to solve “Maximum Subarray” problem . we discuss three main approach which are optimaized – Kedane algo , Dp , Divide and conquer

## LeetCode 1420: Build Array Where You Can Find The Maximum Exactly K Comparisons

LeetCode 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons :Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Build Array Where You Can Find The Maximum Exactly K Comparisons” or “LeetCode 1420 ‘  Understanding the Challenge Before we delve into the

## LeetCode 343. Integer Break (Medium)

Welcome, dear readers! Today, we’re diving deep into the world of integer breaks and taking on the intriguing challenge posed by LeetCode 343 Integer Break. If you’re new to coding or a seasoned programmer looking to enhance your problem-solving skills, you’re in the right place. 🤔? So, what’s the deal with “Integer Break,” and why

## LeetCode 229. Majority Element II (Medium)

Leetcode 229. Majority Element II:Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Majority Element II” or “LeetCode 229. ‘  Method : HashMap Approach – Majority Element II 1: Initialize Data Structures 2: Count Element Occurrences 3: Calculate the Threshold 4: Iterate Over Counts 5:

## Leetcode 706. Design HashMap (Easy)

Leetcode 706. Design HashMap:Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Design HashMap” or “LeetCode 706. ‘  Codes : Leet code 706. C++:Leetcode 706. Java: Leetcode 706. Python: Leet code 706. Leetcode 1359 Count All Valid Pickup and Delivery Options (HARD) JavaScript: Leet code

## Leetcode 1512. Number of Good Pairs (easy)

Leetcode 1512Number of Good Pairs:Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Number of Good Pairs” or “LeetCode .1512‘  First Approach : bruteforce (Looping) -Number of Good Pairs The Bruteforce is simplest approach ,we used .The Looping approach contain two loops and

## Leetcode 2038. Remove Colored Pieces if Both Neighbors are the Same Color

Leetcode 2038. Remove Colored Pieces if Both Neighbors are the Same Color: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 Colored Pieces if Both Neighbors are the Same Color ” or “LeetCode .2038‘ Greedy Appraoch : Leetcode 2038. Remove Colored Pieces if Both Neighbors

## LeetCode 557. Reverse Words in a String III (easy)

LeetCode 557. Reverse Words in a String III Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Reverse Words in a String III ” or “LeetCode .557‘ 1 Appraoch : Simple (Brute Force) :Reverse Words in a String Leet Code 835. Image Overlap

## LeetCode 132. Pattern (Medium)

LeetCode 132. Pattern: Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “pattern” or “LeetCode .132” Stack Approach: Leet Code 132. Pattern (Medium) Leetcode 316. Remove Duplicate Letters (Medium) C++: Stack Leet Code 132 LeetCode 896. Monotonic Array (Easy) Java: Stack Leet Code 132

## LeetCode 896. Monotonic Array (Easy)

LeetCode 896. Monotonic Array: Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Monotonic Array” or “LeetCode .896” Approach for Leetcode 898: Monotonic Array This solution solves the Leetcode problem 898, which checks if an array is monotonic, i.e., either entirely non-increasing or

## LeetCode 905. Sort Array By Parity (Easy)

LeetCode .905 Sort Array By Parity : Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “ Sort Array By Parity” or “LeetCode .905”  1 Approach : Two vector (Array) : Leet Code 950 LeetCode 880. Decoded String at Index (Medium) Step for