LeetCode - Longest Palindromic Substring
Question Definition
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
More …Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
More …Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.
More …Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.
More …Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.
More …Given a string containing only three types of characters: ‘(‘, ‘)’ and ‘*’, write a function to check whether this string is valid. We define the validity of a string by these rules: