Skip to content

Instantly share code, notes, and snippets.

@kumarbhrgv
Last active May 11, 2018 21:54
Show Gist options
  • Save kumarbhrgv/a3872fe095b6a4bf671dba031ec4d467 to your computer and use it in GitHub Desktop.
Save kumarbhrgv/a3872fe095b6a4bf671dba031ec4d467 to your computer and use it in GitHub Desktop.
Basics of progamming

Basics

Algorithmic complexity
Data Structures
* Array
* List
* Stack
* Queue
* Dictionary
* Hash Table
* Set
* Tree
* Heap
* Priority Queue
* Binary Heap
* Binary search trees: BSTs
* balanced search trees
Search
* Binary search
* Interpolation Search
Bitwise operations
Graph/Tree traversals:
* preorder, inorder, postorder, BFS, DFS
* topological sort
* Ashutosh's notes : re-inforcement learning (cost/reward tradeoff)
Sorting:
* Merge
* Quick
* Bucket
* Radix
* Bubble
* Insertion
* Heap
Dynamic Programming:
* Coin toss
* Knapsack
* N Subset problem
* HMM
Design Patterns:
* Factory,
* Façade
* State
* Observer
* Builder
* Adapter
* Decorator
* Flyweight
* Chain
* Momento
* Null
* Strategy
* Template
String searching & manipulations
Tries
System Design examples

TODO

DBMS

Networking

Operating systems

User Interface

Backend

Machine learning

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment