Explore >> Select a destination
|
You are here 
|
ugross.dev | ||
| | | | |
bannalia.blogspot.com
|
|
| | | | | In a previous entry we have introduced the data structure levelorder_vector , which provides faster binary search than sorted vectors (... | |
| | | | |
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] | |
| | | | |
miparnisariblog.wordpress.com
|
|
| | | | | PatternDescriptionExample usagesWorks onTwo pointersIterate over an array or multiple arrays to achieve some goal, faster than O(n^2)Finding palindromes, merging two arrays, subsequences in stringsUnsorted arrays, sorted arrays, stringsSliding windowFind a subarray that satisfies some numerical constraint. (If the constraint involves counting, use a hashmap).Add elements from the right until the constraint is broken, then remove... | |
| | | | |
www.techinterviewhandbook.org
|
|
| | | Study guides for coding interviews with focus on data structures and algorithms, including practice questions, techniques, time complexity and recommended resources | ||
