Minimum Number of Removals to Make Mountain Array | Thought Process | Leetcode 1671|codestorywithMIK

Subscribers:
92,300
Published on ● Video Link: https://www.youtube.com/watch?v=LFjC2AW0wf4



Duration: 0:00
8,418 views
441


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 119th Video of our Playlist "Arrays 1D/2D : Popular Interview Problems" by codestorywithMIK

In this video we will try to solve a good array Problem based on LIS :
Minimum Number of Removals to Make Mountain Array | Detailed Thought Process | Leetcode 1671 | codestorywithMIK

I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.

Problem Name :
Minimum Number of Removals to Make Mountain Array | Detailed Thought Process | Leetcode 1671 | codestorywithMIK
Company Tags : will update later
My solutions on Github(C++ & JAVA) - will update later tonight (currently travelling)
Leetcode Link :
https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array

My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And...  
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel :    / @codestorywithmik  

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

Summary :
Calculate LIS and LDS for each index i and find the maximum mountain array for every index i as peak element and hence find the removal elements from both side of peak element. Maintain the minimumRemoval and return it


✨ Timelines✨
00:00 - Introduction

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik




Other Videos By codestorywithMIK


2024-11-08DSA Shorts with MIK - 8
2024-11-07Maximum XOR for Each Query | Simple Explanation | Leetcode 1829 | codestorywithMIK
2024-11-06Largest Combination With Bitwise AND Greater Than Zero | Detailed | Leetcode 2275 | codestorywithMIK
2024-11-05Find if Array Can Be Sorted | Detailed Approaches | Dry Runs | Leetcode 3011 | codestorywithMIK
2024-11-04Minimum Number of Changes to Make Binary String Beautiful | 2 Ways | Leetcode 2914 |codestorywithMIK
2024-11-03Consistency is the key
2024-11-02String Compression III | Simple Simulation | Leetcode 3163 | codestorywithMIK
2024-11-01Rotate String | Something to learn | Leetcode 796 | codestorywithMIK
2024-10-30Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK
2024-10-30Delete Characters to Make Fancy String | Simple & Easy | Leetcode 1957 | codestorywithMIK
2024-10-28Minimum Number of Removals to Make Mountain Array | Thought Process | Leetcode 1671|codestorywithMIK
2024-10-27DSA Shorts with MIK - 7
2024-10-26Longest Square Streak in an Array | Detailed Approaches | Dry Run | Leetcode 2501 | codestorywithMIK
2024-10-25Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK
2024-10-24Maximum Width Ramp | How to identify Monotonic Stack | Dry Runs | Leetcode 962 | codestorywithMIK
2024-10-24Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK
2024-10-23Remove Sub-Folders from the Filesystem | 2 Simple Approaches | Leetcode 1233 | codestorywithMIK
2024-10-22Flip Equivalent Binary Trees | Simple Recursion | Dry Run | Leetcode 951 | codestorywithMIK
2024-10-21Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK
2024-10-20Parsing A Boolean Expression | Cleanest Explanation | Dry Run | Leetcode 1106 | codestorywithMIK
2024-10-19Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593