{"id":99854,"date":"2025-11-26T15:59:37","date_gmt":"2025-11-26T10:29:37","guid":{"rendered":"https:\/\/www.seminarsonly.com\/news\/?p=99854"},"modified":"2025-11-26T16:59:09","modified_gmt":"2025-11-26T11:29:09","slug":"leetcode-217-contains-duplicate-easy-way-to-solve","status":"publish","type":"post","link":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/","title":{"rendered":"LeetCode 217: Contains Duplicate | Easy Way to Solve"},"content":{"rendered":"<h3 data-path-to-node=\"0\"><span style=\"color: #008000;\"><em><b>LeetCode 217: Contains Duplicate<\/b> is a popular introductory problem often asked in coding interviews (e.g., at Microsoft, Amazon, Google).<\/em><\/span><\/h3>\n<h2><span style=\"color: #800000;\">The Challenge:<\/span><\/h2>\n<p>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.<\/p>\n<p data-path-to-node=\"2\">Here are the three most common ways to solve it, ranging from the most efficient to the most concise.<\/p>\n<hr data-path-to-node=\"3\" \/>\n<h2><span style=\"color: #800000;\">1. The Optimal Approach: Hash Set<\/span><\/h2>\n<p data-path-to-node=\"5\">This is the standard interview answer. You trade a little bit of memory for speed.<\/p>\n<ul data-path-to-node=\"6\">\n<li>\n<p data-path-to-node=\"6,0,0\"><b>Logic:<\/b> Iterate through the array while storing numbers in a &#8220;visited&#8221; set. If you encounter a number that is already in the set, you have found a duplicate.<\/p>\n<\/li>\n<li>\n<p data-path-to-node=\"6,1,0\"><b>Time Complexity:<\/b> <span class=\"math-inline\" data-math=\"O(n)\">$O(n)$<\/span> \u2014 We scan the array once.<\/p>\n<\/li>\n<li>\n<p data-path-to-node=\"6,2,0\"><b>Space Complexity:<\/b> <span class=\"math-inline\" data-math=\"O(n)\">$O(n)$<\/span> \u2014 We store unique elements in the set.<\/p>\n<\/li>\n<\/ul>\n<h3>Also Read : <a href=\"https:\/\/www.seminarsonly.com\/news\/mangago-not-working-common-causes-fixes\/\">Mangago Not Working<\/a><\/h3>\n<hr \/>\n<h3 data-path-to-node=\"7\"><span style=\"color: #000080;\"><b>Python<\/b><\/span><\/h3>\n<div class=\"code-block ng-tns-c1837973395-339 ng-animate-disabled ng-trigger ng-trigger-codeBlockRevealAnimation\" data-hveid=\"0\" data-ved=\"0CAAQhtANahgKEwigpKvRzIyRAxUAAAAAHQAAAAAQqwo\">\n<div class=\"code-block-decoration header-formatted gds-title-s ng-tns-c1837973395-339 ng-star-inserted\">\n<p><span class=\"ng-tns-c1837973395-339\">Python<\/span><\/p>\n<div class=\"buttons ng-tns-c1837973395-339 ng-star-inserted\"><\/div>\n<\/div>\n<div class=\"formatted-code-block-internal-container ng-tns-c1837973395-339\">\n<div class=\"animated-opacity ng-tns-c1837973395-339\">\n<pre class=\"ng-tns-c1837973395-339\"><code class=\"code-container formatted ng-tns-c1837973395-339\" role=\"text\" data-test-id=\"code-content\"><span class=\"hljs-class\"><span class=\"hljs-keyword\">class<\/span> <span class=\"hljs-title\">Solution<\/span>:<\/span>\r\n    <span class=\"hljs-function\"><span class=\"hljs-keyword\">def<\/span> <span class=\"hljs-title\">containsDuplicate<\/span>(<span class=\"hljs-params\">self, nums: List[<span class=\"hljs-built_in\">int<\/span>]<\/span>) -&gt; bool:<\/span>\r\n        seen = <span class=\"hljs-built_in\">set<\/span>()\r\n        <span class=\"hljs-keyword\">for<\/span> num <span class=\"hljs-keyword\">in<\/span> nums:\r\n            <span class=\"hljs-keyword\">if<\/span> num <span class=\"hljs-keyword\">in<\/span> seen:\r\n                <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-literal\">True<\/span>\r\n            seen.add(num)\r\n        <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-literal\">False<\/span>\r\n<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<hr \/>\n<h3 data-path-to-node=\"9\"><span style=\"color: #000080;\"><b>Java<\/b><\/span><\/h3>\n<div class=\"code-block ng-tns-c1837973395-340 ng-animate-disabled ng-trigger ng-trigger-codeBlockRevealAnimation\" data-hveid=\"0\" data-ved=\"0CAAQhtANahgKEwigpKvRzIyRAxUAAAAAHQAAAAAQrAo\">\n<div class=\"code-block-decoration header-formatted gds-title-s ng-tns-c1837973395-340 ng-star-inserted\">\n<p><span class=\"ng-tns-c1837973395-340\">Java<\/span><\/p>\n<div class=\"buttons ng-tns-c1837973395-340 ng-star-inserted\"><\/div>\n<\/div>\n<div class=\"formatted-code-block-internal-container ng-tns-c1837973395-340\">\n<div class=\"animated-opacity ng-tns-c1837973395-340\">\n<pre class=\"ng-tns-c1837973395-340\"><code class=\"code-container formatted ng-tns-c1837973395-340\" role=\"text\" data-test-id=\"code-content\"><span class=\"hljs-class\"><span class=\"hljs-keyword\">class<\/span> <span class=\"hljs-title\">Solution<\/span> <\/span>{\r\n    <span class=\"hljs-function\"><span class=\"hljs-keyword\">public<\/span> <span class=\"hljs-keyword\">boolean<\/span> <span class=\"hljs-title\">containsDuplicate<\/span><span class=\"hljs-params\">(<span class=\"hljs-keyword\">int<\/span>[] nums)<\/span> <\/span>{\r\n        HashSet&lt;Integer&gt; seen = <span class=\"hljs-keyword\">new<\/span> HashSet&lt;&gt;();\r\n        <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-keyword\">int<\/span> num : nums) {\r\n            <span class=\"hljs-keyword\">if<\/span> (seen.contains(num)) {\r\n                <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-keyword\">true<\/span>;\r\n            }\r\n            seen.add(num);\r\n        }\r\n        <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-keyword\">false<\/span>;\r\n    }\r\n}\r\n<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<hr \/>\n<h3 data-path-to-node=\"11\"><span style=\"color: #000080;\"><b>C++<\/b><\/span><\/h3>\n<div class=\"code-block ng-tns-c1837973395-341 ng-animate-disabled ng-trigger ng-trigger-codeBlockRevealAnimation\" data-hveid=\"0\" data-ved=\"0CAAQhtANahgKEwigpKvRzIyRAxUAAAAAHQAAAAAQrQo\">\n<div class=\"code-block-decoration header-formatted gds-title-s ng-tns-c1837973395-341 ng-star-inserted\">\n<p><span class=\"ng-tns-c1837973395-341\">C++<\/span><\/p>\n<div class=\"buttons ng-tns-c1837973395-341 ng-star-inserted\"><\/div>\n<\/div>\n<div class=\"formatted-code-block-internal-container ng-tns-c1837973395-341\">\n<div class=\"animated-opacity ng-tns-c1837973395-341\">\n<pre class=\"ng-tns-c1837973395-341\"><code class=\"code-container formatted ng-tns-c1837973395-341\" role=\"text\" data-test-id=\"code-content\"><span class=\"hljs-class\"><span class=\"hljs-keyword\">class<\/span> <span class=\"hljs-title\">Solution<\/span> {<\/span>\r\n<span class=\"hljs-keyword\">public<\/span>:\r\n    <span class=\"hljs-function\"><span class=\"hljs-keyword\">bool<\/span> <span class=\"hljs-title\">containsDuplicate<\/span><span class=\"hljs-params\">(<span class=\"hljs-built_in\">vector<\/span>&lt;<span class=\"hljs-keyword\">int<\/span>&gt;&amp; nums)<\/span> <\/span>{\r\n        <span class=\"hljs-built_in\">unordered_set<\/span>&lt;<span class=\"hljs-keyword\">int<\/span>&gt; seen;\r\n        <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-keyword\">int<\/span> num : nums) {\r\n            <span class=\"hljs-keyword\">if<\/span> (seen.count(num)) {\r\n                <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-literal\">true<\/span>;\r\n            }\r\n            seen.insert(num);\r\n        }\r\n        <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-literal\">false<\/span>;\r\n    }\r\n};\r\n<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<hr data-path-to-node=\"13\" \/>\n<h2><span style=\"color: #800000;\">2. The Python &#8220;One-Liner&#8221;<\/span><\/h2>\n<p data-path-to-node=\"15\">If you are writing production code or a quick script, this is the most &#8220;Pythonic&#8221; way. It compares the length of the list (which counts duplicates) to the length of the set (which removes duplicates).<\/p>\n<ul data-path-to-node=\"16\">\n<li>\n<p data-path-to-node=\"16,0,0\"><b>Logic:<\/b> If the set is smaller than the list, duplicates must have been removed.<\/p>\n<\/li>\n<\/ul>\n<div class=\"code-block ng-tns-c1837973395-342 ng-animate-disabled ng-trigger ng-trigger-codeBlockRevealAnimation\" data-hveid=\"0\" data-ved=\"0CAAQhtANahgKEwigpKvRzIyRAxUAAAAAHQAAAAAQrgo\">\n<h3 class=\"code-block-decoration header-formatted gds-title-s ng-tns-c1837973395-342 ng-star-inserted\"><span class=\"ng-tns-c1837973395-342\" style=\"color: #000080;\">Python<\/span><\/h3>\n<div class=\"formatted-code-block-internal-container ng-tns-c1837973395-342\">\n<div class=\"animated-opacity ng-tns-c1837973395-342\">\n<pre class=\"ng-tns-c1837973395-342\"><code class=\"code-container formatted ng-tns-c1837973395-342\" role=\"text\" data-test-id=\"code-content\"><span class=\"hljs-class\"><span class=\"hljs-keyword\">class<\/span> <span class=\"hljs-title\">Solution<\/span>:<\/span>\r\n    <span class=\"hljs-function\"><span class=\"hljs-keyword\">def<\/span> <span class=\"hljs-title\">containsDuplicate<\/span>(<span class=\"hljs-params\">self, nums: List[<span class=\"hljs-built_in\">int<\/span>]<\/span>) -&gt; bool:<\/span>\r\n        <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-built_in\">len<\/span>(<span class=\"hljs-built_in\">set<\/span>(nums)) != <span class=\"hljs-built_in\">len<\/span>(nums)\r\n<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<hr data-path-to-node=\"18\" \/>\n<h2><span style=\"color: #800000;\">3. The &#8220;Space Saver&#8221; Approach: Sorting<\/span><\/h2>\n<p data-path-to-node=\"20\">If memory is extremely tight and you cannot afford <span class=\"math-inline\" data-math=\"O(n)\">$O(n)$<\/span> space for a set, you can sort the array first.<\/p>\n<ul data-path-to-node=\"21\">\n<li>\n<p data-path-to-node=\"21,0,0\"><b>Logic:<\/b> Sort the numbers. Any duplicates will now be sitting next to each other (e.g., <code>[1, 3, 2, 1]<\/code> becomes <code>[1, 1, 2, 3]<\/code>). Iterate and check if <code>nums[i] == nums[i+1]<\/code>.<\/p>\n<\/li>\n<li>\n<p data-path-to-node=\"21,1,0\"><b>Time Complexity:<\/b> <span class=\"math-inline\" data-math=\"O(n \\log n)\">$O(n \\log n)$<\/span> \u2014 Sorting takes longer than a linear scan.<\/p>\n<\/li>\n<li>\n<p data-path-to-node=\"21,2,0\"><b>Space Complexity:<\/b> <span class=\"math-inline\" data-math=\"O(1)\">$O(1)$<\/span> or <span class=\"math-inline\" data-math=\"O(\\log n)\">$O(\\log n)$<\/span> \u2014 Depends on the sorting algorithm, but generally uses less memory than a set.<\/p>\n<\/li>\n<\/ul>\n<div class=\"code-block ng-tns-c1837973395-343 ng-animate-disabled ng-trigger ng-trigger-codeBlockRevealAnimation\" data-hveid=\"0\" data-ved=\"0CAAQhtANahgKEwigpKvRzIyRAxUAAAAAHQAAAAAQrwo\">\n<h3 class=\"code-block-decoration header-formatted gds-title-s ng-tns-c1837973395-343 ng-star-inserted\"><span class=\"ng-tns-c1837973395-343\" style=\"color: #000080;\">Python<\/span><\/h3>\n<div class=\"formatted-code-block-internal-container ng-tns-c1837973395-343\">\n<div class=\"animated-opacity ng-tns-c1837973395-343\">\n<pre class=\"ng-tns-c1837973395-343\"><code class=\"code-container formatted ng-tns-c1837973395-343\" role=\"text\" data-test-id=\"code-content\"><span class=\"hljs-class\"><span class=\"hljs-keyword\">class<\/span> <span class=\"hljs-title\">Solution<\/span>:<\/span>\r\n    <span class=\"hljs-function\"><span class=\"hljs-keyword\">def<\/span> <span class=\"hljs-title\">containsDuplicate<\/span>(<span class=\"hljs-params\">self, nums: List[<span class=\"hljs-built_in\">int<\/span>]<\/span>) -&gt; bool:<\/span>\r\n        nums.sort()\r\n        <span class=\"hljs-keyword\">for<\/span> i <span class=\"hljs-keyword\">in<\/span> <span class=\"hljs-built_in\">range<\/span>(<span class=\"hljs-built_in\">len<\/span>(nums) - <span class=\"hljs-number\">1<\/span>):\r\n            <span class=\"hljs-keyword\">if<\/span> nums[i] == nums[i + <span class=\"hljs-number\">1<\/span>]:\r\n                <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-literal\">True<\/span>\r\n        <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-literal\">False<\/span>\r\n<\/code><\/pre>\n<\/div>\n<\/div>\n<\/div>\n<hr \/>\n<h2><span style=\"color: #800000;\">Quick Summary Table<\/span><\/h2>\n<table style=\"height: 220px;\" width=\"670\" data-path-to-node=\"24\">\n<thead>\n<tr>\n<td><strong>Approach<\/strong><\/td>\n<td><strong>Time<\/strong><\/td>\n<td><strong>Space<\/strong><\/td>\n<td><strong>Notes<\/strong><\/td>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td><span data-path-to-node=\"24,1,0,0\"><b>Hash Set<\/b><\/span><\/td>\n<td><span data-path-to-node=\"24,1,1,0\"><span class=\"math-inline\" data-math=\"O(n)\">$O(n)$<\/span><\/span><\/td>\n<td><span data-path-to-node=\"24,1,2,0\"><span class=\"math-inline\" data-math=\"O(n)\">$O(n)$<\/span><\/span><\/td>\n<td><span data-path-to-node=\"24,1,3,0\"><b>Best for Interviews.<\/b> Fast but uses memory.<\/span><\/td>\n<\/tr>\n<tr>\n<td><span data-path-to-node=\"24,2,0,0\"><b>Sorting<\/b><\/span><\/td>\n<td><span data-path-to-node=\"24,2,1,0\"><span class=\"math-inline\" data-math=\"O(n \\log n)\">$O(n \\log n)$<\/span><\/span><\/td>\n<td><span data-path-to-node=\"24,2,2,0\"><span class=\"math-inline\" data-math=\"O(1)\">$O(1)$<\/span><\/span><\/td>\n<td><span data-path-to-node=\"24,2,3,0\">Slower, but saves memory. Modifies input.<\/span><\/td>\n<\/tr>\n<tr>\n<td><span data-path-to-node=\"24,3,0,0\"><b>Brute Force<\/b><\/span><\/td>\n<td><span data-path-to-node=\"24,3,1,0\"><span class=\"math-inline\" data-math=\"O(n^2)\">$O(n^2)$<\/span><\/span><\/td>\n<td><span data-path-to-node=\"24,3,2,0\"><span class=\"math-inline\" data-math=\"O(1)\">$O(1)$<\/span><\/span><\/td>\n<td><span data-path-to-node=\"24,3,3,0\"><b>Too slow.<\/b> (Time Limit Exceeded).<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"<p>LeetCode 217: Contains Duplicate is a popular introductory problem often asked in coding interviews (e.g., at Microsoft, Amazon, Google). The Challenge: Given an integer array nums, return true if any&hellip;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6049],"tags":[],"class_list":["post-99854","post","type-post","status-publish","format-standard","hentry","category-games"],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v27.2 (Yoast SEO v27.2) - https:\/\/yoast.com\/product\/yoast-seo-premium-wordpress\/ -->\n<title>LeetCode 217: Contains Duplicate | Easy Way to Solve - Seminarsonly.com<\/title>\n<meta name=\"description\" content=\"LeetCode 217: Contains Duplicate is a popular introductory problem often asked in coding interviews (e.g., at Microsoft, Amazon, Google).\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode 217: Contains Duplicate | Easy Way to Solve\" \/>\n<meta property=\"og:description\" content=\"LeetCode 217: Contains Duplicate is a popular introductory problem often asked in coding interviews (e.g., at Microsoft, Amazon, Google).\" \/>\n<meta property=\"og:url\" content=\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/\" \/>\n<meta property=\"og:site_name\" content=\"Seminarsonly.com\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/facebook.com\/seminarsonly\" \/>\n<meta property=\"article:published_time\" content=\"2025-11-26T10:29:37+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-11-26T11:29:09+00:00\" \/>\n<meta name=\"author\" content=\"Freddy John\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@seminarsonly\" \/>\n<meta name=\"twitter:site\" content=\"@seminarsonly\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Freddy John\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/\"},\"author\":{\"name\":\"Freddy John\",\"@id\":\"https:\/\/seminarsonly.com\/news\/#\/schema\/person\/75cf706896b7210fb0a84651adc258bd\"},\"headline\":\"LeetCode 217: Contains Duplicate | Easy Way to Solve\",\"datePublished\":\"2025-11-26T10:29:37+00:00\",\"dateModified\":\"2025-11-26T11:29:09+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/\"},\"wordCount\":327,\"commentCount\":1,\"articleSection\":[\"Games\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/\",\"url\":\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/\",\"name\":\"LeetCode 217: Contains Duplicate | Easy Way to Solve - Seminarsonly.com\",\"isPartOf\":{\"@id\":\"https:\/\/seminarsonly.com\/news\/#website\"},\"datePublished\":\"2025-11-26T10:29:37+00:00\",\"dateModified\":\"2025-11-26T11:29:09+00:00\",\"author\":{\"@id\":\"https:\/\/seminarsonly.com\/news\/#\/schema\/person\/75cf706896b7210fb0a84651adc258bd\"},\"description\":\"LeetCode 217: Contains Duplicate is a popular introductory problem often asked in coding interviews (e.g., at Microsoft, Amazon, Google).\",\"breadcrumb\":{\"@id\":\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/seminarsonly.com\/news\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"LeetCode 217: Contains Duplicate | Easy Way to Solve\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/seminarsonly.com\/news\/#website\",\"url\":\"https:\/\/seminarsonly.com\/news\/\",\"name\":\"Seminarsonly.com\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/seminarsonly.com\/news\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/seminarsonly.com\/news\/#\/schema\/person\/75cf706896b7210fb0a84651adc258bd\",\"name\":\"Freddy John\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/secure.gravatar.com\/avatar\/671d452f5fe9027ab894cbed50911cc764b2c16878222070bf044f21705d4c94?s=96&d=mm&r=g\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/671d452f5fe9027ab894cbed50911cc764b2c16878222070bf044f21705d4c94?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/671d452f5fe9027ab894cbed50911cc764b2c16878222070bf044f21705d4c94?s=96&d=mm&r=g\",\"caption\":\"Freddy John\"},\"sameAs\":[\"https:\/\/seminarsonly.com\/news\"],\"url\":\"https:\/\/seminarsonly.com\/news\/author\/anupvnaick_51wq8y4s\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"LeetCode 217: Contains Duplicate | Easy Way to Solve - Seminarsonly.com","description":"LeetCode 217: Contains Duplicate is a popular introductory problem often asked in coding interviews (e.g., at Microsoft, Amazon, Google).","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/","og_locale":"en_US","og_type":"article","og_title":"LeetCode 217: Contains Duplicate | Easy Way to Solve","og_description":"LeetCode 217: Contains Duplicate is a popular introductory problem often asked in coding interviews (e.g., at Microsoft, Amazon, Google).","og_url":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/","og_site_name":"Seminarsonly.com","article_publisher":"https:\/\/facebook.com\/seminarsonly","article_published_time":"2025-11-26T10:29:37+00:00","article_modified_time":"2025-11-26T11:29:09+00:00","author":"Freddy John","twitter_card":"summary_large_image","twitter_creator":"@seminarsonly","twitter_site":"@seminarsonly","twitter_misc":{"Written by":"Freddy John","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/#article","isPartOf":{"@id":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/"},"author":{"name":"Freddy John","@id":"https:\/\/seminarsonly.com\/news\/#\/schema\/person\/75cf706896b7210fb0a84651adc258bd"},"headline":"LeetCode 217: Contains Duplicate | Easy Way to Solve","datePublished":"2025-11-26T10:29:37+00:00","dateModified":"2025-11-26T11:29:09+00:00","mainEntityOfPage":{"@id":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/"},"wordCount":327,"commentCount":1,"articleSection":["Games"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/","url":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/","name":"LeetCode 217: Contains Duplicate | Easy Way to Solve - Seminarsonly.com","isPartOf":{"@id":"https:\/\/seminarsonly.com\/news\/#website"},"datePublished":"2025-11-26T10:29:37+00:00","dateModified":"2025-11-26T11:29:09+00:00","author":{"@id":"https:\/\/seminarsonly.com\/news\/#\/schema\/person\/75cf706896b7210fb0a84651adc258bd"},"description":"LeetCode 217: Contains Duplicate is a popular introductory problem often asked in coding interviews (e.g., at Microsoft, Amazon, Google).","breadcrumb":{"@id":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/seminarsonly.com\/news\/leetcode-217-contains-duplicate-easy-way-to-solve\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/seminarsonly.com\/news\/"},{"@type":"ListItem","position":2,"name":"LeetCode 217: Contains Duplicate | Easy Way to Solve"}]},{"@type":"WebSite","@id":"https:\/\/seminarsonly.com\/news\/#website","url":"https:\/\/seminarsonly.com\/news\/","name":"Seminarsonly.com","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/seminarsonly.com\/news\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/seminarsonly.com\/news\/#\/schema\/person\/75cf706896b7210fb0a84651adc258bd","name":"Freddy John","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/671d452f5fe9027ab894cbed50911cc764b2c16878222070bf044f21705d4c94?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/671d452f5fe9027ab894cbed50911cc764b2c16878222070bf044f21705d4c94?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/671d452f5fe9027ab894cbed50911cc764b2c16878222070bf044f21705d4c94?s=96&d=mm&r=g","caption":"Freddy John"},"sameAs":["https:\/\/seminarsonly.com\/news"],"url":"https:\/\/seminarsonly.com\/news\/author\/anupvnaick_51wq8y4s\/"}]}},"_links":{"self":[{"href":"https:\/\/seminarsonly.com\/news\/wp-json\/wp\/v2\/posts\/99854","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/seminarsonly.com\/news\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/seminarsonly.com\/news\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/seminarsonly.com\/news\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/seminarsonly.com\/news\/wp-json\/wp\/v2\/comments?post=99854"}],"version-history":[{"count":0,"href":"https:\/\/seminarsonly.com\/news\/wp-json\/wp\/v2\/posts\/99854\/revisions"}],"wp:attachment":[{"href":"https:\/\/seminarsonly.com\/news\/wp-json\/wp\/v2\/media?parent=99854"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/seminarsonly.com\/news\/wp-json\/wp\/v2\/categories?post=99854"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/seminarsonly.com\/news\/wp-json\/wp\/v2\/tags?post=99854"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}