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 an empty chessboard of size `N * N`. Find the number of ways to place `N` queens on the board, such that no two queens can kill each other in one move. A queen can move vertically, horizontally, and diagonally.**


## Solution: **Backtracking approach**
The idea is to place queens one by one in different columns, starting from the leftmost column. When we place a queen in a column, we check for clashes with already placed queens. In the current column, if we find a row for which there is no clash, we mark this row and column as part of the solution. If we do not find such a row due to clashes, we backtrack and return `false`.

This is a difficult problem so let's try to understand the approach and see how the backtracking will work.

# Problem statement
**You are given an empty chessboard of size `N * N`. Find the number of ways to place `N` queens on the board, such that no two queens can kill each other in one move. A queen can move vertically, horizontally, and diagonally.**


# Solution: **Backtracking approach**
The idea is to place queens one by one in different columns, starting from the leftmost column. When we place a queen in a column, we check for clashes with already placed queens. In the current column, if we find a row for which there is no clash, we mark this row and column as part of the solution. If we do not find such a row due to clashes, we backtrack and return `false`.

This is a difficult problem so let's try to understand the approach and see how the backtracking will work.

Use the concepts of Recursion and Backtracking to solve one of the most famous coding problems.

Overview

Number Theory

Number Theory

Divide and Conquer

Greedy Algorithms

Greedy Algorithms

Recursion and Backtracking

Recursion and Backtracking

Dynamic Programming

Graphs

Bonus Lessons

N - Queens Problem

Problem statement