Akshat Singh☑️ Day 32/100: #Leetcode daily question
🟨 Question: 1671. Minimum Number of Removals to Make Mountain Array
This is a very good difficult question, and I obviously need to look a solution. This was solved using the lowest increasing decreasing subarray method.
🐈⬛ Check out my #GitHub where I post all the daily streak 🔥 questions and #LeetcodeContest 🏆 solutions
🔗 Solution Link: https://github.com/akshatsingh1718/leetcode/tree/main/minimumNumberofRemovalstoMakeMountainArray
🔗 My Leetcode Github: https://github.com/akshatsingh1718/leetcode