# Coding Interview Question: Lowest Common Ancestor

Coding Interview Question: Given two nodes in a binary tree, write a function to find the lowest common ancestor. Click for the solution.

Coding Interview Question: Given two nodes in a binary tree, write a function to find the lowest common ancestor. Click for the solution.

Coding Interview Question: Given a string and a dict, find the minimum number of characters to delete to make a valid word. Click for the solution.

Coding Interview Question: Given two integers, write a function to sum the numbers without using any arithmetic operators. Click for the solution.

Coding Interview Question: Given a stack, reverse the items without creating any additional data structures. Click for the solution.

Coding Interview Question: Given two integers, write a function that swaps them without using any temporary variables. Click for the solution.

Coding Interview Question: Given an sorted n x m array, write a function to determine whether the array contains an element x. Click for the solution.

Coding Interview Question: Given a time, write a function to find the angle between the two hands on a clock representing that time. Click for the solution.

Coding Interview Question: Given an integer n, write a function to compute the nth Fibonacci number. Click for the solution.

Coding Interview Question: Given a tree, convert it into a doubly linked list from left to right by modifying the existing pointers. Click for the solution.

Coding Interview Question: Given two lines on a Cartesian plane, write a function to determine whether or not the lines intersect. Click for the solution.