Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Lecture 75: Heaps in C++ || Interview Questions || Part - 1
Play lesson

Complete C++ Placement DSA Course - Lecture 75: Heaps in C++ || Interview Questions || Part - 1

5.0 (1)
8 learners

What you'll learn

This course includes

  • 96.3 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

In this Video, we are going to solve a lot of Problems based on Binary Heaps. There is a lot to learn, Keep in mind “ Mnn bhot karega k chor yrr apne se nahi hoga ya maza nahi aara, Just ask 1 question “ Why I started ? “ Newton School's Grand Coding Contest: https://bit.ly/GrandContest2022_LB Discord Server Link: https://discord.gg/feSQvVXMrd Course Flow: https://whimsical.com/dsa-4-placement-by-love-babbar-C7JX2fJ8hprv9ivEHkArjD@2Ux7TurymNF9zkFahVLk Notes Link: https://drive.google.com/drive/folders/1q4y9wbRsN3A-20hsv_jNRe0382nRMq0_?usp=sharing Slides Link: https://drive.google.com/file/d/1mZPztxUBRx3YTzQPpzfIcctQXZ9TY0RV/view?usp=sharing Code Links: https://github.com/loveBabbar/CodeHelp-DSA-Busted-Series Questions Links: - Kth Smallest element: https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1/# - Merge 2 Heaps:https://practice.geeksforgeeks.org/problems/merge-two-binary-max-heap0144/1# - Is Tree a Heap: https://practice.geeksforgeeks.org/problems/is-binary-tree-heap/1# - Min Cost of "n" ropes:https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes-1587115620/1 - Convert BST into HEAP: https://www.geeksforgeeks.org/convert-bst-min-heap/ Do provide you feedback in the comments, we are going to make it best collectively. Connect with me here: Instagram: https://www.instagram.com/lovebabbar1/ Twitter: https://twitter.com/lovebabbar3 Telegram Group Link: Love Babbar CODE HELP https://telegram.me/lovebabbercodehelp My Editor: https://www.instagram.com/rishu.rsingh/?hl=en Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used. Timestamps: 00:00 - Question 1 02:59 - Promotion 05:03 - Approach #1 07:00 - Approach #2 13:50 - Code 18:50 - Question 2 20:30 - Approach 28:20 - Code 38:30 - Question 3 39:14 - Approach 40:44 - Code 48:40 - Question 4 50:20 - Approach 52:10 - Code 55:55 - Question 5 57:50 - Approach #DSABusted #LoveBabbar

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

FAQs

Course Hive
Download CourseHive
Keep learning anywhere