# Easy

- [Middle Node](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/middle-node.md)
- [Evaluate Expression Tree](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/evaluate-expression-tree.md)
- [Insertion Sort](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/insertion-sort.md)
- [Semordnilap](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/semordnilap.md)
- [First Non Repeating Character](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/first-non-repeating-character.md)
- [Generate Document](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/generate-document.md)
- [Run Length Encoding](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/run-length-encoding.md)
- [Caesar Cipher Encryptor](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/caesar-cipher-encryptor.md)
- [Palindrome Check](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/palindrome-check.md)
- [Selection Sort](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/selection-sort.md)
- [Bubble Sort](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/bubble-sort.md)
- [Find Three Largest Sum](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/find-three-largest-sum.md)
- [Binary Search](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/binary-search.md)
- [Product Sum](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/product-sum.md)
- [Nth Fibonacci](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/nth-fibonacci.md)
- [Remove Duplicates From LinkedList](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/remove-duplicates-from-linkedlist.md)
- [Tandem Bicycle](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/tandem-bicycle.md)
- [Class Photos](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/class-photos.md)
- [Minimum Waiting Time](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/minimum-waiting-time.md)
- [Depth-first Search](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/depth-first-search.md)
- [Node Depths](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/node-depths.md)
- [Branch Sums](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/branch-sums.md)
- [Find Closest Value In Bst](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/find-closest-value-in-bst.md)
- [Non Constructible Change](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/non-constructible-change.md)
- [Tournament Winner](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/tournament-winner.md)
- [Sorted Squared Array](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/sorted-squared-array.md)
- [Validate Subsequences](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/validate-subsequences.md)
- [Two Number Sum](https://algorithm.prettylog.com/algorithm-problems/algoexpert/easy/two-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/easy.md?ask=<question>
```

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.