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.

Programming

Hindi

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

Competitive Programming

Heaps & Priority Queues

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.

Hashing

Divide and Conquer (in Hindi)

Kadane's Algorithm (in Hindi)

Binary Heaps (in Hindi)

Interview Questions on Heaps (in Hindi)

Hashing (in Hindi)

Hashing Implementation and Collision avoidance techniques

Hashing Implementation (in Hindi)

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

Surya Teja Achanta

This course gives a detail introduction to binary trees, binary search trees, heaps etc. with some of the best examples and applications.

Trees and Heaps

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++.

Introduction to Graph Theory

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.

Lessons

6 lessons • 1h 4m

Invalid Date

NaN

Divide and Conquer (in Hindi)

Invalid Date

NaN

Kadane's Algorithm (in Hindi)

Invalid Date

NaN

Binary Heaps (in Hindi)

Invalid Date

NaN

Interview Questions on Heaps (in Hindi)

Invalid Date

NaN

Hashing (in Hindi)

Invalid Date

NaN

Hashing Implementation (in Hindi)