Search for a command to run...
Series
LeetCode 150 Top Interview code problem solving series
Understanding the Problem An integer list of nums has numbers that could be either duplicate or non-duplicate. It is to leave 1-2 values for each number in the list in-place, which means it is nothing to do with returning any value from the method. #...
![[LeetCode] Top Interview 150 Problems Solving # 80 Remove Duplicates from Sorted Array II](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Fupload%2Fv1743522203673%2F04276cb7-7df4-481b-91df-ba9a5d4a4f3f.png&w=3840&q=75)
Understanding the Problem A string is given with spaces. The string could be a single character or a complete sentence. It is to reverse the string by words. The spaces at the edges should be cut off. # example 1 Input: s = "the sky is blue" Output: ...
![[LeetCode] Top Interview 150 Problems Solving # 151 Reverse Words in a String](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Fupload%2Fv1743121999694%2Ff2608574-4623-4dc3-b7a0-040bf70192eb.png&w=3840&q=75)
Understanding the Problem There are strings as s and t. The length of s and length of t are equal as len(s) == len(t). This problem requires deciding whether s and t are isomorphic, which means they have the same structure, or pattern. As an example,...
Understanding the Problem This should be a typical binary search algorithm problem. This problem is meticulous about the time efficiency as this has to be solved with the time complex of O(log n). There is a number target as an integer. It is to find...
Understanding the Problem It is simply to find the common prefix in between the strings in the list strs. strs contains strings like strs = ["flower","flow","flight"]. In this case the common prefix will be ”fl” which is included in every string in c...
Understanding the Problem A number is given as n. Imagine that only 1 or 2 steps could be taken at once to reach the number n. For instance, if the number is 4, there are 5 ways to reach number 4. n = 4 # ways to reach n 1, 1, 1, 1 # 1 2, 1, 1 # 2 1...