prayyojay的博客

Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the "righ

here are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates donoor

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.

Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.n

Follow up for N-Queens problem. Now, instead outputting board configurations, return the total number of distinct solutions.

Given an 2D board, count how many different battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may assume the following rules:

Given an integer, convert it to a roman numeral.

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.

Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

Given two strings s and t which consist of only lowercase letters. - String t is generated by random shuffling string s and then add one more letter at a random position. - Find the letter that was added in t

A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.

Given two strings s and t, write a function to determine if t is an anagram of s.

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case letters.

There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

Given two arrays, write a function to compute their intersection.

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the dup

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. - The function twoSum should return indices of the two numbers such th

Invert a binary tree.

Given a string s and a string t, check if s is subsequence of t. - You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, and s

Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Write a program that outputs the string representation of numbers from 1 to n.

Given a binary tree, return the preorder traversal of its nodes' values.

Given a non-empty array of integers, return the k most frequent elements.

Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

Shuffle a set of numbers without duplicates.

Given a binary tree, return the inorder traversal of its nodes' values.

Given two arrays, write a function to compute their intersection.

Given
 an 
arbitrary
 ransom
 note
 string 
and 
another 
string 
containing 
letters from
 all 
the 
magazines,
 write 
a 
function 
that 
will 
return 
true 
if 
the 
ransom 
 note 
can 
be 
constructed 
from

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

LeetCode 401. Binary Watch 题解（C++）题目描述A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).Each LED represents a zero or on

Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and num2.

Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.

LeetCode 238. Product of Array Except Self 题解（C++）题目描述Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums exc

Given a roman numeral, convert it to an integer.