<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Js on Elliot Sachs</title><link>https://www.elliotsachs.com/tags/js/</link><description>Recent content in Js on Elliot Sachs</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><copyright>Copyright © 2026 Elliot Sachs</copyright><lastBuildDate>Mon, 07 May 2018 14:58:41 +0000</lastBuildDate><atom:link href="https://www.elliotsachs.com/tags/js/index.xml" rel="self" type="application/rss+xml"/><item><title>How To Get Rid Of Duplicate Objects In An Array</title><link>https://www.elliotsachs.com/how-to-get-rid-of-duplicate-objects-in-an-array/</link><pubDate>Mon, 07 May 2018 14:58:41 +0000</pubDate><guid>https://www.elliotsachs.com/how-to-get-rid-of-duplicate-objects-in-an-array/</guid><description>&lt;p&gt;There might be a better way to do this, but I found it to be a pretty straightforward method.&lt;/p&gt;
&lt;p&gt;If you have an array of objects where some objects are duplicates, you can create a Set based on the property you want to use as a filter and then you can use the filter method over the original array, to only return the object if the property in question is still in the Set. If there&amp;rsquo;s a match, you want to make sure to remove that property from the Set so the duplicated Object doesn&amp;rsquo;t match with anything in the Set.&lt;/p&gt;</description></item><item><title>How To Create A Singly Linked List In JavaScript</title><link>https://www.elliotsachs.com/how-to-create-a-singly-linked-list-in-javascript/</link><pubDate>Sat, 25 Nov 2017 16:50:24 +0000</pubDate><guid>https://www.elliotsachs.com/how-to-create-a-singly-linked-list-in-javascript/</guid><description>&lt;p&gt;Linked Lists are relatively common and simple data structures that allow us to &amp;rsquo;link&amp;rsquo;/chain data together. Linked Lists are useful for insertion/deletion (time complexity of &lt;code&gt;O(1)&lt;/code&gt;), but are unfortunately not incredibly efficient when it comes to access and search (time complexity of &lt;code&gt;O(n)&lt;/code&gt;).&lt;/p&gt;
&lt;p&gt;The core idea behind a linked list is that you have nodes that contain two pieces of information:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;The data itself&lt;/li&gt;
&lt;li&gt;A pointer towards the next piece of data&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The pointer is what chains the pieces of data together and creates the linked list.&lt;/p&gt;</description></item></channel></rss>