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

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



Duration: 0:00
1,573 views
129


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


4 days agoBuild Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK
6 days agoMerge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
6 days agoNumber 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
2025-04-22Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK
2025-04-22Count the Number of Ideal Arrays | Detailed Explanation | Explained Maths | Leetcode 2338 | MIK
2025-04-22Modular nCr using Fermat’s Little Theorem | Beginner Friendly Explanation | Code | 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