LeetCode 415. Add Strings
Description https://leetcode.com/problems/add-strings/ Given two non-negative integers, num1 and num2 represented as string, return the sum of num1 and num2 as a string. Example 1: Input: num1 = “11”, num2…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/add-strings/ Given two non-negative integers, num1 and num2 represented as string, return the sum of num1 and num2 as a string. Example 1: Input: num1 = “11”, num2…
Description https://leetcode.com/problems/remove-element/ Given an array nums and a value val, remove all instances of that value in-place and return the new length. Do not allocate…
Description https://leetcode.com/problems/is-subsequence/ Given two strings s and t, check if s is a subsequence of t. A subsequence of a string is a new string that is formed from the…
Description https://leetcode.com/problems/array-transformation/ Given an initial array arr, every day you produce a new array using the array of the previous day.…
Description https://leetcode.com/problems/closest-binary-search-tree-value/ Given the root of a binary search tree and a target value, return the value in the BST that is closest to the target.…
Description https://leetcode.com/problems/meeting-rooms/ Given an array of meeting time intervals where intervals[i] = [starti, endi], determine if a person could attend all meetings. Example…
Description https://leetcode.com/problems/binary-search/ Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums.…
Description https://leetcode.com/problems/kth-missing-positive-number/ Given an array arr of positive integers sorted in a strictly increasing order, and an integer k. Find the kth positive integer that is missing…
Description https://leetcode.com/problems/n-th-tribonacci-number/ The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for…
Description https://leetcode.com/problems/two-sum-iv-input-is-a-bst/ Given the root of a Binary Search Tree and a target number k, return true if there exist two elements in the BST…