Learn how to represent a polynomial with the linked list data structure.
Gang Wu has over 15 years of experience as a software developer in multiple industries. He is proficient in software design and implementation with various programming languages, such as Java, C++, C#, etc. For the past five years, he has been working on web applications with Java technologies. When he is not writing code, he enjoys playing games and watching movies with his family.
Here's what I've written (so far):
Learn algorithms to serialize and deserialize a binary tree
Learn how to use both Dijkstra’s algorithm and the uniform-cost search algorithm to find the shortest paths between vertices in a graph
Learn about the ways to quantify the similarity of strings
Learn two linear-time algorithms that can check if a linked list is a circular linked list
Have a look at the algorithm for reversing a linked list.
Learn how to check whether a binary tree structure is symmetric, using either a recursive solution or an iterative approach.
Learn how to make a topological sort on a DAG in linear time
Learn the difference between Minimum Spanning Trees and Shortest Path Trees