Basic algorithms/techniques to rehearse daily

I have this page set up to help me randomize the basic algorithms/techniques as I practice them to help me avoid relying on cues from previous algorithms to jump-start my memory.

1. Paste the list below into the list randomizer here: https://www.random.org/lists/
2. And then try to write them out from memory here: https://www.online-python.com/
   - I write the input data and function call first, then I write the function.
   - If you don't know or can't remember how to write out the algorithm, check the pastebin link for that algorithm to see the answer.

How to study this list without spending too much time every day:
1. If you haven't learned all of these yet, learn at most one new one per day.
2. When you randomize the list for review, only select the items you've already learned, and only review two per day. This should still give you enough practice with each one to keep it memorized, assuming you're doing this review every day.
3. [TODO: See if this works] Before trying to memorize the sorting algorithms, first pack ~5-10 numbered cards in your backpack and practice performing the sort manually for a few days.

Two Pointers - Two Sum - https://pastebin.com/B1qu06J1
Two Pointers - Valid Palindrome
Sliding Window - Max subarray of size K - https://pastebin.com/vrCdZTku
Sliding Window - Best time to buy and sell stock
Stack - Valid Parentheses
BFS-R - Breadth-first search (recursive) - https://pastebin.com/emt7N5r5
BFS-I - Breadth-first search (iterative) - https://pastebin.com/GcduujfA
DFS-R - Depth-first search (recursive) - https://pastebin.com/CwH8Jez4
DFS-I - Depth-first search (iterative) - https://pastebin.com/kJ9QbZhi
BS-R - Binary search (recursive) - https://pastebin.com/Gkrg4Fy6
BS-I - Binary search (iterative) - https://pastebin.com/PUa5aYLR
DP - Dynamic programming - https://pastebin.com/TYcGDrwc
DAC - Divide and conquer - https://pastebin.com/78dCMR1V
BT - Backtracking - https://pastebin.com/yfNWUpmh
Binary tree - Check if two trees are the same - https://pastebin.com/pvEtvTJg
Binary tree - Invert it - https://pastebin.com/5ii5MSDK
Linked List - Get the middle node - https://pastebin.com/TvMwzHeR
Linked List - Reverse the list - https://pastebin.com/qFTYp63y
Linked List - Merge two sorted lists - https://pastebin.com/t7fXaX1a

Low-priority:
Dijkstra's algorithm - https://pastebin.com/Mzewnmby
A* - https://pastebin.com/yi1aLrPm
Topological sort - https://pastebin.com/0M8zwhqW
Partition algorithm - https://pastebin.com/mvqCednj
QuickSort - https://pastebin.com/x02GMp0d
Bubble sort - https://pastebin.com/2Ugmw439
Selection sort - https://pastebin.com/wSkJABDJ
Insertion sort - https://pastebin.com/0TXwGFpQ
Merge sort - https://pastebin.com/bpp8kais
Heap sort - https://pastebin.com/X1JaNb6C
Radix sort - https://pastebin.com/Yx4enQwb
QuickSelect - https://pastebin.com/ctGLERH3