#leetcode-solution
Read more stories on Hashnode
Articles with this tag
Problem Problem_Link Solutions (time, space) O(n), O(n) class Solution { public boolean containsDuplicate(int[] nums) { // Create a...
Problem Problem_Link Solutions (time, space) O(n), O(n) class Solution { public void rotate(int[] nums, int k) { int len = nums.length; ...
Problem Problem_Link Solutions (time, space) O(1), O(1) /** * Definition for singly-linked list. * public class ListNode { * int val; * ...
Problem Problem_Link Solutions (time, space) count L and R O(n), O(1) class Solution { public int balancedStringSplit(String s) { int...
Problem Problem_Link Solutions (time, space) O(n), O(n) public class Solution { public String[] findRelativeRanks(int[] nums) { Integer[]...
Problem Problem_Link Solutions (time, space) bit calculation with JAVA method bit calculation with bitwise operator I solved with JAVA method. But,...