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

### Finding Three Elements in an Array Whose Sum Is Closest to a Given Number

Learn how to find three elements in an array such that the sum is closest to a given number.

### Calculate the Number of Binary Search Trees with N Distinct Elements

Learn how to calculate the number of possible binary trees from the number of nodes.

### Number of Nodes in a Binary Tree With Level N

Learn how to calculate the minimum and maximum number of nodes in binary trees

### Print All Paths With a Given Sum in a Binary Tree

Learn how to construct a binary tree path sum sequence in linear time

Learn how to represent a polynomial with the linked list data structure.

### Serialize and Deserialize a Binary Tree

Learn algorithms to serialize and deserialize a binary tree

### Comparison Between Uniform-Cost Search and Dijkstra’s Algorithm

Learn how to use both Dijkstra’s algorithm and the uniform-cost search algorithm to find the shortest paths between vertices in a graph

### String Similarity Metrics – Edit Distance

Learn about the ways to quantify the similarity of strings