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++

# Problem statement
You are given the height and width of a field with the location of towers that guard the horizontal and vertical lines corresponding to their positions, where no two towers share a row or a column. Find out the largest unbounded area (the white rectangle).

In the example given below, we have a height of **6** and a width of **8**. We also have **3** tower places. The largest unbounded area is **6** units.

# Solution: **Greedy approach**
Given width **w** and height **h** of the field and the coordinates of the towers as (${x_1}$,${y_1}$), ... , (${x_n}$, ${y_n}$), we split all the x-coordinates and y-coordinates into two different lists and sort them.

Then, we calculate the empty spaces like `dx[]` = [${x_1}$, (${x_2}$ - ${x_1}$), ... (${x_n}$ - ${x_{n-1}}$), (w + 1) - ${x_n}$]. We calculate the same for y-coordinates.

Then, we multiply `max(dx) - 1` by `max(dy) - 1` to get the maximum uncovered rectangle. We subtract `1` from both because the line covered by the higher coordinate tower is included in it, but it is covered (tower covers the row and column in which they are present).

Let us now move on to the implementation.

Solve another interesting problem based on the Greedy approach.

Overview

Number Theory

Number Theory

Divide and Conquer

Greedy Algorithms

Greedy Algorithms

Recursion and Backtracking

Recursion and Backtracking

Dynamic Programming

Graphs

Bonus Lessons

Defense of a Kingdom Problem

Problem statement

Solution: Greedy approach