Daily LeetCode Challenge (Day15) #217. Contains Duplicate

Photo by Ricardo Gomez Angel on Unsplash

Difficulty | Easy

Challenge

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.

Example 1:

Input: nums = [1,2,3,1]
Output: true

Example 2:

Input: nums = [1,2,3,4]
Output: false

Example 3:

Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true

Constraints:

• 1 <= nums.length <= 105
• -109 <= nums[i] <= 109

Thought Process & PseudoCode

• Get unique array values
• compare the length of the initial array and the unique array values
• return true or false if it faces the condition

Solution

Php Solution

class Solution {

    /**
     * @param Integer[] $nums
     * @return Boolean
     */
    function containsDuplicate($nums) {
        $arrayUnique = array_unique($nums);

        if(count($arrayUnique) !== count($nums)){
            return true;
        }else
            return false;
    }
}