# Python

- [Map](/viceintelpro/python/map.md)
- [Anonymous Functions](/viceintelpro/python/anonymous-functions.md)
- [Recursion](/viceintelpro/python/recursion.md)
- [ZipMap](/viceintelpro/python/recursion/zipmap.md): Zip two lists into a dictionary
- [Nested Sum](/viceintelpro/python/recursion/nested-sum.md)
- [Recursion on a Tree](/viceintelpro/python/recursion/recursion-on-a-tree.md)
- [Count Nested Levels](/viceintelpro/python/recursion/count-nested-levels.md)
- [Longest Word](/viceintelpro/python/recursion/longest-word.md): In Doc2Doc, we have a search function to find the longest word in a document.
- [Function Transformations](/viceintelpro/python/function-transformations.md)
- [More Transformations](/viceintelpro/python/function-transformations/more-transformations.md)
- [Why Transform?](/viceintelpro/python/function-transformations/why-transform.md)
- [Closures](/viceintelpro/python/closures.md)
- [Currying](/viceintelpro/python/currying.md)
- [Decorators](/viceintelpro/python/decorators.md)
- [Sum Types](/viceintelpro/python/sum-types.md)
- [Enums](/viceintelpro/python/enums.md)
- [Match](/viceintelpro/python/match.md)
- [Regex](/viceintelpro/python/regex.md): We need to understand a bit about regexes, or "regular expressions". "Regex" for short, is a programming-language-agnostic way of searching for patterns in text.