Learn how different dimensions are used in convolutional neural networks.
Search Results for: complexity
Linear Search vs Binary Search
A quick and practical overview of differences between linear and binary search.
Finding the Lowest Common Ancestor of Two Nodes in a Binary Tree
Learn how to solve the Lowest Common Ancestor problem of two nodes in a binary tree.
Finding the Maximum-Minimum Capacity for a Node in a Graph
A quick and practical guide to finding the Maximum-Minimum capacity for a node in a graph.
Longest Palindromic Subsequence With Dynamic Programming
A quick and practical explanation of the longest palindromic subsequence problem.
Implement Stack Using Two Queues
Learn how to implement a Stack data structure using two Queues.
Minimum Spanning Tree vs Shortest Path Tree
Learn the difference between Minimum Spanning Trees and Shortest Path Trees
Inadequacy of Linear Models: the Road to Nonlinear Functions
Explore the differences between linear and nonlinear problems, and how the former are inadequate in dealing with complex nonlinear problems.
Knuth-Morris-Pratt Algorithm
Learn about the Knuth-Morris-Pratt algorithm that searches for occurrences of a word inside a large text
Connected Components in a Graph
Explore a simple definition of connected component followed by a couple of simple and easy to understand examples