Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code

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



Duration: 0:00
6,107 views
368


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

Hi Everyone, this is the 105th video of our Playlist "Dynamic Programming : Popular Interview Problems".
In this video we will solve a very classic knapsack variant of DP - Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code
We will also see two different ways of doing memoization.

Problem Name : Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code
Company Tags : Google, META
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Target Sum.cpp
Leetcode Link : https://leetcode.com/problems/target-sum



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...  
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: Normal Recursion & Memoization using unordered_map

Description:
This approach uses recursion to explore all possible combinations of adding or subtracting elements to achieve the target sum. Memoization is implemented using an unordered_map to store intermediate results, where the key is a string representation of the current state (index, sum).

Advantages:

Flexible and dynamic as it doesn't require predefining the memoization table size.
Efficient for sparse states.
Disadvantages:

Slightly slower due to string manipulation and hashing overhead.
Approach-2: Normal Recursion & Memoization using vector

Description:
Similar to the first approach, this uses recursion to explore all possible combinations. However, memoization is implemented using a 2D vector, where the dimensions are based on the number of elements (n) and the range of sums (2 * totalSum + 1). A shift (S) is used to handle negative sums by offsetting the indices.

Advantages:

Faster access compared to unordered_map due to direct indexing.
No overhead of key creation and hashing.
Disadvantages:

Memory-intensive as the entire table is preallocated, even for unused states.
Not suitable for very large inputs or sparse state spaces.


✨ Timelines✨
00:00 - Introduction
0:45 - Motivation
1:47 - Problem Explanation
4:51 - Notice
5:46 - Thought Process + Tree Diagram
14:27 - Coding Brute Force
16:51 - 2 Ways to Memoize
28:37 - Coding Memoization

#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-01-04Introduction | What | How | Difference Array Technique: Concepts & Questions - 1 | codestorywithMIK
2025-01-02But bhai….
2025-01-02Number of Ways to Split Array | Simple Thought Process | Leetcode 2270 | codestorywithMIK
2025-01-02Maximum Non Negative Product in a Matrix | Recursion | Memo | Bottom Up | Leetcode 1594 |DP On Grids
2025-01-01Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK
2024-12-312025 Placement Roadmap | How I Would Have Prepared | Year 2025 Special | Happy New Year
2024-12-31What is special about year 2025 ?
2024-12-27Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK
2024-12-26Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK
2024-12-26Unique Paths II | Recursion | Memo | Bottom Up | Leetcode 63 | DP On Grids | codestorywithMIK
2024-12-25Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code
2024-12-24Find Building Where Alice and Bob Can Meet | Segment Tree Concepts & Qns | Video 11 | Leetcode 2940
2024-12-24Range Maximum Index Query | Part 2 | Segment Tree Concepts & Qns | Video 10 | codestorywithMIK
2024-12-24Find Minimum Diameter After Merging Two Trees | Leetcode 3203 | Graph Concepts & Qns - 45 | MIK
2024-12-24Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts & Qns - 44 | MIK
2024-12-23Range Maximum Index Query | Part 1 | Segment Tree Concepts & Qns | Video 9 | codestorywithMIK
2024-12-23Thank You For The Trust 🙏❤️🥺
2024-12-23Minimum Number of Operations to Sort a Binary Tree by Level | Leetcode 2471 | 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