Тёмный

LeetCode  

Algo Engine
Подписаться 9 тыс.
Просмотров 13 тыс.
50% 1

Опубликовано:

 

18 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 15   
@jasperahn9282
@jasperahn9282 Год назад
this is the only channel i trust to provide the best tutorials for leetcode
@DHAiRYA2801
@DHAiRYA2801 Год назад
This is incredible content mate, keep up this quality and you'll definitely have a huge audience in the near future.
@OwenWu-f9t
@OwenWu-f9t 8 месяцев назад
way better than neetcode's scribble drawings without animations
@araneuskyuro
@araneuskyuro 2 месяца назад
Great explanation! Thank you
@ismaelmehdid
@ismaelmehdid Месяц назад
very good explanation thanks!
@akashnayakala4654
@akashnayakala4654 Год назад
good explanation easy to understand..
@ferchis2460
@ferchis2460 6 месяцев назад
awesome algorithm! great explanation
@evelyntromp789
@evelyntromp789 2 месяца назад
Amazing, thank you!!
@carljohnson4592
@carljohnson4592 Год назад
I just discovered your channel! i have subbed you
@vladgheorghe4413
@vladgheorghe4413 Год назад
Great explanation, thanks!
@adebayoadebiyi5951
@adebayoadebiyi5951 8 месяцев назад
excellent explanation
@PashoID
@PashoID Год назад
Thanks a lot, but I' m still figuring out why 'fast' wouldn't jump over 'head' and go to the next lap if it's moving by 2 nodes versus head's 1 node. How come it's not happening?
@AlgoEngine
@AlgoEngine Год назад
1:50 With every iteration, the distance between the fast and slow pointer gets reduced by exactly 1 node, never more. So no matter what the initial distance between them is (let's say it's x), the distance between them will eventually converge like this: x --> x-1 --> x-2 --> ... --> 2 --> 1 --> 0, at which point they must meet.
@explicit9677
@explicit9677 Год назад
bro I've seen a lot of your solutions and i wonder how you don't have like a million subs lol
@lonelyteapot
@lonelyteapot 5 месяцев назад
my solution is easier: class Solution:hasCycle=lambda*_:'E' in str(_)