Algo corner

▼

Table of Contents

Suggestions, other websites, competitions :

  • Programming Competitions and Training
Math :
  • GCD and LCM
Graph :
  • Introducing to Graph
  • Graph Representations
  • Graph Properties
  • Different Graphs
  • Informed and Uninformed search
  • Breath First Search (BFS)
  • Depth First Search (DFS)
  • Flood Fill Algorithm
  • Breath First Scanning - Source : USACO
  • Minimum Spanning Tree (MST)
  • Bellman Ford
  • Dijkstra's algorithm
  • Floyed Warshal
  • Topological Sort
  • Graph Exercises
Competitions + Small analysis :

  • Google Kickstart Practice Round 2019
  • Google Code Jam Qualification Round 2019
  • Codechef August Challenge 2019 Div 2
  • Facebook Hacker Cup Qualification Round 2019
C++ Tutorial :

  • Variables

C++ STL :

  • std::next_permutation(arr.begin(), arr.end())


Other :
  • Big O Notation
  • Tips and C++ Template
  • Fastest way to read input from stdin
  • int128_t
  • Extensions of GNU (rope, policy based data structures ...)

No comments:

Post a Comment

Home
View web version

About Me

Algo Corner
View my complete profile
Powered by Blogger.