#
Crack the Coding Interviews

Prepare for technical interviews and learn from handcrafted tutorials and interview questions

**Explore Interview Questions →**

## Programming Tutorials

Learn programming and get technical knowledge from our handcrafted tutorials

## Python Tutorial

A tutorial which will make you expert in Python.

START →

# Latest Articles

Problem Statement The word wrap problem states that given a sequence of words as input, we need to find the number of words that can be fitted in a single line at a time. So, for doing this we put breaks in the given sequence such that the printed document …

Read moreWord Wrap Problem

Problem Statement The Painter’s Partition problem states that we have some fences and we have some painters. We want to minimize the time of painting all the fences by painters. There is a bound on the order of painting the fences by painters. Consider we have n painters, then painter …

Read moreThe Painter’s Partition Problem

Problem Statement We are given an array, and we need to find maximum subarray sum excluding certain elements. That is, we need to find the max sum of subarray such that the subarray we are considering does not contain the elements which are told to be excluded. Example of maximum …

Read moreMaximum Subarray Sum Excluding Certain Elements

Problem Statement Given Two Balanced Binary Search Trees, there are n elements in the first BST and m elements in the second BST. Write an algorithm to merge two balanced binary search trees to form a third balanced Binary Search Tree with (n + m) elements. Example Input Output Pre-order …

Read moreMerge Two Balanced Binary Search Trees

Problem Statement Write an algorithm to perform searching and insertion in Binary Search Tree. So what we are going to do is insert some of the elements from input into a binary search tree. Whenever asked to search a particular element, we’ll be searching it among the elements in BST(short …

Read moreBinary Search Tree Search and Insertion