# Coding Interview Question: Sort Stacks

Coding Interview Question: Given a stack, sort the elements in the stack using one additional stack. Click for the solution.

Coding Interview Question: Given a stack, sort the elements in the stack using one additional stack. Click for the solution.

Coding Interview Question: Given two strings, write a function that returns the longest common substring. Click for the solution.

Coding Interview Question: Implement a LIFO stack with basic functionality (push and pop) using FIFO queues to store the data. Click for the solution.

Coding Interview Question: Given a binary tree, write a function to determine whether the tree is balanced. Click for the solution.

Coding Interview Question: Given an array, write a function to find any subarray that sums to zero, if one exists. Click for the solution.

Coding Interview Question: Given a list of integers, find all sets of 3 numbers in the list, a, b, and c, so that a + b + c == 0. Click for the solution.

Coding Interview Question: Write a function that returns all permutations of a given list. Click for the solution.

Coding Interview Question: Given a tree, write a function that prints out the nodes of the tree in level order. Click for the solution.

Coding Interview Question: Given a list of strings, write a function to get the kth most frequently occurring string. Click for the solution.

Coding Interview Question: Given a binary tree, write a function to test if the tree is a binary search tree. Click for the solution.