This document provides an overview of an approach to learning data structures and algorithms that focuses on enumerating possible solutions to problems with different complexities, rather than just presenting theorems and proofs. It is intended to help with interview, course, and competition exam preparation by improving thinking skills. All code examples are written in C but are not language-specific. It recommends completely reading each chapter, which presents required theory and related problems, and then practicing applying techniques to new questions in order to analyze multiple solutions.

1. 𝐵𝑖𝑔 𝐽𝑜𝑏 𝐻𝑢𝑛𝑡𝑖𝑛𝑔 𝑀𝑎𝑑𝑒 𝐸𝑎𝑠𝑦!

3. Followed a pattern of improving the problem solutions with different complexities (for each problem, observe multiple solutions with different 𝑖𝑚𝑝𝑟𝑜𝑣𝑒𝑑 complexities).

4. Enumeration of possible solutions.

5. With this approach, even if we get a new question it gives us a way to 𝑡h𝑖𝑛𝑘 about all possible solutions..

7. 𝐶𝑜𝑢𝑟𝑠𝑒 𝑝𝑟𝑒𝑝𝑎𝑟𝑎𝑡𝑖𝑜𝑛

8. 𝐶𝑎𝑚𝑝𝑢𝑠 𝑝𝑟𝑒𝑝𝑎𝑟𝑎𝑡𝑖𝑜𝑛

9. 𝐼𝑚𝑝𝑟𝑜𝑣𝑖𝑛𝑔 𝑡h𝑖𝑛𝑘𝑖𝑛𝑔

10. 𝐼𝑛𝑠𝑡𝑟𝑢𝑐𝑡𝑜𝑟𝑠

11. 𝐶𝑜𝑚𝑝𝑒𝑡𝑖𝑡𝑖𝑜𝑛 𝑒𝑥𝑎𝑚𝑠

13. It won’t be difficult for 𝐽𝑎𝑣𝑎 (or any other language) readers as the solutions were not language specific.

15. Give one complete reading for better understanding and to know about different techniques.

16. For every new question try to 𝑎𝑝𝑝𝑙𝑦 the techniques from previous chapters to solve it.

17. Observe 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 solutions for same problem and analyze.

18. For new questions please follow our facebook/twitter/blogs.

19. 𝐴𝑙𝑙 𝑡h𝑒 𝑏𝑒𝑠𝑡 𝐻𝑎𝑣𝑒 𝑎 𝑛𝑖𝑐𝑒 𝑟𝑒𝑎𝑑𝑖𝑛𝑔!