Leetcode 223: Rectangle Area
Question
Find the total area covered by two rectilinear rectangles in a 2D plane.
[Read More]
-
-
Leetcode 222: Count Complete Tree Nodes
Question Given a complete binary tree, count the number of nodes. [Read More] -
Leetcode 245: Shortest Word Distance III
Question Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list. [Read More] -
Leetcode 244: Shortest Word Distance II
Question Design a class which receives a list of words in the constructor, and implements a method that takes two words word1 and word2 and return the shortest distance between these two words in the list. Your method will be called repeatedly many times with different parameters. [Read More] -
Leetcode 243: Shortest Word Distance
Question [Read More] -
Leetcode 264: Ugly Number II
Question Write a program to find the n-th ugly number. [Read More] -
Leetcode 263: Ugly Number
Question Write a program to check whether a given number is an ugly number. [Read More] -
Leetcode 342: Power of Four
Question Given an integer (signed 32 bits), write a function to check whether it is a power of 4. [Read More] -
Leetcode 326: Power of Three
Question Given an integer, write a function to determine if it is a power of three. [Read More] -
Leetcode 231: Power of Two
Question Given an integer, write a function to determine if it is a power of two. [Read More] -
Leetcode 221: Maximal Square
Question Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area. [Read More] -
Leetcode 232: Implement Queue using Stacks
Question Implement the following operations of a queue using stacks. [Read More] -
Leetcode 225: Implement Stack using Queues
Question Implement the following operations of a stack using queues. [Read More] -
Leetcode 220: Contains Duplicate III
Question Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k. [Read More] -
Leetcode 219: Contains Duplicate II
Question Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k. [Read More]