Week 4 - Level 1 Training 2019

Timestamps:
Complexity: 1:00
Binary Search: 15:00
Ternary Search: 45:30
Week 4 Blog: bit.ly/Week4-Blog
Week 1 Video: • Week 1 - Level 1 Train...
Week 2 Video: • Week 2 - Level 1 Train...
Week 3 Video: • Week 3 - Level 1 Train...
Codeforces Group: codeforces.com/...
Follow us on Facebook: / acmascis

[@abdelrhmansayed340]

ربنا يباركلك ياريت تكمل شرح يبشمهندس استفدت من حضرتك جدا

[@OmarMohamed-le8yn]

ربنا يجازيك خير يا استاذى كل شويه برجعلك افتكر تاني

[@abdelrahmanadel8998]

انت شرحك جامد اوي ماشاء الله ممكن شرح dp

[@abdelrahmanadel8998]

خد قلبي مش عايزه : ) مش اتكمل بقيت algorithms

[@abdelrahmanadel8998]

؟

[@mostafatareck4131]

انت ازاى المسأله الاخيره طلعت معاك من غير متاخد ال abs فى while وكمان فى البودى لما بتجيب التلت

[@sergi1788]

eh lzmt el binary search tree law el input m4 sorted
enta ht3ml sort (min time O(n log(n)) ) +(binary search tree at best case O(log(n))
so the total time complexity is O(n 2log(n))
when if you just iterate over it the total time complexity is just N
sa7 wla ana 5ltan??

[@hanymorad3013]

❤💗

[@omaxshendy5732]

swamps app!!! :)