Time complexity tuesdays

General

• [] Time complexity
• [] Data structures:
  • under construction..
• [] Algorithms:
  • [] Sorting algorithms
  • Searches
    • Binary search
    • Linear search
  • [] Greedy
  • [] Dynamic programming
    • Recursion
    • Memoization
    • [] Tabulation
    • [] Knapsack
  • [] Bit manipulation
  • [] Graph algorithms
    • Dfs
    • Bfs
    • Dijkstras
    • [] Tree algorithms (binary tree)
    • [] Strong connectivity (korsarajus algorithm)
  • [] Mathematical topics
    • [] Combinatorics
    • [] Probability
    • [] Markovs chains
    • [] Game theory
  • [] Segment tree

Goals

• Attempt every advent of code problem for at least two hours per person or until completion.

• [] Complet leetcode 21 days of dynamic programming https://leetcode.com/study-plan/dynamic-programming/

• [] Start developement on website

• [] 100 days of continious github commits. No insignificant commits count.

Next Week

Topological sorting

Meeting archive:

• Dynamic Programmig, Tabulation
• Dynamic Programming, recursion and memoization
• Binary Search
• BFS and DFS
• Proofs. Big O notation.
• Basic data structures (lokomotiv1 responsible for scope of topic)
• Fix Archive for weekly meetings