Join us for an AMA with Riya Bansal and Sanket Singh where they will be discussing tips and tricks for Placement Strategies for Intern and FTE Roles and answer any questions that the viewers might have. To join the AMA, visit https://bit.ly/3kTc0ka
Drop your questions for the AMA here: https://docs.google.com/forms/d/e/1FAIpQLSfkut38_56rzRz_cffYbcIpbKaMHn_HERR1WcpWzLdvrSKC8g/viewform
Drop your questions for the AMA here: https://docs.google.com/forms/d/e/1FAIpQLSfkut38_56rzRz_cffYbcIpbKaMHn_HERR1WcpWzLdvrSKC8g/viewform
Unacademy
AMA by Sanket & Riya | Unacademy
In this class, Riya Bansal and Sanket Singh will be discussing tips and tricks for Placement Strategies for Intern and FTE Roles and answer any questions that the viewers might have.
A two-time ICPC and Google Code Jam world finalist. An Angel Investor. Co-Founder and CTO @ Rippling.
Catch an information-packed AMA session with the man himself, Prasanna Sankar and shoot away all your questions on November 22, 11 AM IST sharp, at #ConversationsWithCodeChef.
Register Now: https://bit.ly/3pLLUn0
Catch an information-packed AMA session with the man himself, Prasanna Sankar and shoot away all your questions on November 22, 11 AM IST sharp, at #ConversationsWithCodeChef.
Register Now: https://bit.ly/3pLLUn0
Join us for Day 3 of the Indian Programming Camp:
Div 1 (Advanced Level) - The first class is scheduled for 12 PM on FFT and Variants by Nishchay Manwani. Nishchay is a seven star coder on CodeChef and International Grandmaster on Codeforces. To join the class, visit https://bit.ly/2ISxHDP
Div 2 (Intermediate Level) - The first class is scheduled for 12 PM on Queries on Trees by Tanuj Khattar. This class will focus on techniques to solve problems involving path query & updates or subtree query & updates. To join the class, visit https://bit.ly/3pRoexu
Div 3 (Beginner Level) - The first class is scheduled for 11:55 AM on Recursion and Backtracking by Sanket Singh. In this class, we will take a problem-solving approach to learn about Recursion and Backtracking. To join the class, visit https://bit.ly/2UQnACh
Div 1 (Advanced Level) - The first class is scheduled for 12 PM on FFT and Variants by Nishchay Manwani. Nishchay is a seven star coder on CodeChef and International Grandmaster on Codeforces. To join the class, visit https://bit.ly/2ISxHDP
Div 2 (Intermediate Level) - The first class is scheduled for 12 PM on Queries on Trees by Tanuj Khattar. This class will focus on techniques to solve problems involving path query & updates or subtree query & updates. To join the class, visit https://bit.ly/3pRoexu
Div 3 (Beginner Level) - The first class is scheduled for 11:55 AM on Recursion and Backtracking by Sanket Singh. In this class, we will take a problem-solving approach to learn about Recursion and Backtracking. To join the class, visit https://bit.ly/2UQnACh
Join us for an AMA with Tanuj Khattar & Nishchay Manwani at 3 PM today. In this session, they will share their journey of becoming an ICPC World Finalist and International GrandMaster on Codeforces. To join the AMA, visit https://bit.ly/337lL8o
You can also drop your questions for the AMA here: https://bit.ly/3nNpoZe
The AMA session will be followed by interactive classes at 4 PM for all divisions:
Div 1 (Advanced Level): This class will be on 'Persistent Centroid Decomposition' by Tanuj Khattar. He'll begin by looking at a hard problem and show how it can be easily solved by performing Centroid Decomposition on the given tree. To join the class, visit https://bit.ly/3fozooL
Div 2 (Intermediate Level): This class on 'DFS and BFS Spanning Trees' will be taken by Pulkit Chhabra. In this class, Pulkit will be discussing depth-first search and breadth-first search spanning trees for graphs. The session will be conducted in English. To join the class, visit https://bit.ly/2IOxGkP
Div 3 (Beginner Level): This class on 'Introduction to Dynamic Programming' will be taken by Arjun Arul. It will cover the basics of dynamic programming from scratch. We will focus on the general principles behind DP by looking at some of the classical DP problems. To join the class, visit https://bit.ly/3kUU9cE
You can also drop your questions for the AMA here: https://bit.ly/3nNpoZe
The AMA session will be followed by interactive classes at 4 PM for all divisions:
Div 1 (Advanced Level): This class will be on 'Persistent Centroid Decomposition' by Tanuj Khattar. He'll begin by looking at a hard problem and show how it can be easily solved by performing Centroid Decomposition on the given tree. To join the class, visit https://bit.ly/3fozooL
Div 2 (Intermediate Level): This class on 'DFS and BFS Spanning Trees' will be taken by Pulkit Chhabra. In this class, Pulkit will be discussing depth-first search and breadth-first search spanning trees for graphs. The session will be conducted in English. To join the class, visit https://bit.ly/2IOxGkP
Div 3 (Beginner Level): This class on 'Introduction to Dynamic Programming' will be taken by Arjun Arul. It will cover the basics of dynamic programming from scratch. We will focus on the general principles behind DP by looking at some of the classical DP problems. To join the class, visit https://bit.ly/3kUU9cE
Join us for an AMA with Riya Bansal at 6:30 PM today. In this session, she will share her journey into the world of programming and share tips and tricks to learn in the best way possible and answer any questions that the viewers might have. To join the AMA, visit https://bit.ly/2UR1tvy
You can also drop your questions for the AMA here: https://bit.ly/2IZExaT
We also have interactive classes scheduled at 7 PM for all divisions:
Div 1 (Advanced Level): This class will be on 'DP Optimizations' by Arjun Arul. This class will focus on some of the optimization techniques like Divide and Conquer, Convex Hull Trick, 1D1D Optimization and Knuth's Optimizations. To join the class, visit https://bit.ly/2IXCVy8
Div 2 (Intermediate Level): This class on 'Basic/Intermediate number theory' will be taken by Surya Kiran Adury. This class will cover topics which are basic/intermediate in Number theory like modular arithmetic, Fermat's theorem, Euler totient function, finding GCD using Euclidean method. To join the class, visit https://bit.ly/332E8eP
Div 3 (Beginner Level): This class on 'Introduction to Graph Theory' will be taken by Tanuj Khattar. In this lecture, we'll introduce the concept of graphs and discuss some basic problems and c++ implementation. To join the class, visit https://bit.ly/2UOE8ul
You can also drop your questions for the AMA here: https://bit.ly/2IZExaT
We also have interactive classes scheduled at 7 PM for all divisions:
Div 1 (Advanced Level): This class will be on 'DP Optimizations' by Arjun Arul. This class will focus on some of the optimization techniques like Divide and Conquer, Convex Hull Trick, 1D1D Optimization and Knuth's Optimizations. To join the class, visit https://bit.ly/2IXCVy8
Div 2 (Intermediate Level): This class on 'Basic/Intermediate number theory' will be taken by Surya Kiran Adury. This class will cover topics which are basic/intermediate in Number theory like modular arithmetic, Fermat's theorem, Euler totient function, finding GCD using Euclidean method. To join the class, visit https://bit.ly/332E8eP
Div 3 (Beginner Level): This class on 'Introduction to Graph Theory' will be taken by Tanuj Khattar. In this lecture, we'll introduce the concept of graphs and discuss some basic problems and c++ implementation. To join the class, visit https://bit.ly/2UOE8ul
The most popular short challenge, the November Cook-Off is here. With coders participating from 180+ countries, this contest is open for all coding enthusiasts from any part of the world. To participate, visit https://bit.ly/3352VPu
In this micro-course, Sanket will be discussing in-depth concepts of Disjoint Set Union Data Structure. The first class of the course, scheduled at 9 PM IST today, will comprise of Introduction to Disjoint Set Union, different ways of implementation and basic problems.
To join the class, visit https://unacademy.com/a/disjoint-set-union
To join the class, visit https://unacademy.com/a/disjoint-set-union
In these three classes, we will start from beginner level graph discussion to advance level problem solving with graphs. The course will include coding implementations for the data structure and assignment problems as well.
To join the course, visit https://unacademy.com/a/course-on-graphs
To join the course, visit https://unacademy.com/a/course-on-graphs
Forwarded from CC LEARNDSA Series Updates
We would like to thank the participants of the Indian Programming Camp 2020 for making it a success. It was indeed an immersive learning experience. Hope you enjoyed it as much as we did. In case you missed, you can always go to your Unacademy account and watch the recorded sessions.
Div 1 (Advanced Level) - https://unacademy.com/a/i-p-c-advanced-track
Div 2 (Intermediate Level) - https://unacademy.com/a/i-p-c-intermediate-track
Div 3 (Beginner Level) - https://unacademy.com/a/i-p-c-beginner-track
We would love to hear your feedback on the Camp. It would take just 2 minutes of your time, and we could ensure to have an improved next edition.
Div 1 (Advanced Level) - https://unacademy.com/a/i-p-c-advanced-track
Div 2 (Intermediate Level) - https://unacademy.com/a/i-p-c-intermediate-track
Div 3 (Beginner Level) - https://unacademy.com/a/i-p-c-beginner-track
We would love to hear your feedback on the Camp. It would take just 2 minutes of your time, and we could ensure to have an improved next edition.
Forwarded from CC LEARNDSA Series Updates
Forwarded from CC LEARNDSA Series Updates
On a scale of 1-5, how did you like the camp? (5 being the highest)
Final Results
36%
5
38%
4
11%
3
6%
2
9%
1
Forwarded from CC LEARNDSA Series Updates
Which division did you participate in?
Final Results
14%
Division 1 - Advanced
42%
Division 2 - Intermediate
44%
Division 3 - Beginner
Forwarded from CC LEARNDSA Series Updates
Which session did you like the most? (Div 1)
Final Results
33%
Persistent Data Structures
27%
Linear Algebra
20%
Introduction to Bioconnectivity
32%
Suffix Arrays
27%
Centroid Decomposition
22%
Introduction to Flows
20%
FFT and Variants
24%
Segment Tree Beats
45%
DP Optimizations
Forwarded from CC LEARNDSA Series Updates
Which session did you like the most? (Div 2)
Final Results
28%
Introduction to Trees
27%
Introduction to Segment Trees
28%
Introduction to Game Theory
45%
Intermediate Dynamic Programming
28%
String Hashing
29%
Square Root Decomposition
23%
Queries on Trees
26%
DFS and BFS Spanning Trees
30%
Basic/Intermediate Number Theory
Forwarded from CC LEARNDSA Series Updates
Which session did you like the most? (Div 3)
Final Results
24%
Basic Programming Constructs and Problem Solving
17%
Introduction to Complexity Theory
24%
Basic Mathematics
26%
Stacks and Queues
21%
Sorting & Searching
44%
Mastering C++ STL
27%
Recursion and Backtracking
29%
Introduction to Dynamic Programming
24%
Introduction to Graph Theory
Forwarded from CC LEARNDSA Series Updates
Which AMA session did you like the most?
Final Results
43%
Importance of CP for getting into FAANG companies - Surya Kiran and Pulkit Chhabra
16%
IOI and CP for school students - Sidhant Bansal and Arjun Arul
45%
Placement Strategy for intern and FTE roles - Riya Bansal and Sanket Singh
29%
From CP Expert to an ICPC World Finalist - Nishchay Manwani and Tanuj Khattar
22%
Women in Competitive Programming - Riya Bansal
The 2nd class of the course on 'Disjoint Set Union' starts at 9 PM IST today. This session will comprise of implementation of offline queries with disjoint set union. To join, visit https://unacademy.com/a/disjoint-set-union
The 2nd class of this course will focus on a lot of problems that can be solved using Breadth First Traversal and Depth First Traversal. Join the session at 9 PM IST today: https://unacademy.com/a/course-on-graphs
It’s time to test your programming aptitude. Take part in the 60-minute MCQ style CodeChef Programming Aptitude League today at 3 PM IST, and stand a chance to win exciting prizes.
Enroll Now: https://bit.ly/36e76Ku
Enroll Now: https://bit.ly/36e76Ku
The third class of the course on Disjoint Set Union will comprise of problem-solving with Disjoint Set Union data structure. Don't forget to join the session at 9 PM IST today.
https://unacademy.com/a/disjoint-set-union
https://unacademy.com/a/disjoint-set-union