📖

Data Structures & Algorithms

The word algorithm itself is derived from the name of the 9th-century mathematician Muḥammad ibn Mūsā al-Khwārizmī, whose nisba (identifying him as from Khwarazm) was Latinized as Algoritmi.
‣
How do you find the shortest path in an undirected graph?
‣
How would you find the shortest path in a weighted directed graph (with non-negative weights)?
‣
How would you find the shortest paths to all vertices weighted directed graph with positive and negative from a single source?
‣
How would you find the shortest paths between all pairs of vertices in a weighted directed graph?
‣
How do you find a negative cycle in a weighted directed graph?
‣
What is the decision tree model?
‣
What is the binary search tree property?
‣
What is a tree? What are the properties of a tree?
‣
What is unpacking in python?
‣
An undirected acyclic connected graph is a ____. If the number of vertices n > 1, how many edges should this ____ have?
‣
What is a loop invariant
‣
Why would you use an Adjacency list over a matrix to represent a graph?
‣
How do you transpose a matrix in python?
‣
What are the different ways graphs can be represented?
‣
Anki todos

Algorithm

NameTagsFiles
AlgorithmGraphSearch
Data StructureBST
AlgorithmSorting
AlgorithmGraph
AlgorithmSorting
AlgorithmGraphSearch
Data Structure
Data StructureLinkedList
AlgorithmSorting
AlgorithmTree TraversalTree
AlgorithmSorting
AlgorithmTree TraversalTree
Data StructureLinkedList
AlgorithmSorting
Data StructureHeap
AlgorithmTree TraversalTree
AlgorithmTree TraversalTree
Data Structure
AlgorithmSorting
AlgorithmSorting
AlgorithmGraph
AlgorithmGraph
Dynamic Programming
Search