Waiting7777
leetcode
A collection of 14 posts - 1 / 2
[LeetCode][Easy] 28. Implement strStr()
engineering[LeetCode][Easy] 28. Implement strStr()Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
author1
2021-04-07
2 MIN
[LeetCode][Easy] 27. Remove Element
engineering[LeetCode][Easy] 27. Remove ElementGiven an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.
author1
2021-04-07
3 MIN
[LeetCode][Medium] 89. Gray Code
engineering[LeetCode][Medium] 89. Gray CodeAn n-bit gray code sequence is a sequence of 2n integers where
author1
2021-04-06
2 MIN
[LeetCode][Medium] 77. Combinations
engineering[LeetCode][Medium] 77. CombinationsGiven two integers n and k, return all possible combinations of k numbers out of the range [1, n].
author1
2021-04-04
1 MIN
[LeetCode][Medium] 47. Permutations II
engineering[LeetCode][Medium] 47. Permutations IIGiven a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.
author1
2021-04-03
2 MIN
[LeetCode][Medium] 46. Permutations
engineering[LeetCode][Medium] 46. PermutationsGiven an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
author1
2021-04-03
1 MIN
[LeetCode][Medium] 63. Unique Paths II
engineering[LeetCode][Medium] 63. Unique Paths IIA robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
author1
2021-04-03
2 MIN
[LeetCode][Medium] 62. Unique Paths
engineering[LeetCode][Medium] 62. Unique PathsA robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
author1
2021-04-03
2 MIN
[LeetCode][Medium] 16. 3Sum Cloest
engineering[LeetCode][Medium] 16. 3Sum CloestGiven an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
author1
2021-04-02
2 MIN
1
2
Copyright © 2020-2022 | Design by Waiting7777