Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK

Subscribers:
105,000
Published on ● Video Link: https://www.youtube.com/watch?v=0Q7m9VFCrUI



Duration: 0:00
4,766 views
278


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

Hi Everyone, this is the 85th video of our Playlist "Leetcode Easy".
Now we will be solving a good but easy Problem - Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 | codestorywithMIK

I will explain it in full detail so that it becomes easy to understand. We will find the reason behind everything so that we understand why we did what we did.
And we will do a complete dry run.

Problem Name : Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 | codestorywithMIK
Company Tags : will update later
Code Github(C++ & JAVA) - will update later tonight
Leetcode Link : https://leetcode.com/problems/build-array-from-permutation


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 :
The problem requires constructing an array such that ans[i] = nums[nums[i]].
Instead of using extra space, the solution encodes both old and new values into each element using the formula:
nums[i] = nums[i] + n * (nums[nums[i]] % n), where % n ensures correct value extraction.
In the second pass, nums[i] is divided by n to retrieve only the newly encoded value, achieving an in-place transformation.
This approach uses mathematical encoding to meet the O(1) space constraint.


✨ Timelines✨
00:00 - Introduction
0:19 - Motivation
0:49 - Problem Explanation
3:53 - Simple Approach
4:41 - Follow Up Qn
8:20 - Detailed with example
21:50 - Story To Code
24:19 - 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-05-12Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK
2025-05-11Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | codestorywithMIK
2025-05-10Three Consecutive Odds | Important Motivation | 2 Approaches | Leetcode 1550 | codestorywithMIK
2025-05-10Dungeon Game | Brute Force | Recursion | Memo | Bottom Up | Leetcode 174 | DP On Grids | MIK
2025-05-10This Is Your Sign to Keep Going |Motivation | codestorywithMIK
2025-05-09Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK
2025-05-09Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK
2025-05-07Find Minimum Time to Reach Last Room II | Using Same Code | Leetcode 3342 | codestorywithMIK
2025-05-07No Loop Needed | Find Min & Max in 1 Line using STL | C++ Competitive Programming Hack
2025-05-06Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK
2025-05-05Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK
2025-05-04Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
2025-05-03Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK
2025-05-02Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK
2025-05-02Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK
2025-05-01Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK
2025-04-29Find Numbers With Even Number Of Digits | Multiple Ways | Leetcode 1295 | codestorywithMIK
2025-04-27Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK
2025-04-26Count Subarrays of Length Three With a Condition | Easy | Leetcode 3392 | codestorywithMIK
2025-04-25Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK
2025-04-23Count Complete Subarrays in an Array | Khandani Template | Dry Run | Leetcode 2799 |codestorywithMIK