Collection of Algorithm and Data Structures challenges, with solutions in different languages.
- Challenges are divided by difficulty
- Challenges are divided by related data-structure
- This just implies a suitable data-structure that makes the solution easier to understand, but does not mean you cannot think of an alternative or better solution using a different data-structure.
- Each challenge includes a README.md with a description of a problem and some preconditions and restrictions such as time/space complexity.
- Example solutions are intended to be used once you come up with a solution on your own.
- Finding Single Missing Element
- Finding Multiple Missing Elements from sorted array
- Finding Duplicates in sorted array
- Finding Duplicates in unsorted array
- Finding a Pair of Elements with sum K in unsorted array
- Finding a Pair of Elements with sum K in a sorted array
- Finding Max and Min in a single scan
- Binary Search
- Find Three Largest Numbers
- Caesar Cipher Encryptor
- Validate Subsequence