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 an integer x, return true if x is a palindrome integer. An integer is a palindrome when it reads the same backward as forward.

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

Binary search is one of the popular searching algorithms in computer science. If you have gone through the binary search algorithm, you may

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.