Algorithms & Data Structures 14.04.2024| Mastering Programming Interviews with Python Graph Algorith
Join us: / discord
---
The speaker shares their experience with programming interviews, discussing specific coding challenges like finding symmetric arrays and visiting all rooms in a building. They highlight the benefits of using Python for handling large numbers. They also talk about assigning values to cities based on the number of connected roads and calculating the maximum total value of all roads. Additionally, they mention sorting cities based on importance values in a directed cyclic graph. The speaker explores algorithms like breadth-first search and recursive approaches for graph traversal, emphasizing the need for optimization and considering alternative methods. They also touch on dividing people into two groups based on dislikes, resembling a bipartite graph. The conversation delves into checking graph bipartiteness using depth-first search and solving problems involving removing edges from a traversable graph for both Alice and Bob. The use of algorithms like BFS and data structures like Union Find is discussed, with a mention of a related homework assignment.
On this page of the site you can watch the video online Algorithms & Data Structures 14.04.2024| Mastering Programming Interviews with Python Graph Algorith with a duration of hours minute second in good quality, which was uploaded by the user Data Lounge 14 April 2024, share the link with friends and acquaintances, this video has already been watched 81 times on youtube and it was liked by 2 viewers. Enjoy your viewing!
