Zyro9922 / karumanchi

:satisfied: DS Problems from karumanchi. This repository follows the C++ Best Practices written by Jason Turner.

karumanchi

Almost all problems and codes from Data Structures Made Easy by Narasimha Karumanchi. Mostly written in C++, this repository follows the C++ Best Practices written by Jason Turner. Some of the code follows the general C++ 11 guidelines such as replacing conventional NULL pointers with nullptr.

Some extra implementations have been added as side-projects, mostly written in Java, Python and Assembly. Each sub-directory comes with a readme to help understand the workflow of the code in the directory. Please find the same as you are contributing.

Changelog

• Patch #112: Start CCDSAP preparation.
• Patch #109: Complete practical Karumanchi.
• Patch #106: Start Karumanchi Chapters 17 and 19.
• Patch #102: Add Template Metaprogramming in C++.
• Patch #100: Start Karumanchi Chapter 18.
• Patch #97: Add 8086 and update Internet Technology and Quantum Computing.
• Patch #96: Redo versioning.
• Patch #95: Add Internet Technology and Quantum Computing.
• Patch #90: Start electron application development and remove local packages.
• Patch #88: Add Developer Certificate of Origin.
• Patch #87: Start Karumanchi Chapter 15.
• Patch #80: Add Karumanchi Chapter 11.
• Patch #78: Add python utility to redo Karumanchi workflow.

Pathway

How to find stuff in this repo?

• Bloom Filter
• Codechef
• Codeforces
• External Sorting
• Internet Technology
• JavaScript Algorithms
• Karumanchi

  • Chapter 1 - Introduction
  • Chapter 2 - Recursion and Backtracking
  • Chapter 3 - Linked Lists
  • Chapter 4 - Stacks
  • Chapter 5 - Queues
  • Chapter 6 - Trees
  • Chapter 7 - Priority Queues and Heaps
  • Chapter 8 - Disjoint Sets ADT
  • Chapter 9 - Graph Algorithms
  • Chapter 10 - Sorting
  • Chapter 11 - Searching
  • Chapter 12 - Selection Algorithms [Medians]
  • Chapter 13 - Symbol Tables
  • Chapter 14 - Hashing
  • Chapter 15 - String Algorithms
  • Chapter 17 - Greedy Algorithms
  • Chapter 18 - Divide and Conquer
  • Chapter 19 - Dynamic Programming
• Quantum Computing
• SPOJ
• Standard Template Library (C++)

Contributing

Please checkout the contribution guideline here.

How to run the algorithms?

Please find the how-to run guide here.

Craving for more?

You can find this resource particularly cool to put in use while you're here.

License

Copyright © 2018 Sambhav Jain under LGPL-3.0

Happy Hacking!