Find Score of an Array After Marking All Elements | 2 Approaches | Leetcode 2593 | codestorywithMIK

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



Duration: 0:00
5,132 views
303


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 23rd Video of our Playlist "Heap : Popular Interview Problems" by codestorywithMIK

In this video we will try to solve an medium-easy problem based on heap : Find Score of an Array After Marking All Elements | 2 Simple Approaches | Leetcode 2593 | 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 : Find Score of an Array After Marking All Elements | 2 Simple Approaches | Leetcode 2593 | codestorywithMIK
Company Tags : will update later
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Heap/Find Score of an Array After Marking All Elements.cpp
Leetcode Link : https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements


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 :
Approach-1: Sorting Array with Indices

Time Complexity: O(n log n) due to sorting the array.
Space Complexity: O(n) for storing the pairs of values and their indices.
Approach:
The array is first converted into a vector of pairs where each pair contains the value and its index.
The vector is sorted based on the values.
A visited array is used to track which elements and their neighbors have been processed.
For each element, if it’s not visited, its score is added, and its adjacent elements are marked as visited to prevent revisiting them.
Approach-2: Using Min-Heap

Time Complexity: O(n log n) due to the operations involving the priority queue (min-heap).
Space Complexity: O(n) for storing the visited status and heap.
Approach:
A priority queue (min-heap) is used to store pairs of values and their indices, which ensures that the smallest element is processed first.
As elements are processed, the visited array keeps track of which elements and their neighbors have been visited.
The score is updated by adding the value of each unvisited element, and its adjacent elements are marked as visited.

✨ Timelines✨
00:00 - Introduction

#MIK #mik #Mik
#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-12-19Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK
2024-12-19Max Chunks To Make Sorted | 3 Detailed Approaches | Leetcode 769 | codestorywithMIK
2024-12-17Final Prices With a Special Discount in a Shop | Something to learn |Leetcode 1475 |codestorywithMIK
2024-12-17Unique Paths | Recursion | Memo | Bottom Up | Leetcode 62 | DP On Grids | codestorywithMIK
2024-12-16Construct String With Repeat Limit | 2 Simple Approaches | Leetcode 2182 | codestorywithMIK
2024-12-16Introduction | DP On Grids | Part 2 | DP Concepts & Qns-30 | codestorywithMIK
2024-12-15Final Array State After K Multiplication Operations I | Detailed | Leetcode 3264 | codestorywithMIK
2024-12-15Introduction | DP On Grids | Part 1 | DP Concepts & Qns-29 | codestorywithMIK
2024-12-13Maximum Average Pass Ratio | Detailed | Covered Minute Details | Leetcode 1792 | codestorywithMIK
2024-12-12Continuous Subarrays | Detailed Approaches | Time Complexity | Leetcode 2762 | codestorywithMIK
2024-12-11Find Score of an Array After Marking All Elements | 2 Approaches | Leetcode 2593 | codestorywithMIK
2024-12-10Take Gifts From the Richest Pile | Simple Explanation | Leetcode 2558 | codestorywithMIK
2024-12-09Maximum Beauty of an Array After Applying Operation | 3 Approaches | Leetcode 2779 |codestorywithMIK
2024-12-08Find Longest Special Substring That Occurs Thrice I & II | Leetcode 2981 & 2982 | codestorywithMIK
2024-12-08You will never have to ❤️
2024-12-08Sorry System Stack 🥹
2024-12-07Primality Check | Sieve of Eratosthenes | Super Detailed For Beginners | codestorywithMIK
2024-12-07Special Array II | 3 Detailed Approaches | Beginners Alert | Leetcode 3152 | codestorywithMIK
2024-12-06Two Best Non-Overlapping Events | Brute Force | Better | Leetcode 2054 | codestorywithMIK
2024-12-05Minimum Limit of Balls in a Bag | Detailed | Why Binary Search | Leetcode 1760 | codestorywithMIK
2024-12-04Maximum Number of Integers to Choose From a Range I | Simple | Leetcode 2554 | codestorywithMIK