Jinzi YanDynamic ProgrammingDynamic programming is both a mathematical optimization method and a computer programming method. The method was developed by Richard…Apr 27, 2020Apr 27, 2020
Jinzi YanHash and HeapIn computer science, a heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies the…Apr 19, 2020Apr 19, 2020
Jinzi YanGraph Depth First SearchDepth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node…Apr 12, 2020Apr 12, 2020
Jinzi YanTwo Pointers TechniqueThe two pointer technique is a near necessity in any software developer’s toolkit, especially when it comes to technical interviews. Using…Apr 5, 2020Apr 5, 2020
Jinzi YanBinary Searchbinary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a…Mar 23, 2020Mar 23, 2020
Jinzi YanBreadth First SearchBreadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some…Mar 16, 2020Mar 16, 2020
Jinzi YanTopological SortingTopological sorting or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv…Mar 8, 2020Mar 8, 2020