SDE Amazon, Qualified for ACM ICPC Regionals (KGP & Gwalior 2k17) (Chennai & Amritapuri 2k16).

Adarsh Singh Gaharwar

This is a beginner level course on graph theory and its application. In this course, Adarsh has tried to explain graphs from scratch and explained the basics of graph theory. This course contains 8 lessons. In first 7 lessons he has discussed graph representation and its traversal techniques and in the 8th lesson Adarsh has discussed a famous beginner level problem(BUGLIFE) from SPOJ and implemented it in C++.

Programming

English

Introduction to Graph Theory

Competitive Programming

Graph Theory - I

Intermediate

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

In this lesson, Adarsh has provided a brief on the introduction to graphs and he has also discussed its applications.

An Introduction to Graphs and Its Applications

In this lesson, Adarsh has discussed on how to represent graph using adjacency matrix.

Graph Representation Using Adjacency Matrix

In this lesson, Adarsh has elaborated on how to represent the graph using adjacency matrix.

Graph Representation Using Adjacency List

In this lesson, one will find a comprehensive understanding of one of the Graph traversal technique i.e BFS (Breadth First Search).

Graph Traversal Technique I: BFS (Breadth First Search)

Through this lesson, one will understand the implementation of Breadth First Search in C++.

BFS Implementation in C++

In this lesson, one will find a comprehensive understanding of one more Graph traversal technique i.e DFS (Depth First Search).

Graph Traversal Technique II: DFS(Depth First Search)

Through this lesson, one will understand the implementation of Deapth First Search in C++.

DFS Implementation in C++

In this lesson, Adarsh has explained and implemented a programming problem BUGLIFE from SPOJ .

BUGLIFE (SPOJ): Solution Using BFS

Computer science background. Passionate about solving real life problems through algorithms. Intern at GeeksforGeeks. Freelancer.

Dhiman Mayank

This course covers Divide and Conquer and Binary Heaps and Hashing in detail with problems for computer science students and programming enthusiasts.

(Hindi) Divide and Conquer Algorithm, Binary Heap and Hashing

Shubham Darda

In this course, Shubham has discussed Graph Theory which is nothing but mathematical structures used to model pairwise relations between objects. This course will help not only to gain knowledge but also to solve practical engineering problem. Moreover Graph Theory most  important in AI/ML algorithms.

Graph Theory

Pursuing B.Tech. from Cluster Innovation Centre, and cleared ACM ICPC Asia Amritapuri first round online programming contest. 

Abhishek Sehgal

The students will have a deeper insight of the data structures, linked lists, insertion and deletion of nodes. It covers all the important theoretical concepts and intuition behind the data structures, making it the building blocks for any programming enthusiast. The collection then deals with Stacks, Queues, Recursion Intuition, Binary Trees and Inorder Traversal. We see that Programming is nothing but writing functions/methods to manipulate data. The last part of the collection focuses on an introduction to the Graph, Matrix Representation and understanding Hashing. This collection will give students a complete understanding of the data structures and how and when they should be used.



In-depth And Comprehensive Detail On The Study Of Basic Data Structures

CSE Undergrad in NIT Durgapur. Interested in DS, Algo, Web Dev and food offcourse. 

Arka Roy

The course is about exploring one of the most popular tree implementation in competitive coding –Segment Tree. This course provides you with a hands-on experience about segment trees and its application in varieties of the question asked in competitive coding events. With a good knowledge of segment tree, you are qualified enough to cross that barrier of solving a moderate to difficult range query based question in which a brute force implementation would always land up in Time Limit Exceeded status.

Segment Tree Demystified

Quant Researcher at Algorithm Trading/Computer Science NSIT/Competitive Coding

Shaksham Garg

The course is about a data structure called 'Tree'. This data structures is an important part of the family of data structures. Trees are used to represent hierarchical information. Most commonly used trees are binary tree. They are used as Binary search trees which in turn is used as AVL and Red and Black Tree. Binary search is also based on the concept of searching in bst.

Data Structures and Algorithms - Trees

In this course, Dhiman Mayank has discussed non-linear data structure. He has covered trees, operations on binary search trees, tree deletion, interview questions on trees, AVL trees with insertion, red-black trees, segmented trees, introduction to graphs, and graph representation extensively.

Lessons

8 lessons • 53m

Invalid Date

NaN

An Introduction to Graphs and Its Applications

Invalid Date

NaN

Graph Representation Using Adjacency Matrix

Invalid Date

NaN

Graph Representation Using Adjacency List

Invalid Date

NaN

Graph Traversal Technique I: BFS (Breadth First Search)

Invalid Date

NaN

BFS Implementation in C++

Invalid Date

NaN

Graph Traversal Technique II: DFS(Depth First Search)

Invalid Date

NaN

DFS Implementation in C++

Invalid Date

NaN

BUGLIFE (SPOJ): Solution Using BFS