[Solved] Given an array, rotate the array to the right by k steps, where k is non-negative.
[Solved] Write an SQL query to report all the duplicate emails. Return the result table in any order.
[Solved] Given a string columnTitle that represents the column title as appears in an Excel sheet, return its corresponding column number.
[Solved] Given an integer n, return the number of trailing zeroes in n!. Note that n! = n * (n – 1) * (n – 2) * … * 3 * 2 * 1.
[Solved] Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length.
[Solved] Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.
[Solved] Given two version numbers, version1 and version2, compare them. Version numbers consist of one or more revisions joined by a dot ‘.’. Each revision consists of digits and may contain leading zeros. Every revision contains at least one character.
[Solved] Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
[Solved] You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln – 1 → Ln Reorder the list to be on the following form: L0 → Ln → L1 → Ln – 1 → L2 → Ln – 2 → …