@Shubham-hd3mp
Timestamp: A - Maximum GCD 18:15 B - Ehab and GCD 34:00 C - Cat Cycle 40:25 D - New Year 53:29 E - Math 01:17:49 F - Meaningless Operations 01:43:49 G - Floor And Mod 02:06:06 H - Enlarge GCD 02:36:50 I - Remainders Game 03:03:30 J - Coprime Subsequences Redux 03:22:30 K - Two Divisors 03:28:25 L - Congruence Equation 03:39:35
@Live-hh6li
These topic stream videos are truly awesome. Please make more of it. I appreciate the work you do.
@prakhargarg4166
TimeSTamps K. Two Divisors 3:28:16 L: Cngruence equaltion: 3:40:00 M: Mocha Stars 4:04:00
@revanthkalavala1829
Problem A. Enlarge GCD *** You need to delete minimal number of integers such that gcd of remaining will be strictly bigger than initial gcd of all integers.
@susankamajumder9859
timestamp would be really helpful to navigate.
@bimokayoba
58:45 u didnt explain, HOW and WHY ? or you just memorize the solution ???
@userpmzjah82
I love topic streams! I plan to do all problems on topic streams and then do virtual contests weekly to get blue/purple
@lightsPP7691
you are just a god to help so much
@Shubh-dl9io
Loved it man, this is some S tier content,, thanks colin
@kushaagra098
Great stream! Also I'm sure if you made some sort of a roadmap it'd do well on youtube because it would definitely help a lot of people out!
@expansion_forever
hello sir can you please elaborate the explanation of question d
@adityasharma4739
how is the pattern 001001001 in the third question
@satish4075
Thanks for the stream 🙏🏻 .
@coding8000
Thanks man. Love from Seattle.
@utkarshsharma5202
Colin When will the next stream come?
@algotalk5368
Love from India u r really hard worker
@learntechgrow4777
Thank you!
@revanthkalavala1829
anyone cares explaining the part in problem G ? or suggesting similar problem or tutorial would be helpful. It looks like standard variation of knapsack ?
@josephwong2832
that took a lot of stamina !!
@yasser_hussain