# Binarysearch

- [Dynamic Programming](/coding/exercises/binarysearch/dynamic-programming.md)
- [0 - 1 Knapsack](/coding/exercises/binarysearch/dynamic-programming/0-1-knapsack.md)
- [String](/coding/exercises/binarysearch/string.md)
- [Longest Palindromic Substring](/coding/exercises/binarysearch/string/longest-palindromic-substring.md)
- [Add Binary Numbers](/coding/exercises/binarysearch/string/add-binary-numbers.md)
- [Addhoc](/coding/exercises/binarysearch/addhoc.md)
- [Long Distance](/coding/exercises/binarysearch/addhoc/long-distance.md)
- [Tree](/coding/exercises/binarysearch/tree.md)
- [Twin Tree](/coding/exercises/binarysearch/tree/twin-tree.md)
- [Merging Binary Tree](/coding/exercises/binarysearch/tree/merging-binary-tree.md)
- [Tree Sum](/coding/exercises/binarysearch/tree/tree-sum.md)
- [Univalue Tree](/coding/exercises/binarysearch/tree/univalue-tree.md)
- [Tree Traversal](/coding/exercises/binarysearch/tree/tree-traversal.md)
- [Graph](/coding/exercises/binarysearch/graph.md)
- [Mutual Followers](/coding/exercises/binarysearch/graph/mutual-followers.md)
- [Trie](/coding/exercises/binarysearch/trie.md)
- [Trie](/coding/exercises/binarysearch/trie/trie.md)