Google Coding Interview question #1 | Linked list Components | FAANG | Leetcode | Using python
Hey Guys ,
In this video you can learn a problem that was asked in google coding interview.
Problem Statement:
We are given head, the head node of a linked list containing unique integer values.
We are also given the list G, a subset of the values in the linked list.
Return the number of connected components in G, where two values are connected if they appear consecutively in the linked list.
Problem link: https://leetcode.com/problems/linked-...
My code link: https://github.com/praveenstark6/code...
Try it yourself.
If you like the video give it a THUMBS UP!
and SUBCRIBE FOR MORE VIDEOS
If you have any suggestions you can let me know in comments.
Thanks for watching!
Watch video Google Coding Interview question #1 | Linked list Components | FAANG | Leetcode | Using python online without registration, duration hours minute second in high quality. This video was added by user Code Nop 24 February 2021, don't forget to share it with your friends and acquaintances, it has been viewed on our site 1,57 once and liked it 3 people.