Leetcode 347: Top K Frequent Elements
Question
Given a non-empty array of integers, return the k most frequent elements.
[Read More]
-
-
Leetcode 345: Reverse Vowels of a String
Question Write a function that takes a string as input and reverse only the vowels of a string. [Read More] -
Leetcode 343: Integer Break
Question 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. [Read More] -
Leetcode 341: Flatten Nested List Iterator
Question Given a nested list of integers, implement an iterator to flatten it. [Read More] -
Leetcode 337: House Robber III
Question The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that “all houses in this place forms... [Read More] -
Leetcode 334: Increasing Triplet Subsequence
Question Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. [Read More] -
Leetcode 333: Largest BST Subtree
Question Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes in it. [Read More] -
Leetcode 332: Reconstruct Itinerary
Question Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus, the itinerary must begin with JFK. [Read More] -
Leetcode 331: Verify Preorder Serialization of a Binary Tree
Question One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node’s value. If it is a null node, we record using a sentinel value such as #. [Read More] -
Leetcode 325: Maximum Size Subarray Sum Equals k
Question Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn’t one, return 0 instead. [Read More] -
Leetcode 338: Counting Bits
Question iven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array. [Read More] -
Leetcode 322: Coin Change
Question You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.... [Read More] -
Java Cheet Sheet
Data Structure List Append: add(E e). Insert into specific index: add(int index, E e). Note insertion will increase the size of the list. Access: get(int index). Set value: set(int index, E e). [Read More] -
Leetcode 359: Logger Rate Limiter
Question Design a logger system that receive stream of messages along with its timestamps, each message should be printed if and only if it is not printed in the last 10 seconds. [Read More] -
Leetcode 350: Intersection of Two Arrays II
Given two arrays, write a function to compute their intersection. [Read More]