Programming-Fundamentals

Code samples for Big O notation, Data Structures, and Algorithms that constitute the basics of understanding the coding principles.

This is structured as below:

BigO Notation

• O(1)
• O(n)
• O(m + n)
• O(logn) - tbd
• O(nlogn) - tbd
• O(m*n)
• O(n^2)

Data Structure

• Array
• Hash Table
• Tree
  • Binary Search Tree (normal)
  • Binary Search Tree (LeetCode)
  • Heap - tbd
  • Trie - tbd
• Graph
• Linked List
  • Singly Linked List
  • Doubly Linked List
• Circular Linked List -tbd
• Queue
• Stack
  • Array implementation
  • Linked List implementation

Algorithm

• Recursion
  • Factorial
  • Fibonacci
  • Reverse a string
• Sorting
  • Bubble Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Selection Sort
• Searching
  • Binary Search
  • Breadth First Search
  • Depth First Search
  • Linear Search
• Dynamic Programming / Memoization -Bottom-Up -Fibonacci -Memoization

Additional:

• Kadanes Algorithm
• Floyd's Algorithm

There are topics solved under LeetCode, they are as follows:

• Dynamic Programming
• Arrays
• Trees
• Traversal
• Depth-First Search
• Breadth-First Search
• Graphs
• Linked Lists
• Stacks
• Queues

This repository aims to contain all the common fundamentals of programming. This repository will be updated to reflect my progress.

Copyright © 2024.