Cracking SDE interview. Linked lists. Leetcode #19 (easy) task.
Channel: Evergreen's coderzone
Date: 24/11/2016

Cracking SDE interview. Detailed dive into linked lists based on leetcode task.
https://discuss.leetcode.com/topic/71035/2-pointers-in-python-detailed-explanation-with-video
https://leetcode.com/problems/remove-nth-node-from-end-of-list/ Remove n-th node from the end of the linked list

Links helping you to prepare for interviews:
* https://blog.codinghorror.com/getting-the-interview-phone-screen-right/
* http://steve-yegge.blogspot.com.es/2008/03/get-that-job-at-google.html
* https://www.hackerrank.com/domains/tutorials/cracking-the-coding-interview
* https://www.facebook.com/notes/facebook-engineering/get-that-job-at-facebook/10150964382448920/
* https://www.facebook.com/notes/facebook-engineering/preparing-for-a-technical-interview-with-programming-contests/10151298476823920/
* http://www.inc.com/justin-bariso/it-took-sheryl-sandberg-exactly-2-sentences-to-give-the-best-career-advice-youll.html

Decent programming books:
* https://en.wikipedia.org/wiki/Introduction_to_Algorithms
* https://www.amazon.com/Building-Microservices-Designing-Fine-Grained-Systems/dp/1491950358