View gist:5b14a1d445faf446437189bd9cb3ae0b
Below are the Big O performance of common functions of different Java Collections.
List | Add | Remove | Get | Contains | Next | Data Structure
ArrayList | O(1) | O(n) | O(1) | O(n) | O(1) | Array
LinkedList | O(1) | O(1) | O(n) | O(n) | O(1) | Linked List
CopyOnWriteArrayList | O(n) | O(n) | O(1) | O(n) | O(1) | Array
View The Technical Interview Cheat

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

###Array ####Definition:

  • Stores data elements based on an sequential, most commonly 0 based, index.
  • Based on tuples from set theory.
View Struts2
old page
View gist:3d7926cfc5136aa95b3342b7fcd1c15a
View gist:9ea5b68a1bafa75918a228748ce80a54
View gist:9108704882705396497322d0b2e00478
View gist:fb52870ea2217e112a88edfc39387985
View gist:a8bc11c615dc112c60ce85d93be498dd
View gist:5362d38c358c4e8e88440e137f14181f
4 read (r)
2 write (w)
1 execute (x)
7 = 4+2+1 (read/write/execute)
6 = 4+2 (read/write)
5 = 4+1 (read/execute)