Given an array of integers, nums, return all the triplets in the given array nums[i], nums[j], nums[k] such that i != j, i != k, and j != k

Given a 32-bit signed integer x, reverse the digits in x and return the result. If after reversing the result goes outside the signed 32-bit

This is a solution to leetcode 8 problem. Implement myAtoi(string s) function, which converts a string to a 32-bit signed integer.

Given a string s, find the length of the longest substring without repeating characters. s consists of English letters, digits, symbols and

Consider you are given n non-negative integers say a1, a2, ..., an, where each element in the array represents a point at coordinate (i, ai)

Consider you given an array of integers and a target sum, return indices of two numbers in the array such that they add up to target.