Рет қаралды 2,616
JOIN OUR DISCORD COMMUNITY: / discord
In this video we are solving a Hard level Microsoft interview question dealing with graphs: Longest Path with Different Adjacent Characters (Leetcode 2246).
This question is actually not that hard for a hard level question, it really should be more of a medium. I'm not sure why it's rated a hard when there are medium tree questions that are more difficult. It's one of those problems where you need to build a graph from some input and then perform a traversal on that graph to get the final solution.
TIMESTAMPS
00:00 Intro
00:20 Question Prompt
01:05 Basic Example
02:35 Solution Intuition
06:20 Coding
10:28 Time/Space Complexity
11:15 Outro