Algorithmic-Programming

Algorithmic Programming Exercises

Details about exercises can be found in Readme files within packages and are linked from this master Readme too.

• Advent of Code 2021
• Google Code Jame
• Facebook Hacker Cup
  • Qualification Round 2013
  • Qualification Round 2012
• Stanford (Coursera.org) Algorithms - Design and Analysis Part 1
• Data Structures
  • Graph Algorithms
  • BFSAdjacencyMatrix
  • Topological Sort
  • Tree Algorithms
    • In-order traversal
    • Pre-order traversal
    • Breadth first traversal
    • Depth first traversal
    • Search in a BST
    • Successor of a node in a BST
    • Insert node in a BST
    • Delete node in a BST
• Sorting
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Heap Sort
• Exercises from the book - Cracking the Coding Interview
  • Arrays and Strings
  • LinkedLists
  • Recursion and Dynamic Programming
  • Bit Manipulation
• Exercises from the book - Cracking the Coding Interview, 6th edition
• Exercises from the book - Programming Interviews Exposed
  • Linked Lists
  • Trees and Graphs
  • Arrays and Strings
  • Recursion Problems
• Exercises from LeetCode Online Judge
• Basic FIFO/FILO and sorting Data Structures Exercice
• Miscellaneous Algorithms
  • Counting Inversions in an array
  • MaxSubarray Problem
  • Max sum, non-consectuvive numbers in array
  • String permutations
  • All points from origin to a given point in a 2D matrix
  • Merging K sorted arrays

Note: Refer to tests (where available) to see the implementation in action