Leetcode 375: Guess Number Higher or Lower II
Question
We are playing the Guess Game. The game is as follows:
[Read More]
-
-
Leetcode 374: Guess Number Higher or Lower
Question We are playing the Guess Game. The game is as follows: [Read More] -
Leetcode 373: Find K Pairs with Smallest Sums
Question You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k. [Read More] -
Leetcode 372: Super Pow
Question Your task is to calculate a^b mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array. [Read More] -
Leetcode 371: Sum of Two Integers
Question Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. [Read More] -
Leetcode 370: Range Addition
Question Assume you have an array of length n initialized with all 0’s and are given k update operations. [Read More] -
Leetcode 369: Plus One Linked List
Question Given a non-negative integer represented as non-empty a singly linked list of digits, plus one to the integer. [Read More] -
Leetcode 97: Interleaving String
Question Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. [Read More] -
Leetcode 87: Scramble String
Question Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. [Read More] -
Leetcode 85: Maximal Rectangle
Question Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area. [Read More] -
Leetcode 84: Largest Rectangle in Histogram
Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram. [Read More] -
Leetcode 76: Minimum Window Substring
Question Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). [Read More] -
Leetcode 72: Edit Distance
Question Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. [Read More] -
Leetcode 368: Largest Divisible Subset
Question Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0. [Read More] -
Leetcode 367: Valid Perfect Square
Question Given a positive integer num, write a function which returns True if num is a perfect square else False. [Read More]