Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK

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



Duration: 0:00
5,308 views
282


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A

Hi Everyone, this is the 76th video of our Playlist "Leetcode Easy".
Now we will be solving a good and easy problem - Minimum Number of Operations to Make Elements in Array Distinct | Brute Force | Optimal | Leetcode 3396 | codestorywithMIK

This problem is a good candidate for a Phone Interview Problem

Problem Name : Minimum Number of Operations to Make Elements in Array Distinct | Brute Force | Optimal | Leetcode 3396 | codestorywithMIK
Company Tags :
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/HashSet/Leetcode Easy/Minimum Number of Operations to Make Elements in Array Distinct.cpp
Leetcode Link : https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct


My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
My Segment Tree Concepts Playlist :    • Segment Tree | Introduction | Basics ...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And...  
Trie Playlist -    • Word Search II (Google, Amazon, Meta,...  
Difference Array Technique: Concepts & Qns :    • Introduction | What | How | Differenc...  
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  

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


Video Summary :
Approach 1: Brute Force
This method iterates through the array in segments of three elements, checking for duplicate values within each segment. If a segment contains duplicates, it increments an operation counter and continues to the next segment. The process repeats until a segment without duplicates is found, at which point the function returns the current count of operations.

Approach 2: Reverse Iteration
Starting from the end of the array, this approach traverses backward while maintaining a set of encountered elements. For each element, it checks if it has already been seen. If a duplicate is found, it calculates and returns the minimum number of operations required, based on the position of the duplicate. If no duplicates are encountered during the traversal, it returns zero, indicating no operations are needed.


✨ Timelines✨
00:00 - Introduction
0:19 - Motivation
0:28 - Problem Explanation
2:55 - Thought Process - Brute Force
8:23 - Thought Process - Optimal
12:42 - One More Example Dry Run
14:37 - Coding it up

#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


2025-04-20Count the Hidden Sequences | Detailed Explanation | Maths | Leetcode 2145 | codestorywithMIK
2025-04-20Rabbits in Forest | Detailed Explanation | Maths Behind It | Leetcode 781 | codestorywithMIK
2025-04-17Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176
2025-04-15Count the Number of Good Subarrays | Thought Process | Khandani Template | Leetcode 2537 | MIK
2025-04-15Count Good Triplets in an Array | Segment Tree Concepts & Qns | Video 12 | Leetcode 2179 | MIK
2025-04-13Count Good Triplets | Simple Approach | Slight Improvements | Leetcode 1534 | codestorywithMIK
2025-04-12Find the Count of Good Integers | Detailed Approach | Step By Step | Leetcode 3272 |codestorywithMIK
2025-04-10Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK
2025-04-10Count the Number of Powerful Integers | Detailed Thought Process | Leetcode 2999 | codestorywithMIK
2025-04-09Youtube Audio Track Feature | Change Audio Language | codestorywithMIK
2025-04-08Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK
2025-04-07Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK
2025-04-04Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK
2025-04-02Auto-translate the captions to any language | YouTube
2025-04-02Maximum Value of an Ordered Triplet I | Multiple Approaches | Leetcode 2873 | codestorywithMIK
2025-03-30Legends aren't defined by their successes
2025-03-30Find Median of X Sized Subarrays | Weekly Contest 443 | Hint To Qn 4 | Detailed | codestorywithMIK
2025-03-29Partition Labels | 2 Clean Approaches | Leetcode 763 | codestorywithMIK
2025-03-29Apply Operations to Maximize Score | Super Detailed Approach For Beginners | Leetcode 2818 | MIK
2025-03-28Binary Exponentiation | Fast Exponentiation | Detailed For Beginners | codestorywithMIK
2025-03-27Find the K-th Largest or Smallest in O(n) using nth_element | Competitive Programming Hack