New Tutorials: DB Isolation Levels, Counting Univalued Subtrees, Coloring Problem

We continue to aggressively add content to help you land your dream job. Nothing fancy here: just go through the tutorials, do the work, and improve as a developer.

Database Isolation Levels - Data/information is important for anyone, and databases are responsible for holding that crucial information. Hence, the security, integrity, and consistency of all values within them must be ensured. For this purpose, databases should have some specific properties. This tutorial discusses one such property of them, that of isolation.

Counting Univalued Subtrees - We are given a binary tree. The challenge is to count all the univalued subtrees in the tree. Just to recall, a subtree is any node along with its descendants. The root and all its descendants form the entire tree. A univalued subtree is therefore a subtree in which all the nodes have the same keys.

The Two Coloring Graph Problem - Given a graph, can you use two colors to color each node of the graph, such that no two adjacent nodes have the same color?

These tutorials are free for now, but will eventually be exclusive to premium members. If you like our interactive, visual tutorials, consider getting lifetime access today at our discounted rate-- price goes up sharply Monday night.