Популярное

Музыка Кино и Анимация Автомобили Животные Спорт Путешествия Игры Юмор

Интересные видео

2025 Сериалы Трейлеры Новости Как сделать Видеоуроки Diy своими руками

Топ запросов

смотреть а4 schoolboy runaway турецкий сериал смотреть мультфильмы эдисон
dTub
Скачать

Maximum Running Time of N Computers | Detailed Deep Dive | Dry Run | Leetcode 2141 | MIK

Автор: codestorywithMIK

Загружено: 2023-07-27

Просмотров: 12756

Описание:

Similar Problem -
https://leetcode.com/problems/minimum...
https://leetcode.com/problems/koko-ea...
https://leetcode.com/problems/capacit...
https://leetcode.com/problems/minimum...
https://leetcode.com/problems/magneti...
Allocate Minimum Number Of Pages (https://practice.geeksforgeeks.org/pr...)

Hi everyone, this is the 20th video of our playlist "Binary Search : Popular Interview Problems".
In this video we will try to solve a problem based on a very famous pattern i.e. Binary Search on Answer : Maximum Running Time of N Computers | Detailed Deep Dive | Dry Run | Leetcode 2141 | MIK

We will do live coding after explanation and see if we are able to pass all the test cases.

Problem Name : Maximum Running Time of N Computers | Detailed Deep Dive | Dry Run | Leetcode 2141 | MIK
Company Tags : GOOGLE
My solutions on Github : https://github.com/MAZHARMIK/Intervie...
Leetcode Link : https://leetcode.com/problems/maximum...


My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | Topic...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will no m...  
My Segment Tree Concepts Playlist :    • Segment Tree | Introduction | Basics | Bui...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And Ques...  
Trie Playlist -    • Word Search II | Leetcode 212 | Detailed |...  
Difference Array Technique: Concepts & Qns :    • Introduction | What | How | Difference Arr...  
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Intervie...
Instagram :   / codestorywithmik  
Facebook :   / 100090524295846  
Twitter :   / cswithmik  
Subscribe to my channel :    / @codestorywithmik  

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝


Video Summary :
Approach-1 (Brute Force – Linear Search):
Start from the maximum possible minutes and check downward one-by-one if all computers can run for that duration. For each minute value, simulate whether the total battery capacity can sustain it. This is simple but very slow because every minute in the range is tested.

Approach-2 (Binary Search on Answer):
Instead of checking every minute, binary search on the possible running time. For each mid value, verify if we can support all n computers for mid minutes using available batteries. This drastically reduces checks and makes the solution efficient.


✨ Timelines✨
00:00 Introduction
00:42 Problem Explanation
06:55 Intuition - Brute Force
14:34 Relating to Binary Search on Answer
24:17 Coding it up


#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

Maximum Running Time of N Computers | Detailed Deep Dive | Dry Run | Leetcode 2141 | MIK

Поделиться в:

Доступные форматы для скачивания:

Скачать видео mp4

  • Информация по загрузке:

Скачать аудио mp3

Похожие видео

Minimize the Maximum Difference of Pairs | Intuition | META | Leetcode 2616 | codestorywithMIK

Minimize the Maximum Difference of Pairs | Intuition | META | Leetcode 2616 | codestorywithMIK

1.11 Анализ лучшего, худшего и среднего случая

1.11 Анализ лучшего, худшего и среднего случая

2141. Maximum Running Time of N Computers | Leetcode 2141 | DSA | Hindi | Code With Deepak

2141. Maximum Running Time of N Computers | Leetcode 2141 | DSA | Hindi | Code With Deepak

Максимальное время работы N компьютеров | LeetCode 2141 | Полное интуитивное объяснение

Максимальное время работы N компьютеров | LeetCode 2141 | Полное интуитивное объяснение

LLM fine-tuning или ОБУЧЕНИЕ малой модели? Мы проверили!

LLM fine-tuning или ОБУЧЕНИЕ малой модели? Мы проверили!

Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK

Minimum Time to Repair Cars | With Minute Details | Leetcode 2594 | codestorywithMIK

Best Time to Buy and Sell Stock V | Made Simple | Detailed | Leetcode 3573 | codestorywithMIK

Best Time to Buy and Sell Stock V | Made Simple | Detailed | Leetcode 3573 | codestorywithMIK

Find First & Last Position Of Element In Sorted Array-(LinkedIn, Amazon):Live Coding 🧑🏻‍💻👩🏻‍💻

Find First & Last Position Of Element In Sorted Array-(LinkedIn, Amazon):Live Coding 🧑🏻‍💻👩🏻‍💻

КАК НЕЛЬЗЯ ХРАНИТЬ ПАРОЛИ (и как нужно) за 11 минут

КАК НЕЛЬЗЯ ХРАНИТЬ ПАРОЛИ (и как нужно) за 11 минут

Я плохо разбирался в структурах данных и алгоритмах. И вот что я сделал.

Я плохо разбирался в структурах данных и алгоритмах. И вот что я сделал.

2141. Maximum Running Time of N Computers | 2 Methods to Solve | Leetcode Daily Challenge

2141. Maximum Running Time of N Computers | 2 Methods to Solve | Leetcode Daily Challenge

Daily Leetcode #1213: Jul 27, 2023 - 2141. Maximum Running Time of N Computers

Daily Leetcode #1213: Jul 27, 2023 - 2141. Maximum Running Time of N Computers

How I would learn Leetcode if I could start over

How I would learn Leetcode if I could start over

Алгоритмы и структуры данных за 15 минут! Вместо 4 лет универа

Алгоритмы и структуры данных за 15 минут! Вместо 4 лет универа

Maximum Profit from Trading Stocks with Discounts | Super Detailed | Leetcode 3562 | MIK

Maximum Profit from Trading Stocks with Discounts | Super Detailed | Leetcode 3562 | MIK

LeetCode was HARD until I Learned these 15 Patterns

LeetCode was HARD until I Learned these 15 Patterns

КАК УСТРОЕН TCP/IP?

КАК УСТРОЕН TCP/IP?

How I Approach a New Leetcode Problem (live problem solving)

How I Approach a New Leetcode Problem (live problem solving)

Leetcode 2141 🔥 Maximum Running Time of N Computers | Greedy + Sorting | Optimal Approach + Dry Run

Leetcode 2141 🔥 Maximum Running Time of N Computers | Greedy + Sorting | Optimal Approach + Dry Run

Шаблоны для собеседования по программированию — Префиксная сумма | 10 различных проблем в одном в...

Шаблоны для собеседования по программированию — Префиксная сумма | 10 различных проблем в одном в...

© 2025 dtub. Все права защищены.



  • Контакты
  • О нас
  • Политика конфиденциальности



Контакты для правообладателей: [email protected]