Learn how to store a graph in memory.

## Here's what I've written (so far):

### Solving Binary Gap Using Recursion

Filed under Algorithms

A quick and practical example of solving Binary Gap using recursion.

### Longest Increasing Subsequence Using Dynamic Programming

Filed under Algorithms, Programming

Learn the dynamic programming approach for the longest increasing subsequence programming problem.

### Clustering Into an Unknown Number of Clusters

Filed under Algorithms, Data Science

Understand clustering algorithms that may apply when we don’t know how many clusters there will be

### Methods of Depth First Traversal and Their Applications

Filed under Graph Traversal

Explore depth-first traversal methods and learn about their applications in the real world.

### Logarithmic Time Complexity

Filed under Algorithms, Core Concepts

Explore the use of logarithmic time complexity in computer science.

### P, NP, NP-Complete and NP-Hard Problems in Computer Science

Filed under Algorithms, Core Concepts

Explore the famous problem in computer science.

### Common and Useful Data Structures

Filed under Data Structures, Graph Theory

Explore common data structures that are useful in programming.

### What is a Closure – Different Types of Scopes

Filed under Programming

Learn about closures, one of the most important topics when preparing for an interview.

### Code Coverage

Filed under Programming

Learn what code coverage term means and analyze various ways to measure it.