Explore >> Select a destination
|
You are here 
|
miparnisariblog.wordpress.com | ||
| | | | |
www.techinterviewhandbook.org
|
|
| | | | | The best practice questions to prepare for algorithmic coding interviews by the author of Blind 75 spread across a 5-week schedule | |
| | | | |
zietlow.io
|
|
| | | | | Basic data structure and algorithms implemented within go | |
| | | | |
blog.nuculabs.de
|
|
| | | | | Introduction A linked list is a fundamental data structure which consists of Nodes that are connected to each other. Other variations are: Double linked list Circular linked list (circular buffer) The Singly Linked List To visualize the data structure, if you want to store two integers 10 and 20 you will have a 2 node linked list that will have: [Node 1, Value 10] -> [Node 2, Value: 20] -> [null] | |
| | | | |
henrikwarne.com
|
|
| | | I recently finished the Coursera course Algorithms: Design and Analysis, Part 2 by Professor Tim Roughgarden of Stanford.I've already reviewed part 1, and here are my thoughts on the second part. The main theme of part 1 was the divide and conquer paradigm. In the second part the main themes were greedy algorithms, dynamic programming... | ||
