Missing Number: Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
read more
Find All Numbers Disappeared in an Array: Given an array nums of n integers where nums[i] is in the range [1,n], return an array of all the integers in the range [1,n] that do not appear in nums.
read more
Convert 1D Array into 2D Array: You are given a 0-indexed 1-dimensional (1D) integer array original, and two integers, m and n.
read more
Contains Duplicate: Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
read more
Roman to Integer: Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
read more
Move Zeroes: Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
read more
After investing countless hours in courses, books, and guides, as well as honing my skills on LeetCode, we came to the realization that interview preparation can be an incredibly time-consuming process, not to mention the stress of actually passing the interviews.
Know MoreDon’t settle for anything less than the crown. Join our newsletter and become the King of Interviews! Click here to join now and get the latest updates.