## Overview ### General Tips - Strings - Consider the length of the average string ### Cheatsheets #### Algorithms | Algorithm | Time Complexity | | ------------- | --------------- | | Sorting Array | O(nlog(n)) | #### Data Structures | Data Structure | | | [[Big O - Time Complexity]] | | -------------- | --------- | ------------------- | --------------------------- | | [[Arrays]] | Access... | *by index* | O(1) | | | Add... | *before first node* | O(N) | | | | *after given node* | O(N) | | | | *after last node* | O(1) | | | Delete... | *the first node* | O(N) | | | | *a given node* | O(N) | | | | *the last node* | O(1) | | | Search... | *a given node* | O(N) |