🔥🔥🔥

Hi Professor Kapoor, why wouldn't the printing of the set be =.c 50, a 40, b 30? I'm a little bit confused about how the printing order for the unordered set works

Line 18 in the adjacency list implementation is amazing. Creating a new key-value pair using just square bracket operators, and then initializing the value to an empty vector using just a pair of empty curly brackets. C++ is great.

For those who may have been confused like I was at 6:45. From the definition of the operation, the Node required is passed to AddBefore(). The operation does not need to find the required Node. Then, as explained prior to 6:45, insertion into a doubly linked list takes constant time.

If anyone needs to access the links, here they are: cplusplus.com/reference/map/map cplusplus.com/reference/unordered_map/unordered_map

If anyone needs to access the links, here they are: cplusplus.com/reference/set/set/ cplusplus.com/reference/unordered_set/unordered_set/ onlinegdb.com/SyMCuHOlD

It looks like the link in the video doesn't lead to anything: onlinegdb.com/BJGAP7151