# exercises

- [Binarysearch](/coding/exercises/binarysearch.md)
- [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)
- [Leetcode](/coding/exercises/leetcode.md)
- [Tree](/coding/exercises/leetcode/tree.md)
- [Lowest Common Ancestor (LCA)](/coding/exercises/leetcode/tree/lowest-common-ancestor-lca.md): Given two nodes of a binary tree, return their Lowest Common Ancestor (LCA). LCA is a node within a tree T is the lowest node that has both p and q as descendants.
- [Arrays](/coding/exercises/leetcode/arrays.md)
- [Duplicate Zeros](/coding/exercises/leetcode/arrays/duplicate-zeros.md)
- [Merge Sorted Array](/coding/exercises/leetcode/arrays/merge-sorted-array.md)
- [Detect Pattern of Length M Repeated K or More Times](/coding/exercises/leetcode/arrays/detect-pattern-of-length-m-repeated-k-or-more-times.md)
- [Linked List](/coding/exercises/leetcode/linked-list.md)
- [Single LinkedList](/coding/exercises/leetcode/linked-list/single-linkedlist.md)
- [Double LinkedList](/coding/exercises/leetcode/linked-list/double-linkedlist.md)
- [Add Two Numbers](/coding/exercises/leetcode/linked-list/add-two-numbers.md)
- [Middle of the LinkedList](/coding/exercises/leetcode/linked-list/middle-of-the-linkedlist.md)
- [Remove Nth Node From End of List](/coding/exercises/leetcode/linked-list/remove-nth-node-from-end-of-list.md)
- [Map & Set](/coding/exercises/leetcode/map-and-set.md)
- [Two Sum](/coding/exercises/leetcode/map-and-set/two-sum.md)
- [Contains Duplicate](/coding/exercises/leetcode/map-and-set/contains-duplicate.md)
- [Deque](/coding/exercises/leetcode/deque.md)
- [Valid Palindrome](/coding/exercises/leetcode/deque/valid-palindrome.md)
- [String](/coding/exercises/leetcode/string.md)
- [Atoi](/coding/exercises/leetcode/string/atoi.md)
- [Sorting](/coding/exercises/leetcode/sorting.md)
- [Minimum Deletions to Make Character Frequencies Unique](/coding/exercises/leetcode/sorting/minimum-deletions-to-make-character-frequencies-unique.md)
- [Graph](/coding/exercises/leetcode/graph.md)
- [Find if Path Exist in Graph](/coding/exercises/leetcode/graph/find-if-path-exist-in-graph.md)
- [Greedy](/coding/exercises/leetcode/greedy.md)
- [Minimum Sum of Four Digit Number After Splitting Digits](/coding/exercises/leetcode/greedy/minimum-sum-of-four-digit-number-after-splitting-digits.md)
- [Binary Search](/coding/exercises/leetcode/binary-search.md)
- [Binary Search](/coding/exercises/leetcode/binary-search/binary-search.md)
- [First Bad Version](/coding/exercises/leetcode/binary-search/first-bad-version.md)
- [Search Insert Position](/coding/exercises/leetcode/binary-search/search-insert-position.md)
- [Dynamic Programming](/coding/exercises/leetcode/dynamic-programming.md)
- [Maximum Subarray](/coding/exercises/leetcode/dynamic-programming/maximum-subarray.md)
- [Math](/coding/exercises/leetcode/math.md)
- [Rotate Array](/coding/exercises/leetcode/math/rotate-array.md)
- [Convert Integer to the Sum of Two No-Zero Integers](/coding/exercises/leetcode/math/convert-integer-to-the-sum-of-two-no-zero-integers.md)
- [Hackerrank](/coding/exercises/hackerrank.md)
- [Tree](/coding/exercises/hackerrank/tree.md)
- [Binary Tree Height](/coding/exercises/hackerrank/tree/binary-tree-height.md)
- [Binary Tree](/coding/exercises/hackerrank/tree/binary-tree.md)
- [Balanced Forest](/coding/exercises/hackerrank/tree/balanced-forest.md)
- [Exercises](/coding/exercises/exercises.md)
- [Sort with K Misplaced Elements](/coding/exercises/exercises/sort-with-k-misplaced-elements.md)
- [Cord Tree](/coding/exercises/exercises/cord-tree.md)
- [Log](/coding/exercises/exercises/log.md)
- [Min Steps to Make Piles Equal Height](/coding/exercises/exercises/min-steps-to-make-piles-equal-height.md)
- [Partition array into N subsets with balanced sum](/coding/exercises/exercises/partition-array-into-n-subsets-with-balanced-sum.md)
- [Codeforces](/coding/exercises/codeforces.md)
- [Dynamic Programming](/coding/exercises/codeforces/dynamic-programming.md)
- [Coins](/coding/exercises/codeforces/dynamic-programming/coins.md)