# Medium - [Missing Numbers](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/missing-numbers.md) - [Beat Seat](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/beat-seat.md) - [Suffix Trie Construction](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/suffix-trie-construction.md) - [One Edit](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/one-edit.md) - [Minimum Characters For Words](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/minimum-characters-for-words.md) - [Reverse Words in String](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/reverse-words-in-string.md) - [Valid IP Addresses](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/valid-ip-addresses.md) - [Group Anagrams](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/group-anagrams.md) - [Longest Palindromic Substring](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/longest-palindromic-substring.md) - [Next Greater Element](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/next-greater-element.md) - [Sort Stack ⇒ recursive good -](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/sort-stack-recursive-good.md) - [Sunset Views](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/sunset-views.md) - [Balanced Brackets](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/balanced-brackets.md) - [Min Max Stack Construction](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/min-max-stack-construction.md) - [Three Number Sort ⇒ counting sort or radix sort ⇒ three pointer with in-place swap](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/three-number-sort-counting-sort-or-radix-sort-three-pointer-with-in-place-swap.md) - [Staircase Traversal ⇒ it is like the number of ways to change](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/staircase-traversal-it-is-like-the-number-of-ways-to-change.md) - [Phone Number Mnemonics ⇒ can use word and index to create each case without concatenation](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/phone-number-mnemonics-can-use-word-and-index-to-create-each-case-without-concatenation.md) - [Power Set](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/power-set.md) - [Permutations -](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/permutations.md) - [Merging LinkedLists](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/merging-linkedlists.md) - [Sum Of Linked Lists -](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/sum-of-linked-lists.md) - [Remove Kth Node From End -](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/remove-kth-node-from-end.md) - [Linked List Construction - Doubly Linked List ?](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/linked-list-construction-doubly-linked-list.md) - [Min Heap Construction](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/min-heap-construction.md) - [Valid Starting City](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/valid-starting-city.md) - [Task Assignment - use two pointer](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/task-assignment-use-two-pointer.md) - [Two Colorable - Graph](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/two-colorable-graph.md) - [Minimum Passes Of Matrix](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/minimum-passes-of-matrix.md) - [Cycle in Graph -](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/cycle-in-graph.md) - [Remove Islands -](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/remove-islands.md) - [Youngest Common Ancestor](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/youngest-common-ancestor.md) - [River Sizes -](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/river-sizes.md) - [Breadth First Search](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/breadth-first-search.md) - [Single Cycle Check](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/single-cycle-check.md) - [Union Find](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/union-find.md) - [Stable Internships](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/stable-internships.md) - [Kadane’s Algorithm](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/kadanes-algorithm.md) - [Levenshtein Distance](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/levenshtein-distance.md) - [Min Number Of Coins For Change](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/min-number-of-coins-for-change.md) - [Number Of Ways To Make Change](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/number-of-ways-to-make-change.md) - [Number Of Ways To Traverse Graph](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/number-of-ways-to-traverse-graph.md) - [Max Subset Sum No Adjacent](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/max-subset-sum-no-adjacent.md) - [Symmetrical Tree](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/symmetrical-tree.md) - [Merge Binary Trees](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/merge-binary-trees.md) - [Height Balanced Binary Tree](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/height-balanced-binary-tree.md) - [Find Successor](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/find-successor.md) - [Binary Tree Diameter](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/binary-tree-diameter.md) - [Invert Binary Tree](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/invert-binary-tree.md) - [Reconstruct Bst](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/reconstruct-bst.md) - [Find Kth Largest Value In Bst](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/find-kth-largest-value-in-bst.md) - [Min Height BST](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/min-height-bst.md) - [BST Traversal](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/bst-traversal.md) - [Validate Bst](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/validate-bst.md) - [BST Construction](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/bst-construction.md) - [Zero Sum Subarray + find indices of sub array](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/zero-sum-subarray-+-find-indices-of-sub-array.md) - [Merge Overlapping Intervals](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/merge-overlapping-intervals.md) - [First Duplicate Number](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/first-duplicate-number.md) - [Array of Products](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/array-of-products.md) - [Longest Peak](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/longest-peak.md) - [Spiral Traverse](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/spiral-traverse.md) - [Monotonic Array](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/monotonic-array.md) - [Move Element To End](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/move-element-to-end.md) - [Smallest Difference](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/smallest-difference.md) - [Three Number Sum](https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium/three-number-sum.md) --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://algorithm.prettylog.com/algorithm-problems/algoexpert/medium.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.