The ultimate guide to coding interviews. Developed by FAANG engineers. Boost problem-solving skills with number theory, dynamic programming, and graph theory. Get interview-ready in just a few hours.

Competitive Programming - Crack Your Coding Interview.png

Whether you’re gearing up for online coding challenges, code-a-thons, or interviews, then this course is for you. With this course, you will solidify your problem-solving skills ensuring a swift sail through any problem. 


You will be tasked with solving some of the most frequently asked questions that are brought up in FAANG interviews. You will start with the concepts of Number Theory and Divide and Conquer, and gradually move towards more complex problems like dynamic programming and graph theory.


With each problem you solve, there will be insightful explanations and full implementation details to really hammer home the concepts. By the time you finish this course, you will have the confidence to solve any problem, no matter the difficulty.

Competitive Programming - Crack Your Coding Interview, C++

# Spanning trees

Given an undirected and connected graph **G = (V, E)**, a spanning tree of the graph **G** is a tree that spans
**G** (*it includes every vertex of **G***) and is a sub-graph of **G** (*every edge in the tree belongs to **G***)

# Minimum spanning trees

The cost of the spanning tree is the sum of the weights of all the edges in the tree. There can be many spanning trees. A *minimum spanning tree* is a spanning tree where the cost is minimum among all the spanning trees. There can also be many minimum spanning trees. A minimum spanning tree has direct application in the design of networks. It is used in algorithms
approximating the traveling salesman problem, multi-terminal minimum cut problem, and the minimum cost
weighted perfect matching problem. Other practical applications are:
1. Cluster Analysis 
2. Handwriting recognition 
3. Image segmentation

There are two famous algorithms for finding the minimum spanning tree:
* *Kruskal's Algorithm*
* *Prim's Algorithm*

Let's look at an example.

Learn the concept of spanning and minimum spanning trees.

Overview

Number Theory

Number Theory

Divide and Conquer

Greedy Algorithms

Greedy Algorithms

Recursion and Backtracking

Recursion and Backtracking

Dynamic Programming

Graphs

Bonus Lessons

What Are Minimum Spanning Trees?

Spanning trees