<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Collections: ArrayLists and HashMaps by </title>
      <link>https://padlet.com/skCompSci/collections</link>
      <description>What is a List and an ArrayList in Java?
What is a Map and a HashMap in Java?
How are these collections defined and initiliased?</description>
      <language>en-us</language>
      <pubDate>2017-11-17 12:39:21 UTC</pubDate>
      <lastBuildDate>2017-11-17 17:22:03 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet-assets.s3.amazonaws.com/icons/Folder.png</url>
      </image>
      <item>
         <title>HashMap</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101381</link>
         <description><![CDATA[<div>Have a hashing algorithm to create addresses/keys for elements</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:02:06 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101381</guid>
      </item>
      <item>
         <title>Everything</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101398</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:02:07 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101398</guid>
      </item>
      <item>
         <title>ArrayLists</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101541</link>
         <description><![CDATA[<div>size is dynamic<br>takes objects and generics<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:02:25 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101541</guid>
      </item>
      <item>
         <title>ArrayList </title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101606</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:02:33 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101606</guid>
      </item>
      <item>
         <title>Hash map is the good shit</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101612</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:02:34 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101612</guid>
      </item>
      <item>
         <title>ArrayLists are dynamic </title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101629</link>
         <description><![CDATA[<div>no clue on HashMaps</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:02:36 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101629</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101751</link>
         <description><![CDATA[<div>Arraylist - like array, but is not fixed in length.<br>HashMap - a bit like two dimentional array<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:02:52 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101751</guid>
      </item>
      <item>
         <title>hashmap¿?</title>
         <author>vcasadoh</author>
         <link>https://padlet.com/skCompSci/collections/wish/208101791</link>
         <description><![CDATA[<div>Hashmap?</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:02:57 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101791</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101813</link>
         <description><![CDATA[<div>Array lists are sets of values of the same type, with indices. HashMaps are sets of values which can have keys as well</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:00 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101813</guid>
      </item>
      <item>
         <title>What is a hash map</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101814</link>
         <description><![CDATA[<div>Sounds yummy</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:00 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101814</guid>
      </item>
      <item>
         <title>Hashmaps require a key to indicate which Element you want. Those Keys can be anything and dont follow a certain order</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101879</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:08 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101879</guid>
      </item>
      <item>
         <title>whats a hash map?</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208101913</link>
         <description><![CDATA[<div>please someone tell me</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:11 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208101913</guid>
      </item>
      <item>
         <title>ArrayLists</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102142</link>
         <description><![CDATA[<div>ArrayLists are similar to arrays but have a dynamic size that automatically updates based on the number of elements stored within</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:35 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102142</guid>
      </item>
      <item>
         <title>nothing</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102154</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:37 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102154</guid>
      </item>
      <item>
         <title>ArrayList dynamic Array static, .add is life</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102197</link>
         <description><![CDATA[<div>p.s wtf is a hash map please stop this madness</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:41 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102197</guid>
      </item>
      <item>
         <title>Arraylists are variables; are classes</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102208</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:43 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102208</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102232</link>
         <description><![CDATA[<div>ArrayList is a dynamic type of array which doesn't have fixed length. It uses wrappers.&nbsp;<br><br>Nothing about hash maps.</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:47 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102232</guid>
      </item>
      <item>
         <title>I said a pound of hash is heavier than a pound of feathers!!</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102276</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:03:51 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102276</guid>
      </item>
      <item>
         <title>arraylists can hold more than one data type</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102338</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:00 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102338</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102441</link>
         <description><![CDATA[<div>I don’t know what is “HashMaps”</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:10 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102441</guid>
      </item>
      <item>
         <title>Array lists</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102468</link>
         <description><![CDATA[<div>Need to be imported before they can work<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:13 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102468</guid>
      </item>
      <item>
         <title>Not enough</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102548</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:22 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102548</guid>
      </item>
      <item>
         <title>Array</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102553</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:23 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102553</guid>
      </item>
      <item>
         <title>420 good shit</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102593</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:26 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102593</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102594</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:27 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102594</guid>
      </item>
      <item>
         <title>Array list is only one</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102595</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:27 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102595</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102637</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:32 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102637</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102652</link>
         <description><![CDATA[<div>Hash maps can be used when dealing with large data</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:34 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102652</guid>
      </item>
      <item>
         <title>Arraylist</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102681</link>
         <description><![CDATA[<div>Dynamic, can be transform into array.<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:38 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102681</guid>
      </item>
      <item>
         <title>ArrayList is bad when it comes to deleting/inserting elements</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102757</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:46 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102757</guid>
      </item>
      <item>
         <title>ArrayList</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208102826</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 14:04:53 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208102826</guid>
      </item>
      <item>
         <title>idk</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139482</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:01 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139482</guid>
      </item>
      <item>
         <title>Differences between ArrayLists and Hashmaps</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139689</link>
         <description><![CDATA[<div>Ordering: ArrayLists yes&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Hashmaps no<br>Indexes:&nbsp; ArrayLists yes<br>&nbsp;                  Hasmmaps no</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:27 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139689</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139781</link>
         <description><![CDATA[<div>Hashmap larger</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:39 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139781</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139815</link>
         <description><![CDATA[<div>Methods,<br>The way the data is stored,<br>Cannot have duplicates<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:43 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139815</guid>
      </item>
      <item>
         <title>hashmaps</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139829</link>
         <description><![CDATA[<div>holds values like an arraylist but every value has a key connected to it.<br><br>arraylists can hold duplicate values but hashmaps cannot have duplicates of the key<br><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:45 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139829</guid>
      </item>
      <item>
         <title>Arraylists hold repeated values</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139853</link>
         <description><![CDATA[<div>This is less efficient when doing operations like quick maffs</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:48 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139853</guid>
      </item>
      <item>
         <title>You can delete only one element at a time with the same content where as with hash maps you can delete two elements at the same time</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139854</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:48 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139854</guid>
      </item>
      <item>
         <title>Within an array list of you want to remove a value that has been entered twice it will remove the first value it finds on the list however, within a hashmap it will remove the value no matter where it is stated within the values. </title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139932</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:56 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139932</guid>
      </item>
      <item>
         <title>Adding elements</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139944</link>
         <description><![CDATA[<div>.add() - ArrayList<br>.put() - HashMaps</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:58 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139944</guid>
      </item>
      <item>
         <title>Insertion Order</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208139954</link>
         <description><![CDATA[<div>ArrayList maintains the insertion order while HashMap doesn’t.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:10:59 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208139954</guid>
      </item>
      <item>
         <title>2 plus 2 is 4 minus 1  thats 3 quick maths</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140003</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:04 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140003</guid>
      </item>
      <item>
         <title>Keys and Values in hashmaps</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140042</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:09 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140042</guid>
      </item>
      <item>
         <title>hashmaps and arraylist</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140091</link>
         <description><![CDATA[<div>Hashmaps take a key, which has a stored value. Hashmaps accessed via key whereas arraylists accessed thru indes</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:15 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140091</guid>
      </item>
      <item>
         <title>You can have the same elements in an arraylist but only unique in the key of hashmaps</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140107</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:17 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140107</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140152</link>
         <description><![CDATA[<div>Hash map cannot have key duplicates</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:22 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140152</guid>
      </item>
      <item>
         <title>Hashmaps are dynamic and can remove multiple values </title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140154</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:22 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140154</guid>
      </item>
      <item>
         <title>Array list are longer than hash maps. Hash maps are more suitable to work with large data</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140158</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:23 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140158</guid>
      </item>
      <item>
         <title>Insertion Order</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140160</link>
         <description><![CDATA[<div>ArrayList maintains the insertion order while HashMap doesn’t.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:23 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140160</guid>
      </item>
      <item>
         <title>kęý</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140161</link>
         <description><![CDATA[<div><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:23 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140161</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140214</link>
         <description><![CDATA[<div>Hashmaps cannot contain duplicate keys, whereas array lists can contain duplicate values </div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:30 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140214</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140279</link>
         <description><![CDATA[<div>HashMaps as the name says, it will map a KEY , to a specific value, that means that we can bring a value using the key</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:38 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140279</guid>
      </item>
      <item>
         <title>hashmaps link keys to values</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140306</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:40 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140306</guid>
      </item>
      <item>
         <title>Pundai</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140344</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:44 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140344</guid>
      </item>
      <item>
         <title>Removal</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140393</link>
         <description><![CDATA[<div>HashMap performes better when it comes to removing elements</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:49 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140393</guid>
      </item>
      <item>
         <title>Always display a random list of their elements</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140407</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:50 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140407</guid>
      </item>
      <item>
         <title>Everything up to arraylists</title>
         <author>sxatzakis</author>
         <link>https://padlet.com/skCompSci/collections/wish/208140444</link>
         <description><![CDATA[<div>casts, .ordinal()...<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:54 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140444</guid>
      </item>
      <item>
         <title>ArrayList vs Hashmaps</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140452</link>
         <description><![CDATA[<div>Ordering: ArrayLists yes <br>                    Hashmaps no<br>Indexes:  ArrayLists yes<br>                   Hasmmaps no</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:56 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140452</guid>
      </item>
      <item>
         <title>Everything</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140456</link>
         <description><![CDATA[<div><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:11:56 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140456</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140579</link>
         <description><![CDATA[<div>can inly access stuff using .get in hashmap whereas </div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:12:10 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140579</guid>
      </item>
      <item>
         <title>arraylists allow duplicate elements </title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140629</link>
         <description><![CDATA[<div>hashmaps do not allow duplicate keys but do allow duplicate keys </div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:12:14 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140629</guid>
      </item>
      <item>
         <title>Hash maps are more confusing</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140668</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:12:18 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140668</guid>
      </item>
      <item>
         <title>ArrayLists vs Hashmaps</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140699</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:12:22 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140699</guid>
      </item>
      <item>
         <title>python&gt;java</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140754</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:12:27 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140754</guid>
      </item>
      <item>
         <title>Memmory space</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140759</link>
         <description><![CDATA[<div>Memmory space</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:12:28 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140759</guid>
      </item>
      <item>
         <title>Mans not hot</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140826</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:12:36 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140826</guid>
      </item>
      <item>
         <title>Quick maffs </title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208140904</link>
         <description><![CDATA[<div>2+2 = 4 -1 = 3</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:12:44 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208140904</guid>
      </item>
      <item>
         <title>Hash not hot</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208141299</link>
         <description><![CDATA[<div>Array hot</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:13:30 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208141299</guid>
      </item>
      <item>
         <title>Misconceptions</title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208147450</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:24:41 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208147450</guid>
      </item>
      <item>
         <title></title>
         <author></author>
         <link>https://padlet.com/skCompSci/collections/wish/208147918</link>
         <description><![CDATA[<div>What is a hashmap</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-11-17 15:25:27 UTC</pubDate>
         <guid>https://padlet.com/skCompSci/collections/wish/208147918</guid>
      </item>
   </channel>
</rss>
