[Solution]217. Contains Duplicate
Problem Problem_Link Solutions (time, space) O(n), O(n) class Solution { public boolean containsDuplicate(int[] nums) { // Create a HashMap to store the elements of the array HashMap<Integer, Integer> map = new HashMap<>(); ...
![[Solution]217. Contains Duplicate](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Fstock%2Funsplash%2FnpxXWgQ33ZQ%2Fupload%2Ff5f9d8a0d4b0d0bcf5697504fca7a580.jpeg&w=3840&q=75)
![[Solution]189. Rotate Array](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Fstock%2Funsplash%2FnpxXWgQ33ZQ%2Fupload%2F5abb77f2b6138cdca7a565c0ea8d6c8e.jpeg&w=3840&q=75)
![[Solution]237. Delete Node in a Linked List](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Fstock%2Funsplash%2Fb2ff87d224f33535a73053449df49119.jpeg&w=3840&q=75)
![[Solution]1221. Split a String in Balanced Strings](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Fstock%2Funsplash%2F1464b29c77e7deaa78c51c59650012a6.jpeg&w=3840&q=75)
![[Solution]506. Relative Ranks](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Fupload%2Fv1671656024014%2Fisf42RGQ8.jpeg&w=3840&q=75)
![[Solution]1009. Complement of Base 10 Integer](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Fstock%2Funsplash%2F64c6de6e8836a10eb6bf1bd1ffc5650e.jpeg&w=3840&q=75)