A quick and practical explanation of differences between tree depth and height.
Search Results for: complexity
Cycles in an Undirected Graph
Learn how to detect cycles in an undirected graph using Depth-First Search (DFS).
Greedy Approach vs Dynamic Programming
Learn the key differences between Greedy Approach and Dynamic Programming.
Graph Data Structures
Learn how to store a graph in memory.
Solving Binary Gap Using Recursion
A quick and practical example of solving Binary Gap using recursion.
Longest Increasing Subsequence Using Dynamic Programming
Learn the dynamic programming approach for the longest increasing subsequence programming problem.
P, NP, NP-Complete and NP-Hard Problems in Computer Science
Explore the famous problem in computer science.
Common and Useful Data Structures
Explore common data structures that are useful in programming.
An Introduction to the Theory of Asymptotic Notations
Understand the concepts behind the theory of the Big-O notation.
Introduction to Supervised, Semi-supervised, Unsupervised and Reinforcement Learning
Discover multiple techniques to apply machine learning in projects.