6.3 Graph Coloring Problem - Backtracking

CORRECTION: at the end of this video, in a MAP, region 1 is also Adjacent to region 4

Graph coloring problem using Backtracking

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

[mahadevawasthi]

Someone give this man a medal 🥇 . He is better than the lecturar of expensive private universities. Hats off to you legend 🔥

[scabbage]

I like how he actually took the effort to draw the last level.

[abhishekslab]

Loved the last part where you told about the origin of this problem, it was something new and really helped to realize why were we doing this : )

[ujwalgupta]

Even though NITs and prestigious state government colleges have the worst faculty.
Without these teachers, I cannot imagine that I could pass the semester exams.

[chepaiytrath]

Looking forward to the day when I post on LinkedIn about my journey to my dream company and I attach your channel as a reference for DP, Backtracking, Algos, etc

[LL-olgr]

Best CS teacher ever, make every topic bite-able.

[ayounghosh]

I feel like I'm giving my fees to the wrong teachers, my college should hire teachers like him instead

[shivammwarambhey]

13:09 Smoothest transition by Abdul Sir so far😅😂. Can't stop going back and checking frame by frame the way sir seems to be in the same place.

[yethishchintu]

Please stop posting comments appreciating Abdul Sir. Everyone already knows he is an excellent teacher. However, subject-related or topic-related comments would be far more helpful and actually needed.

[yhwu]

brilliant storytelling of the historical case where the graph coloring can be applied!

[ankursoni]

The way you gracefully explain the complex problem is just amazing. Thank you for all your hard work. :)

[codeforester]

What an excellent teacher! I feel like I am back in college! Thank you Abdul for educating us.

[benneal]

Your videos are a gift to the world! Thank you

[swatii]

funny thing is my college teacher is making notes from your videos and still could not teach

[chanduyerragundla]

Your an life savior of many btech students in jntu

[abhijeetiyer]

It would be helpful if you provide some pseudo code with the examples and explain in terms with the code too 😁😁
PS:- your videos are really helpful

[arunachhatkuli]

In the coloring of the map there must have to connect node 1 to node 4 because these two are adjacent according to this map.

[brettford]

Your videos have a lot of educational value, thank you so much for sharing. Currently taking Algorithm Design and Analysis

[adipratapsinghaps]

Preparing for upcoming google interviews. Solved an unanswered google problem from geeksforgeeks interview experience with m-colouring optimization algorithm. Had start and end time of meetings in 2 different arrays. Had to compute minimum number of rooms that are required to host all meetings.

Start = [9:00, 9:40, 9:50, 11:00, 15:00, 18:00]
End = [9:10, 12:00, 11:20, 11:30, 19:00, 20:00]

So I created objects with start and end time and treated them as graph nodes. And added edges between nodes with overlapping timings. And finally solved it using m-colour optimization problem. The answer is 3. 😄

[TridibSamanta]

Great ! You are a great Teacher. Thanks for saving my Design and analysis of Algorithm Paper.
#Respect