Tags algorithms2 arrays1 asymptotic notation2 backtracking1 bfs2 binary1 binary search1 binary trees1 bit manipulation1 bits1 bitwise1 brian kernighan1 complexity2 connected components1 design patterns1 dfs3 dijkstra1 dp1 dynamic programming2 fast and slow pointers1 floyd's cycle detection1 fsharp1 functional programming1 graphs1 greedy1 hash map1 hash table1 heaps1 in-place1 inorder1 intervals1 kadane1 leetcode2 linked lists1 matrix1 max heap1 memoization1 merge1 merge sort1 min heap1 monads1 optimization1 palindrome1 postorder1 prefix sum1 preorder1 priority queue1 recursion2 scheduling1 sliding window1 sorting1 spiral1 stack1 strings1 tabulation1 top k elements1 topological sort1 traversal2 trees1 trie1 two heaps1 two pointers3 union find1 xor1