Lowest Common Ancestor in O(logN) | Sparse Table | Binary Lifting
Автор: codingMohan
Загружено: 2022-12-17
Просмотров: 2880
This video explains finding the Lowest Common Ancestor in any tree in O(logN) time. This uses Sparse Table approach which can be used in various different cases like "Finding minimum value from node 'A' to node 'B'".
*************************************************
Practice Problem for LCA - https://www.spoj.com/problems/LCA/
Other practice problems - https://codeforces.com/blog/entry/43917
Topcoder Article - https://www.topcoder.com/thrive/artic...
*************************************************
Interview Experiences Playlists -
Microsoft - • Microsoft Interview Questions
Amazon - • Amazon Interview Questions
D.E.Shaw - • D.E.Shaw Interview Questions
Linkedin - • Linkedin Interview Questions
Facebook - • Facebook (Meta) Interview Questions
*********************************************************************
Please show support and subscribe if you find the content useful.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
