Coding Interview Questions

Prerequisites

Algorithms and data structures are fundamental to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. This repository's goal is to demonstrate how to correctly implement common data structures and algorithms in the simplest and most elegant ways for your interview prep.

Table Of Contents

• Arrays
• BackTracking and Recursion
• Binary Search Probs
• Dynamic Programming
  • DPon Trees
  • LCS
  • MCM
  • UnBounded KnapSack
  • Zero One KnapSack
• Graphs
• Greedy
• Heaps
• Linked List
• Pointers
• Sliding Window
• Sorting
• Stacks
• Strings
• Trees

🤝 Contributing

Contributions, issues and feature requests are welcome. Feel free to check issues page if you want to contribute.

Show your support

Please ⭐️ this repository if this project helped you!

License

This repository is released under the MIT license. In short, this means you are free to use this software in any personal, open-source or commercial projects. Attribution is optional but appreciated.