Summary

I created this repo as a summary for data structures and exercises that I have been practicing for technical interviews preparation, all in JavaScript.

If you have any comments or another point of view feel free to contact me!.

Check my portfolio: macarenacg.com

Best, Maca

Linked List

• add: Add a new Node accept 1 argument data
• insertAt: insert data in an indicated index, accept 2 arguments data && index
• delete: remove the data from the List. accept 1 argument data
• deleteFrom: remove the data form the indicated position, accept 1 argument index
• isEmpty: indicate if the List is Empty
• getSize: return the size of the List.

Hash Table

• An Array to hold values, and a hash function that transform a string key into a numerical index

Tree

• Binary Search Tree

Sorts

• QuickSort: Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. Time: Ω(n log(n))
• Merge Sort: Divide and Conquer algorithm. The merge() function is used for merging two halves. Time: Ω(n log(n))

Reacto

• Subset Exercise with 3 examples:
• For loop solution
• Index
• Memo

Cracking the Coding Interview - 5/189 Programing Questions and Solutions - 6th Edition

• Arrays and Strings
• 1.1 Is Unique
• 1.2 Check Permutation
• 1.3 URLLify
• 1.4 Palindrome Permutation
• 1.5 One Away
• 1.6 String Compression
• 1.7 Rotate Matrix
• 1.8 Zero Matrix
• 1.9 String Rotation