# Algorithms

#### Longest Common Substring

Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new ...
/

#### Copy List with Random Pointer

A linked list of length n is given such that each node contains an additional random pointer, which could point to any ...
/

#### Implement pow(x, n)

Implement pow(x, n), which calculates x raised to the power n (i.e., xn). Example 1: Input: x = 2.00000, n = 10 Output: 1024.00000 Example 2: ...
/

#### Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings. If there is no common ...
/

#### Roman to Integer

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol                Value I 1 V ...
/

#### Container With Most Water

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two ...
/

#### Unique-paths

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only ...
/

#### Intersection of Two Linked Lists

Write a program to find the node at which the intersection of two singly linked lists begins. For example, the ...
/

#### Check if string has all unique characters

Implement an algorithm to determine if a string (of characters from ‘a’ to ‘z’) has all unique characters or not ...
/

#### LRU Cache

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) - Get the ...
/