Introduction to Sorting and Searching
In this session, we'll discuss and analyze the various sorting techniques. With selection sort and bubble sort forming the starting point, we'll delve deeper into the techniques of divide and conquer employed in merge sort and quick sort. We'll discuss the concepts of stability in sort, in-place sorting, and many more.
Jun 26, 2021 • 2h 0m
Live Problem Solving on Dynamic Programming
In this interactive session, we are going to solve some excellent problems on Dynamic Programming. The focus will be on the beginner-intermediate level, to work towards the strong foundation into the subject.
Jun 27, 2021 • 2h 15m
Introduction To Square Root Decomposition
In this class, I will introduce the Square Root Decomposition (a query optimisation technique) from the very basics and deep dive into the theory and implementation of Array Square Root Decomposition.
Jun 27, 2021 • 2h 10m
Live Problem Solving on Square Root Decomposition
In this session, we'll discuss the variety of problems that can be solved efficiently using square root decomposition. The analysis of competing approaches shall be a part of the session, and shall be followed by necessary coding implementations.
Jun 27, 2021 • 2h 0m