1. String Reversal
2. Palindrome
3. Integer Reversal
4. Max Chars
5. FizzBuzz
6. Array Chunk
7. Anagrams
8. Sentence Capitalization
9. Printing Steps
10. Pyramid - Two Sided Steps
11. Find the Vowels
12. Generate Matrix Spiral
13. Fibonacci Series
14. Queue
15. Weave Queues
16. Stack
17. Queue From Stack
18. Linked List
19. Midpoint of a Linked List
20. Detecting Linked List Loops
21. Linked List - Return Nth Element From Last
22. Tree - Breadth First Traversal, Depth First Traversal
23. Tree Width and Level Width
24. Binary Search Tree
25. Validate a Binary Search Tree
26. Bubble Sort, Selection Sort, Merge Sort

1. Understand the problem in your own words and analyze it. Never assume that you've done it before. Does the problem have any constraints w.r.t time and space complexity, inputs, things to avoid, etc. Are you allowed to modify the input?
2. Input and Output types, how many inputs and outputs
3. Come up with examples and edge cases.
4. Break down the problem into subproblems and solve them independently, think of strategies that might work and think about why the strategies might not work. Think about patterns, data structures and algorithms that you can use. Try out your strategy for specific cases (debug on examples), then generalize.
5. Write Pseudocode and think about considerations while converting pseudocode to real code.
6. Code your solution, then simplify and optimize code by checking for time and space complexity, code repetition, readability, code length, comments. BUD optimization - Bottlenecks, Unnecessary code, Duplicate code.

Consolidated from the following references:

• https://medium.com/swlh/an-algorithmic-approach-to-solving-algorithms-a9fe8fc528d
• https://www.geeksforgeeks.org/how-to-approach-a-coding-problem/
• https://www.freecodecamp.org/news/how-to-approach-any-algorithm-interview-without-panicking-b6d7ae5c050/