Tech Revolvers
-
Merge Two Sorted Lists #21 Leetcode Problem #Leetcodeseries
Problem name: Merge Two Sorted Lists Problem statement: Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists. Example 1: Input: l1 = [1,2,4], l2 = [1,3,4] Output: [1,1,2,3,4,4] Example 2: Input: l1 = [], l2 = [] Output: [] Read more
-
Best Time to Buy and Sell Stock II #122 Leetcode Problem #Leetcodeseries
Problem name: Best Time to Buy and Sell Stock II Problem statement: Say you have an array prices for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock Read more
-
Symmetric Tree #101 Leetcode Problem #Leetcodeseries
Problem name: Symmetric trees Problem statement: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the following [1,2,2,null,3,null,3] is not: 1 / \ 2 2 \ \ 3 3 Read more
-
Decode ways #91 Leetcode Problem #Leetcodeseries
Problem name: Decode ways Problem statement: A message containing letters from A-Z can be encoded into numbers using the following mapping: ‘A’ -> “1” ‘B’ -> “2” … ‘Z’ -> “26” To decode an encoded message, all the digits must be mapped back into letters using the reverse of the mapping above (there may be multiple ways). For example, “111” can have each Read more
-
Maximum Subarray #53 Leetcode Problem #Leetcodeseries
Problem name: Maximum subarray Problem statement: Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: [4,-1,2,1] Read more
-
Container With Most Water #11 Leetcode Problem #Leetcodeseries
Problem name: Container With Most Water Problem statement: Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water. Notice that Read more
ADDITIONAL KNOWLEDGE 