Channel: Gaurav Sen

Category: Education

Tags: software interviewalgorithmsbstinterview preparationgaurav senbinary search treecoding interviewprogrammingrecursioninterviewscombinatorics

Description: Here is an interesting interview question on binary search trees and combinatorics. We discuss an elegant approach to the problem, and see why it works. 00:00 Intro 00:21 Problem Definition 02:14 Examples 04:04 First observation 06:34 Second observation 09:38 Illustrations 11:42 Solution 14:44 Conclusion 15:56 Your favorite ad 😛 Looking to ace your next interview? Try this System Design video course! 🔥 get.interviewready.io Course chapters: 1) Design an email service like Gmail 2) Design a rate limiter 3) Design an audio search engine 4) Design a calling app like WhatsApp 5) Design and code a payment tracking app like Splitwise 6) Machine coding a cache 7) Low level design of an event bus like Kafka The chapters have architectural diagrams and capacity estimates, along with subtitled videos. Use the coupon code of 'earlybird' to get a 20% discount. System Design Playlist: youtube.com/playlist?list=PLMCXHnjXnTnvo6alSjVkgxV-VH6EPyvoX Software Engineering Fundamentals: youtube.com/playlist?list=PLMCXHnjXnTntYbKsUs6Pj8_BO_8ou4y07 You can follow me on: Discord: discord.gg/YByFvURXe3 LinkedIn: linkedin.com/in/gaurav-sen-56b6a941 Github link: github.com/coding-parrot/Low-Level-Design Instagram: instagram.com/applepie404 Quora: quora.com/profile/Gaurav-Sen-6 Twitter: twitter.com/gkcs_ #Combinatorics #Recursion #Algorithms