Investigate DSA - Add one example under the hoods

[mariatorrentedev]

The idea is to have an example of each data structure with a cool implementation.

Take this time to investigate DSA and create DOC to support your job hunt.

[mariatorrentedev]

• Data types
• Basic Bitwise Operations
• String Operations
• Arrays
• Linked Lists
  • Singly Linked
  • Doubly Linked
  • Circular Linked
• Queues
• Stacks
• Heaps
• Trees
  • Binary Trees
  • Binary Search Trees
  • Tries
  • Self Balancing Trees
• Traversing Trees
  • Breadth First Search - BFS
  • Depth First Search - DFS
  • Preorder, Inorder, Postorder
• Graphs
  • Dijkstra's Algorithm / A* Search
• Hash Maps
  • Handling Collisions
• Sorting algorithms
  • Insertion
  • Selection
  • Merge
  • Quick
• Time Complexities
• Programming Paradigm
  • Dynamic Programming
  • Object Oriented Programming
  • Asynchronous Programming
  • Functional Programming

Resources:

• Time Complexity in DSA