Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK

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



Duration: 0:00
8,607 views
452


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

Hi Everyone, this is the 58th video of our Playlist "Binary Tree : Popular Interview Problems".
Now we will be solving an very good Tree problem based on Lowest Common Ancestor - Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK

We will solve From 2 Pass solution to 1 Pass Solution

Problem Name : Lowest Common Ancestor of Deepest Leaves | 2 Approaches | Leetcode 1123 | codestorywithMIK
Company Tags :
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Tree/Lowest Common Ancestor of Deepest Leaves.cpp
Leetcode Link : https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves


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 Summary:
This method uses a two-pass strategy. In the first pass, it traverses the tree to record the depth of each node and finds the maximum depth. In the second pass, it uses a Lowest Common Ancestor (LCA) style recursive function to identify the node that is the common ancestor of all nodes at the deepest level. This works by backtracking through the tree and checking where the deepest nodes converge.

Approach-2 Summary:
This approach uses a single recursive pass. At each node, it calculates the depth of its left and right subtrees and also keeps track of the node that is the LCA at that depth. If both sides have equal depth, the current node is the LCA. Otherwise, it returns the deeper subtree’s result. This way, it efficiently finds the LCA of the deepest leaves in one traversal.


✨ Timelines✨
00:00 - Introduction
0:22 - Motivation
0:50 - Problem Explanation
3:25 - Recap LCA
10:32 - Approach-1 - Using LCA
20:17 - Good example Dry Run
26:20 - Coding Approach-1
30:58 - Approach-2 (One Pass)
39:04 - Coding Approach-2

#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-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
2025-03-26Minimum Index of a Valid Split | 2 Approaches | Leetcode 2780 | codestorywithMIK
2025-03-25Minimum Operations to Make a Uni-Value Grid | Detailed Simple Maths Proof | Leetcode 2033 | MIK