[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"searchBlogPosts":3,"$fq4i0NJUlv7pRU1XbbOYC7uE32a4Yy-iLM4uTCl-Uc9E":7},[4],{"_path":5,"title":6},"\u002Fblog\u002F2023\u002F09\u002F17\u002Fspring-boot-postgresql","Spring Boot with PostgreSQL & pgAdmin in Docker",{"title":8,"category":9,"problemHtml":10,"solutions":11,"repoUrl":16},"Contains Duplicate","LeetCode","\u003Cp class=\"difficulty Easy\">Easy\u003C\u002Fp>\u003Chr>\u003Cp>Given an integer array \u003Ccode>nums\u003C\u002Fcode>, return \u003Ccode>true\u003C\u002Fcode> if any value appears \u003Cstrong>at least twice\u003C\u002Fstrong> in the array, and return \u003Ccode>false\u003C\u002Fcode> if every element is distinct.\u003C\u002Fp>\n\n\u003Cp>&nbsp;\u003C\u002Fp>\n\u003Cp>\u003Cstrong class=\"example\">Example 1:\u003C\u002Fstrong>\u003C\u002Fp>\n\n\u003Cdiv class=\"example-block\">\n\u003Cp>\u003Cstrong>Input:\u003C\u002Fstrong> \u003Cspan class=\"example-io\">nums = [1,2,3,1]\u003C\u002Fspan>\u003C\u002Fp>\n\n\u003Cp>\u003Cstrong>Output:\u003C\u002Fstrong> \u003Cspan class=\"example-io\">true\u003C\u002Fspan>\u003C\u002Fp>\n\n\u003Cp>\u003Cstrong>Explanation:\u003C\u002Fstrong>\u003C\u002Fp>\n\n\u003Cp>The element 1 occurs at the indices 0 and 3.\u003C\u002Fp>\n\u003C\u002Fdiv>\n\n\u003Cp>\u003Cstrong class=\"example\">Example 2:\u003C\u002Fstrong>\u003C\u002Fp>\n\n\u003Cdiv class=\"example-block\">\n\u003Cp>\u003Cstrong>Input:\u003C\u002Fstrong> \u003Cspan class=\"example-io\">nums = [1,2,3,4]\u003C\u002Fspan>\u003C\u002Fp>\n\n\u003Cp>\u003Cstrong>Output:\u003C\u002Fstrong> \u003Cspan class=\"example-io\">false\u003C\u002Fspan>\u003C\u002Fp>\n\n\u003Cp>\u003Cstrong>Explanation:\u003C\u002Fstrong>\u003C\u002Fp>\n\n\u003Cp>All elements are distinct.\u003C\u002Fp>\n\u003C\u002Fdiv>\n\n\u003Cp>\u003Cstrong class=\"example\">Example 3:\u003C\u002Fstrong>\u003C\u002Fp>\n\n\u003Cdiv class=\"example-block\">\n\u003Cp>\u003Cstrong>Input:\u003C\u002Fstrong> \u003Cspan class=\"example-io\">nums = [1,1,1,3,3,4,3,2,4,2]\u003C\u002Fspan>\u003C\u002Fp>\n\n\u003Cp>\u003Cstrong>Output:\u003C\u002Fstrong> \u003Cspan class=\"example-io\">true\u003C\u002Fspan>\u003C\u002Fp>\n\u003C\u002Fdiv>\n\n\u003Cp>&nbsp;\u003C\u002Fp>\n\u003Cp>\u003Cstrong>Constraints:\u003C\u002Fstrong>\u003C\u002Fp>\n\n\u003Cul>\n\t\u003Cli>\u003Ccode>1 &lt;= nums.length &lt;= 10\u003Csup>5\u003C\u002Fsup>\u003C\u002Fcode>\u003C\u002Fli>\n\t\u003Cli>\u003Ccode>-10\u003Csup>9\u003C\u002Fsup> &lt;= nums[i] &lt;= 10\u003Csup>9\u003C\u002Fsup>\u003C\u002Fcode>\u003C\u002Fli>\n\u003C\u002Ful>",[12],{"lang":13,"label":14,"html":15},"python","Python","\u003Cpre>\u003Ccode class=\"language-python\">class Solution:\n    def containsDuplicate(self, nums: List[int]) -&gt; bool:\n        nums.sort()\n        for i in range(1, len(nums)):\n            if nums[i] == nums[i -1]:\n                return True\n\n        return False\u003C\u002Fcode>\u003C\u002Fpre>","https:\u002F\u002Fgithub.com\u002Fvishwarajsali\u002FInterviewPrep\u002Ftree\u002Fmain\u002F0217-contains-duplicate"]