Algo ++

Home » Algo++
Programming and coding
OVERVIEW

Webocity Labs presents an Advanced course on Data Structures and Algorithms – Algo++. The course is for all those who aspire to gain expertise in DS and Algo, or are appearing for their internship/placement procedure. The course will involve rigorous practice of questions based on Sorting, Searching, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programmingalong with comprehensive revision of data structures like linked-lists, Trees, Graphs, Heaps, Hashing etc. The course will help you become smarter with solutions and ace your programming interviews.

Programming and coding
COURSE CONTENTS

Recursion & Backtracking
________________________________________
The course will start with complex recursion and back-tracking problems. You will be able to think recursively and implement the same in your code. You will be able to solve recursion & back-tracking problems.
• Recursion
• Back-tracking
• Space Time Complexity Analysis

Foundational DS
________________________________________
We begin our journey by building a strong foundation for Data Structures.
• Arrays & Bitmasking, Vectors
• Stacks, Queues Problems
• Linked Lists

Sorting, Searching and Hashing
________________________________________
We will learn various sorting and searching algorithms, we will learn to use Hashtables and solve various problems on the same. We will also see various variants of Binary Search.
• Divide & Conquer
• Sorting Algorithms
• Binary Search Variants
• Bitmasking and Hashing

Advanced Data Structures
________________________________________
In this part we learn about how to solve complex problems using data structures.
• Stacks, Queues, Linked Lists
• Trees & Tries
• Graphs
• Heaps and Priority Queues
• Binary Search Trees

DP vs Greedy Techniques
________________________________________
This is the most important challenging part. Most students find DP problems tough to solve, with ample practice of problems on Dynamic Programming, students will find interview questions easy to solve. We will also see how Greedy algorithms are different from DP and when to use them by solving a number of problems.
• Greedy Techniques
• Dynamic Programming

STL | Interview Problems
________________________________________
At the end of the course we will keep one hackathon on Interview Problems, We will provide you quick booklet on STL so that you can revise C++ Standard Template Library codes.
• Complete C++ STL
• Interview Problems