HackerRank solutions in Java/JS/Python/C++/C#
[CopyrightLicense]:./license.md
<p align="center">
	<a href="https://www.hackerrank.com/ryanfehr18"><img src="https://cloud.githubusercontent.com/assets/19765741/25342064/d17a563c-28d8-11e7-83fc-763d4ab4820a.jpg" ></a>
</p>
<p align="center">
    Solutions to problems on HackerRank.
</p>
<p align="center">
	Check out HackerRank's new format <a href="./README_V2.md">here</a>
</p>
<p align="center">
	If you are interested in helping or have a solution in a different language feel free to make a pull request.
</p>
<p align="center">
	<img src="https://img.shields.io/badge/Problems%20Solved-153-brightgreen.svg">
	<img src="https://img.shields.io/badge/Language-Java/JS/Python/C++/CSharp-orange.svg">
	<img src="https://img.shields.io/badge/Latest%20Update-06/21/2018-brightgreen.svg">
</p>







## Algorithms ![AlgorithmsPoints]
- [Warmup](https://github.com/RyanFehr/HackerRank#warmup)
- [Implementation](https://github.com/RyanFehr/HackerRank#implementation)
- [Strings](https://github.com/RyanFehr/HackerRank#strings)
- [Sorting](https://github.com/RyanFehr/HackerRank#sorting)
- [Search](https://github.com/RyanFehr/HackerRank#search)
- [Graph Theory](https://github.com/RyanFehr/HackerRank#graph-theory)
- [Greedy](https://github.com/RyanFehr/HackerRank#greedy)
- [Dynamic Programming](https://github.com/RyanFehr/HackerRank#dynamic-programming)
- [Constructive Algorithms](https://github.com/RyanFehr/HackerRank#constructive-algorithms)
- [Bit Manipulation](https://github.com/RyanFehr/HackerRank#bit-manipulation)
- [Recursion](https://github.com/RyanFehr/HackerRank#recursion)
- [Game Theory](https://github.com/RyanFehr/HackerRank#game-theory)
- [NP Complete](https://github.com/RyanFehr/HackerRank#np-complete)

## DataStructures ![DataStructuresPoints]
- [Arrays](https://github.com/RyanFehr/HackerRank#arrays)
- [Linked Lists](https://github.com/RyanFehr/HackerRank#linked-lists)
- [Trees](https://github.com/RyanFehr/HackerRank#trees)
- [Balanced Trees](https://github.com/RyanFehr/HackerRank#balanced-trees)
- [Stacks](https://github.com/RyanFehr/HackerRank#stacks)
- [Queues](https://github.com/RyanFehr/HackerRank#queues)
- [Heap](https://github.com/RyanFehr/HackerRank#heap)
- [Disjoint Set](https://github.com/RyanFehr/HackerRank#disjoint-set)
- [Multiple Choice](https://github.com/RyanFehr/HackerRank#multiple-choice)
- [Trie](https://github.com/RyanFehr/HackerRank#trie)
- [Advanced](https://github.com/RyanFehr/HackerRank#advanced)

## Mathematics ![MathematicsPoints]
- [Fundamentals](https://github.com/RyanFehr/HackerRank#fundamentals)
- Number Theory
- Combinatorics
- Algebra
- Geometry
- Probability
- Linear Algebra Foundations
## Java ![JavaPoints]
- Introduction
- Strings
- BigNumber
- Data Structures
- [Object Oriented Programming](https://github.com/RyanFehr/HackerRank#object-oriented-programming)
- Exception Handling
- Advanced

### Warmup
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Solve Me First](https://www.hackerrank.com/challenges/solve-me-first)| <ul><li>[Java](./Algorithms/Warmup/Solve%20Me%20First/Solution.java)</li> <li>[C#](./Algorithms/Warmup/Solve%20Me%20First/Solution.cs)</li><ul> | _O(1)_ | _O(1)_| Easy | 1 | ||
|  |[Simple Array Sum](https://www.hackerrank.com/challenges/simple-array-sum)| <ul><li>[Java](./Algorithms/Warmup/Simple%20Array%20Sum/Solution.java)</li> <li>[C#](./Algorithms/Warmup/Simple%20Array%20Sum/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 10 | ||
|  |[Compare the Triplets](https://www.hackerrank.com/challenges/compare-the-triplets)| <ul><li>[Java](./Algorithms/Warmup/Compare%20the%20Triplets/Solution.java)</li> <li>[C#](./Algorithms/Warmup/Compare%20the%20Triplets/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy | 10 | ||
|  |[A Very Big Sum](https://www.hackerrank.com/challenges/a-very-big-sum)| <ul><li>[Java](./Algorithms/Warmup/A%20Very%20Big%20Sum/Solution.java)</li> <li>[C#](./Algorithms/Warmup/A%20Very%20Big%20Sum/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 10 | ||
|  |[Diagonal Difference](https://www.hackerrank.com/challenges/diagonal-difference)| <ul><li>[Java](./Algorithms/Warmup/Diagonal%20Difference/Solution.java)</li><li>[C#](./Algorithms/Warmup/Diagonal%20Difference/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 10 | ||
|  |[Plus Minus](https://www.hackerrank.com/challenges/plus-minus)| <ul><li>[Java](./Algorithms/Warmup/Plus%20Minus/Solution.java)</li><li>[C#](./Algorithms/Warmup/Plus%20Minus/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 10 | ||
|  |[Staircase](https://www.hackerrank.com/challenges/staircase)| <ul><li>[Java](./Algorithms/Warmup/Staircase/Solution.java)</li><li>[C#](./Algorithms/Warmup/Staircase/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 10 | ||
|  |[Mini-Max Sum](https://www.hackerrank.com/challenges/mini-max-sum)| <ul><li>[Java](./Algorithms/Warmup/Mini-Max%20Sum/Solution.java)</li><li>[C#](./Algorithms/Warmup/Mini-Max%20Sum/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy | 10 | ||
|  |[Time Conversion](https://www.hackerrank.com/challenges/time-conversion)| <ul><li>[Java](./Algorithms/Warmup/Time%20Conversion/Solution.java)</li><li>[C#](./Algorithms/Warmup/Time%20Conversion/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy | 15 | ||
|  |[Birthday Cake Candles](https://www.hackerrank.com/challenges/birthday-cake-candles)| <ul><li>[Java](./Algorithms/Warmup/Birthday%20Cake%20Candles/Solution.java)</li><li>[C#](./Algorithms/Warmup/Birthday%20Cake%20Candles/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 10 | ||

### Implementation
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Grading Students](https://www.hackerrank.com/challenges/grading)| <ul><li>[Java](./Algorithms/Implementation/Grading%20Students/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Grading%20Students/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Grading%20Students/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy| 10| ||
|   | [Apple and Orange](https://www.hackerrank.com/challenges/apple-and-orange)| <ul><li>[Java](./Algorithms/Implementation/Apple%20and%20Orange/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Apple%20and%20Orange/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Apple%20and%20Orange/Solution.cs)</li><ul> | _O(n+m)_ | _O(1)_ | Easy| 10| ||
|   | [Kangaroo](https://www.hackerrank.com/challenges/kangaroo)| <ul><li>[Java](./Algorithms/Implementation/Kangaroo/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Kangaroo/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy| 10| ||
|   | [Between Two Sets](https://www.hackerrank.com/challenges/between-two-sets)| <ul><li>[Java](./Algorithms/Implementation/Between%20Two%20Sets/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Between%20Two%20Sets/Solution.cs)</li><ul> | _O(x(n+m))_ | _O(1)_ | Easy| 10|  _x=(max(m) - min(n))/min(n)_ ||
|   | [Divisible Sum Pairs](https://www.hackerrank.com/challenges/divisible-sum-pairs)| <ul><li>[Java](./Algorithms/Implementation/Divisible%20Sum%20Pairs/Solution.java)</li><li>[C#](./Algorithms/Implementation/Divisible%20Sum%20Pairs/Solution.cs)</li><ul> | _O(n^2)_ | _O(1)_ | Easy| 10| ||
|   | [Birthday Chocolate](https://www.hackerrank.com/challenges/the-birthday-bar)| <ul><li>[Java](./Algorithms/Implementation/Birthday%20Chocolate/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Birthday%20Chocolate/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy| 10| ||
|   | [Breaking the Records](https://www.hackerrank.com/challenges/breaking-best-and-worst-records)| <ul><li>[Java](./Algorithms/Implementation/Breaking%20the%20Records/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Breaking%20the%20Records/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy| 10| ||
|   | [Migratory Birds](https://www.hackerrank.com/challenges/migratory-birds)| <ul><li>[Java](./Algorithms/Implementation/Migratory%20Birds/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Migratory%20Birds/Solution.js)</li><li>[C#](./Algorithms/Implementation/Migratory%20Birds/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy| 10| ||
|   | [Day of the Programmer](https://www.hackerrank.com/challenges/day-of-the-programmer)| <ul><li>[Java](./Algorithms/Implementation/Day%20Of%20The%20Programmer/Solution.java)</li><li>[C#](./Algorithms/Implementation/Day%20Of%20The%20Programmer/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy| 15| ||
|   | [Bon Appetit](https://www.hackerrank.com/challenges/bon-appetit)| <ul><li>[Java](./Algorithms/Implementation/Bon%20Appetit/Solution.java)</li><li>[C#](./Algorithms/Implementation/Bon%20Appetit/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy| 10| ||
|   | [Sock Merchant](https://www.hackerrank.com/challenges/sock-merchant)| <ul><li>[Java](./Algorithms/Implementation/Sock%20Merchant/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Sock%20Merchant/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy| 10| ||
|   | [Drawing Book](https://www.hackerrank.com/challenges/drawing-book)| <ul><li>[Java](./Algorithms/Implementation/Drawing%20Book/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Drawing%20Book/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy| 10| ||
|   | [Counting Valleys](https://www.hackerrank.com/challenges/counting-valleys)| <ul><li>[Java](./Algorithms/Implementation/Counting%20Valleys/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Counting%20Valleys/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Counting%20Valleys/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy| 15| ||
|   | [Cats and a Mouse](https://www.hackerrank.com/challenges/cats-and-a-mouse)| <ul><li>[Java](./Algorithms/Implementation/Cats%20and%20a%20Mouse/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Cats%20and%20a%20Mouse/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy| 15| ||
|   | [Electronics Shop](https://www.hackerrank.com/challenges/electronics-shop)| <ul><li>[Java](./Algorithms/Implementation/Electronics%20Shop/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Electronics%20Shop/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Electronics%20Shop/Solution.cs)</li><ul> | _O(n log (n))_ | _O(1)_ | Easy| 15| n = m+n||	
|   | [Picking Numbers](https://www.hackerrank.com/challenges/picking-numbers)| <ul><li>[Java](./Algorithms/Implementation/Picking%20Numbers/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Picking%20Numbers/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy| 20| ||
|   | [Climbing the Leaderboard](https://www.hackerrank.com/challenges/climbing-the-leaderboard)| <ul><li>[Java](./Algorithms/Implementation/Climbing%20the%20Leaderboard/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Climbing%20the%20Leaderboard/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Climbing%20the%20Leaderboard/Solution.cs)</li><ul> | _O(n+m)_ | _(n)_ | Easy| 20| ||
|   | [The Hurdle Race](https://www.hackerrank.com/challenges/the-hurdle-race)| <ul><li>[Java](./Algorithms/Implementation/The%20Hurdle%20Race/Solution.java)</li> <li>[C#](./Algorithms/Implementation/The%20Hurdle%20Race/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy| 15| ||
|   | [Designer PDF Viewer](https://www.hackerrank.com/challenges/designer-pdf-viewer)| <ul><li>[Java](./Algorithms/Implementation/Designer%20PDF%20Viewer/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Designer%20PDF%20Viewer/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Designer%20PDF%20Viewer/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy| 20| ||
|   | [Forming a Magic Square](https://www.hackerrank.com/challenges/magic-square-forming)| <ul><li>[Java](./Algorithms/Implementation/Forming%20a%20Magic%20Square/Solution.java)</li><ul> | _O(1)_ | _O(1)_ | Easy| 20| ||
|   | [Utopian Tree](https://www.hackerrank.com/challenges/utopian-tree)| <ul><li>[Java](./Algorithms/Implementation/Utopian%20Tree/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Utopian%20Tree/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Utopian%20Tree/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Angry Professor](https://www.hackerrank.com/challenges/angry-professor)| <ul><li>[Java](./Algorithms/Implementation/Angry%20Professor/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Angry%20Professor/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Angry%20Professor/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Beautiful Days at the Movies](https://www.hackerrank.com/challenges/beautiful-days-at-the-movies)| <ul><li>[Java](./Algorithms/Implementation/Beautiful%20Days%20at%20the%20Movies/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Beautiful%20Days%20at%20the%20Movies/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Beautiful%20Days%20at%20the%20Movies/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 15| ||
|   | [Viral Advertising](https://www.hackerrank.com/challenges/strange-advertising)| <ul><li>[Java](./Algorithms/Implementation/Viral%20Advertising/Solution.java)</li> <li>[JS](./Algorithms/Implementation/Viral%20Advertising/Solution.js)</li> <li>[C#](./Algorithms/Implementation/Viral%20Advertising/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 15| ||
|   | [Save the Prisoner!](https://www.hackerrank.com/challenges/save-the-prisoner)| <ul><li>[Java](./Algorithms/Implementation/Save%20the%20Prisoner!/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Save%20the%20Prisoner!/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy | 15| ||
|   | [Circular Array Rotation](https://www.hackerrank.com/challenges/circular-array-rotation)| <ul><li>[Java](./Algorithms/Implementation/Circular%20Array%20Rotation/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Circular%20Array%20Rotation/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Sequence Equation](https://www.hackerrank.com/challenges/permutation-equation)| <ul><li>[Java](./Algorithms/Implementation/Sequence%20Equation/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Sequence%20Equation/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 20| ||
|   | [Jumping on the Clouds: Revisited](https://www.hackerrank.com/challenges/jumping-on-the-clouds-revisited)| <ul><li>[Java](./Algorithms/Implementation/Jumping%20on%20the%20Clouds-%20Revisited/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Jumping%20on%20the%20Clouds-%20Revisited/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 15| ||
|   | [Find Digits](https://www.hackerrank.com/challenges/find-digits)| <ul><li>[Java](./Algorithms/Implementation/Find%20Digits/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Find%20Digits/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 25| ||
|   | [Extra Long Factorials](https://www.hackerrank.com/challenges/extra-long-factorials)| <ul><li>[Java](./Algorithms/Implementation/Extra%20Long%20Factorials/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Extra%20Long%20Factorials/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Medium | 20| ||
|   | [Append and Delete](https://www.hackerrank.com/challenges/append-and-delete)| <ul><li>[Java](./Algorithms/Implementation/Append%20and%20Delete/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Sherlock and Squares](https://www.hackerrank.com/challenges/sherlock-and-squares)| <ul><li>[Java](./Algorithms/Implementation/Sherlock%20and%20Squares/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Library Fine](https://www.hackerrank.com/challenges/library-fine)| <ul><li>[Java](./Algorithms/Implementation/Library%20Fine/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Library%20Fine/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy| 15| ||
|   | [Cut the sticks](https://www.hackerrank.com/challenges/cut-the-sticks)| <ul><li>[Java](./Algorithms/Implementation/Cut%20the%20sticks/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Cut%20the%20sticks/Solution.cs)</li><ul> | _O(n log(n))_ | _O(n)_ | Easy | 25| ||
|   | [Non-Divisible Subset](https://www.hackerrank.com/challenges/non-divisible-subset)| <ul><li>[Java](./Algorithms/Implementation/Non-Divisible%20Subset/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Medium | 20| ||
|   | [Repeated String](https://www.hackerrank.com/challenges/repeated-string)| <ul><li>[Java](./Algorithms/Implementation/Repeated%20String/Solution.java)</li> <li>[C#](./Algorithms/Implementation/Repeated%20String/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 20| ||
|   | [Jumping on the Clouds](https://www.hackerrank.com/challenges/jumping-on-the-clouds)| <ul><li>[Java](./Algorithms/Implementation/Jumping%20on%20the%20Clouds/Solution.java)</li><li>[C#](./Algorithms/Implementation/Jumping%20on%20the%20Clouds/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 20| ||
|   | [Equalize the Array](https://www.hackerrank.com/challenges/equality-in-a-array)| <ul><li>[Java](./Algorithms/Implementation/Equalize%20the%20Array/Solution.java)</li><li>[C#](./Algorithms/Implementation/Equalize%20the%20Array/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 20| ||
|   | [Queen's Attack II](https://www.hackerrank.com/challenges/queens-attack-2)| <ul><li>[Java](./Algorithms/Implementation/Queen's%20Attack%20II/Solution.java)</li><ul> | _O(k)_ | _O(1)_ | Medium | 30| ||
|   | [ACM ICPC Team](https://www.hackerrank.com/challenges/acm-icpc-team)| <ul><li>[Java](./Algorithms/Implementation/ACM%20ICPC%20Team/Solution.java)</li><ul> | _O(n^3)_ | _O(n)_ | Easy | 25| ||
|   | [Taum and B'day](https://www.hackerrank.com/challenges/taum-and-bday)| <ul><li>[Java](./Algorithms/Implementation/Taum%20and%20B'day/Solution.java)</li><li>[C#](./Algorithms/Implementation/Taum%20and%20B'day/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Easy | 25| ||
|   | [Organizing Containers of Balls](https://www.hackerrank.com/challenges/organizing-containers-of-balls)| <ul><li>[Java](./Algorithms/Implementation/Organizing%20Containers%20of%20Balls/Solution.java)</li><ul> | _O(n^2)_ | _O(n^2)_ | Medium | 30| ||
|   | [Encryption](https://www.hackerrank.com/challenges/encryption)| <ul><li>[Java](./Algorithms/Implementation/Encryption/Solution.java)</li><li>[C#](./Algorithms/Implementation/Encryption/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Medium | 30| ||
|   | [Bigger is Greater](https://www.hackerrank.com/challenges/bigger-is-greater)| <ul><li>[Java](./Algorithms/Implementation/Bigger%20is%20Greater/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Medium | 35| ||
|   | [Modified Kaprekar Numbers](https://www.hackerrank.com/challenges/kaprekar-numbers)| <ul><li>[Java](./Algorithms/Implementation/Modified%20Kaprekar%20Numbers/Solution.java)</li><li>[C#](./Algorithms/Implementation/Modified%20Kaprekar%20Numbers/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 30| ||
|   | [Minimum Distances](https://www.hackerrank.com/challenges/minimum-distances)| <ul><li>[Java](./Algorithms/Implementation/Minimum%20Distances/Solution.java)</li><li>[C#](./Algorithms/Implementation/Minimum%20Distances/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 20| ||
|   | [Beautiful Triplets](https://www.hackerrank.com/challenges/beautiful-triplets)| <ul><li>[Java](./Algorithms/Implementation/Beautiful%20Triplets/Solution.java)</li><li>[C#](./Algorithms/Implementation/Beautiful%20Triplets/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 20| ||
|   | [Strings: Making Anagrams](https://www.hackerrank.com/challenges/ctci-making-anagrams)| <ul><li>[Java](./Algorithms/Implementation/Strings%20Making%20Anagrams/Solution.java)</li><ul> | _O(&#124;a&#124;+&#124;b&#124;)_ | _O(1)_ | Easy | 30| ||
|   | [The Time in Words](https://www.hackerrank.com/challenges/the-time-in-words)| <ul><li>[Java](./Algorithms/Implementation/The%20Time%20in%20Words/Solution.java)</li><li>[C#](./Algorithms/Implementation/The%20Time%20in%20Words/Solution.cs)</li><ul> | _O(1)_ | _O(1)_ | Medium | 25| ||
|   | [Chocolate Feast](https://www.hackerrank.com/challenges/chocolate-feast)| <ul><li>[Java](./Algorithms/Implementation/Chocolate%20Feast/Solution.java)</li><li>[C#](./Algorithms/Implementation/Chocolate%20Feast/Solution.cs)</li><ul> | _O(log(n))_ | _O(1)_ | Easy | 25| Base of logarithmic time complexity is m ||
|   | [Service Lane](https://www.hackerrank.com/challenges/service-lane)| <ul><li>[Java](./Algorithms/Implementation/Service%20Lane/Solution.java)</li><li>[C#](./Algorithms/Implementation/Service%20Lane/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 20| ||
|   | [Lisa's Workbook](https://www.hackerrank.com/challenges/lisa-workbook)| <ul><li>[Java](./Algorithms/Implementation/Lisa's%20Workbook/Solution.java)</li><li>[C#](./Algorithms/Implementation/Lisa's%20Workbook/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 25| ||
|   | [Flatland Space Stations](https://www.hackerrank.com/challenges/flatland-space-stations)| <ul><li>[Java](./Algorithms/Implementation/Flatland%20Space%20Stations/Solution.java)</li><li>[C#](./Algorithms/Implementation/Flatland%20Space%20Stations/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 25| ||
|   | [Fair Rations](https://www.hackerrank.com/challenges/fair-rations)| <ul><li>[Java](./Algorithms/Implementation/Fair%20Rations/Solution.java)</li><li>[C#](./Algorithms/Implementation/Fair%20Rations/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 25| ||
|   | [Cavity Map](https://www.hackerrank.com/challenges/cavity-map)| <ul><li>[Java](./Algorithms/Implementation/Cavity%20Map/Solution.java)</li><li>[C#](./Algorithms/Implementation/Cavity%20Map/Solution.cs)</li><ul> | _O(n^2)_ | _O(n^2)_ | Easy | 30| ||
|   | [Manasa and Stones](https://www.hackerrank.com/challenges/manasa-and-stones)| <ul><li>[Java](./Algorithms/Implementation/Manasa%20and%20Stones/Solution.java)</li><li>[C#](./Algorithms/Implementation/Manasa%20and%20Stones/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 30| ||
|   | [The Grid Search](https://www.hackerrank.com/challenges/the-grid-search)| <ul><li>[Java](./Algorithms/Implementation/The%20Grid%20Search/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Medium | 30| n = len(word)||
|   | [Happy Ladybugs](https://www.hackerrank.com/challenges/happy-ladybugs)| <ul><li>[Java](./Algorithms/Implementation/Happy%20Ladybugs/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Easy | 30| ||
|   | [Strange Counter](https://www.hackerrank.com/challenges/strange-code)| <ul><li>[Java](./Algorithms/Implementation/Strange%20Counter/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 30| n = t ||
|   | [Absolute Permuation](https://www.hackerrank.com/challenges/absolute-permutation)| <ul><li>[Java](./Algorithms/Implementation/Absolute%20Permuation/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Medium | 40| ||
|   | [The Bomberman Game](https://www.hackerrank.com/challenges/bomber-man)| <ul><li>[Java](./Algorithms/Implementation/The%20Bomberman%20Game/Solution.java)</li><ul> | _O(n*m)_ | _O(n*m)_ | Medium | 40| ||
|   | [Ema's Supercomputer](https://www.hackerrank.com/challenges/two-pluses)| <ul><li>Java</li></ul> |  | | Medium | 40| ||
|   | [Larry's Array](https://www.hackerrank.com/challenges/larrys-array)| <ul><li>Java</li></ul> |  | | Medium | 40| ||
|   | [Almost Sorted](https://www.hackerrank.com/challenges/almost-sorted)| <ul><li>Java</li></ul> |  | | Medium | 50| ||
|   | [Matrix Layer Rotation](https://www.hackerrank.com/challenges/matrix-rotation-algo)| <ul><li>[Python3](./Algorithms/Implementation/Matrix%20Layer%20Rotation/Solution.py3)</li><ul> | _O(n*m)_ | _O(n*m)_ | Hard | 80| ||
|   | [Consecutive 1s in Binary Numbers](https://www.hackerrank.com/challenges/linkedin-practice-binary-numbers)| <ul><li>[Java](./Algorithms/Implementation/Consecutive%201s%20in%20Binary%20Numbers/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 30| ||
|   | [Nested Logic](https://www.hackerrank.com/challenges/linkedin-practice-nested-logic)| <ul><li>[Java](./Algorithms/Implementation/Nested%20Logic/Solution.java)</li><ul> | _O(1)_ | _O(1)_ | Easy | 40| ||
|   | [Bitwise AND](https://www.hackerrank.com/challenges/linkedin-practice-bitwise-and)| <ul><li>[Java](./Algorithms/Implementation/Bitwise%20AND/Solution.java)</li><ul> | _O(1)_ | _O(1)_ | Easy | 20| ||

### Strings
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Super Reduced String](https://www.hackerrank.com/challenges/reduced-string)| <ul><li>[Java](./Algorithms/Strings/Super%20Reduced%20String/Solution.java)</li><li>[C#](./Algorithms/Strings/Super%20Reduced%20String/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 10| ||
|   | [camelCase](https://www.hackerrank.com/challenges/camelcase)| <ul><li>[Java](./Algorithms/Strings/camelCase/Solution.java)</li><li>[C#](./Algorithms/Strings/camelCase/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 15| ||
|   | [Strong Password](https://www.hackerrank.com/challenges/strong-password)| <ul><li>[C#](./Algorithms/Strings/Strong%20Password/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 15| ||
|   | [Two Characters](https://www.hackerrank.com/challenges/two-characters)| <ul><li>[Java](./Algorithms/Strings/Two%20Characters/Solution.java)</li><li>[C#](./Algorithms/Strings/Two%20Characters/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy| 15| ||
|   | [Caesar Cipher](https://www.hackerrank.com/challenges/caesar-cipher-1)| <ul><li>[Java](./Algorithms/Strings/Caesar%20Cipher/Solution.java)</li><li>[C#](./Algorithms/Strings/Caesar%20Cipher/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 15| ||
|   | [Caesar Cipher: Encryption](https://www.hackerrank.com/challenges/linkedin-practice-caesar-cipher)| <ul><li>[Java](./Algorithms/Strings/Caesar%20Cipher%20Encryption/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Easy | 40 | ||
|   | [Mars Exploration](https://www.hackerrank.com/challenges/mars-exploration)| <ul><li>[Java](./Algorithms/Strings/Mars%20Exploration/Solution.java)</li><li>[C#](./Algorithms/Strings/Mars%20Exploration/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 15| ||
|   | [HackerRank in a String!](https://www.hackerrank.com/challenges/hackerrank-in-a-string)| <ul><li>[Java](./Algorithms/Strings/HackerRank%20in%20a20String!/Solution.java)</li> <li>[JS](./Algorithms/Strings/HackerRank%20in%20a20String!/Solution.js)</li><li>[C#](./Algorithms/Strings/HackerRank%20in%20a20String!/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Pangrams](https://www.hackerrank.com/challenges/pangrams)| <ul><li>[Java](./Algorithms/Strings/Pangrams/Solution.java)</li><li>[C#](./Algorithms/Strings/Pangrams/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Weighted Uniform Strings](https://www.hackerrank.com/challenges/weighted-uniform-string)| <ul><li>[Java](./Algorithms/Strings/Weighted%20Uniform%20Strings/Solution.java)</li><li>[C#](./Algorithms/Strings/Weighted%20Uniform%20Strings/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 20| ||
|   | [Separate the Numbers](https://www.hackerrank.com/challenges/separate-the-numbers)| <ul><li>Java</li><li>[C#](./Algorithms/Strings/Separate%20the%20Numbers/Solution.cs)</li></ul> |  _O(n)_ | _O(n)_ | Easy | 20| ||
|   | [Funny String](https://www.hackerrank.com/challenges/funny-string)| <ul><li>[Java](./Algorithms/Strings/Funny%20String/Solution.java)</li><li>[C#](./Algorithms/Strings/Funny%20String/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 25| ||
|   | [Gemstones](https://www.hackerrank.com/challenges/gem-stones)| <ul><li>[Java](./Algorithms/Strings/Gemstones/Solution.java)</li><li>[C#](./Algorithms/Strings/Gemstones/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Alternating Characters](https://www.hackerrank.com/challenges/alternating-characters)| <ul><li>[Java](./Algorithms/Strings/Alternating%20Characters/Solution.java)</li><li>[C#](./Algorithms/Strings/Alternating%20Characters/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Beautiful Binary String](https://www.hackerrank.com/challenges/beautiful-binary-string)| <ul><li>[Java](./Algorithms/Strings/Beautiful%20Binary%20String/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [The Love-Letter Mystery](https://www.hackerrank.com/challenges/the-love-letter-mystery)| <ul><li>[Java](./Algorithms/Strings/The%20Love-Letter%20Mystery/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20| ||
|   | [Determining DNA Health](https://www.hackerrank.com/challenges/determining-dna-health)| <ul><li>Java</li></ul> |  | | Hard | 50| ||
|   | [Palindrome Index](https://www.hackerrank.com/challenges/palindrome-index)| <ul><li>[Java](./Algorithms/Strings/Palindrome%20Index/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 25| ||
|   | [Anagram](https://www.hackerrank.com/challenges/anagram)| <ul><li>[Java](./Algorithms/Strings/Anagram/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 25| ||
|   | [Making Anagrams](https://www.hackerrank.com/challenges/making-anagrams)| <ul><li>[Java](./Algorithms/Strings/Making%20Anagrams/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Easy | 30| ||
|   | [Game of Thrones - I](https://www.hackerrank.com/challenges/game-of-thrones)| <ul><li>[Java](./Algorithms/Strings/Game%20of%20Thrones-I/Solution.java)</li><li>[C#](./Algorithms/Strings/Game%20of%20Thrones-I/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 30| ||
|   | [Two Strings](https://www.hackerrank.com/challenges/two-strings)| <ul><li>[Java](./Algorithms/Strings/Two%20Strings/Solution.java)</li><li>[C#](./Algorithms/Strings/Two%20Strings/Solution.cs)</li><ul> | _O(&#124;a&#124; + &#124;b&#124;)_ | _O(1)_ | Easy | 25| a and b are lengths of the input strings ||
|   | [String Construction](https://www.hackerrank.com/challenges/string-construction)| <ul><li>[Java](./Algorithms/Strings/String%20Construction/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Easy | 25| ||
|   | [Sherlock and Valid String](https://www.hackerrank.com/challenges/sherlock-and-valid-string)| <ul><li>[Java](./Algorithms/Strings/Sherlock%20and%20Valid%20String/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Hard | 100| ||
|   | [Richie Rich](https://www.hackerrank.com/challenges/richie-rich)| <ul><li>Java</li> <li>[Python3](./Algorithms/Strings/Richie%20Rich/solution.py)</li><ul> | _O(n)_  | _O(n)_ | Medium | 30| ||
|   | [Sherlock and Anagrams](https://www.hackerrank.com/challenges/sherlock-and-anagrams)| <ul><li>Java</li></ul> |  | | Medium | 50| ||
|   | [Common Child](https://www.hackerrank.com/challenges/common-child)| <ul><li>Java</li></ul> |  | | Hard | 60| ||
|   | [Bear and Steady Gene](https://www.hackerrank.com/challenges/bear-and-steady-gene)| <ul><li>Java</li></ul> |  | | Medium | 50| ||
|   | [Morgan and a String](https://www.hackerrank.com/challenges/morgan-and-a-string)| <ul><li>[Java](./Algorithms/Strings/Morgan%20and%20a%20String/Solution.java)</li><ul> | _O((&#124;a&#124;+&#124;b&#124;)^2)_ | _O(&#124;a&#124; + &#124;b&#124;)_ | Expert | 100| ||
|   | [Count Strings](https://www.hackerrank.com/challenges/count-strings)| <ul><li>Java</li></ul> |  | | Hard | 80| ||
|   | [String Function Calculation](https://www.hackerrank.com/challenges/string-function-calculation)| <ul><li>Java</li></ul> |  | | Advanced | 80| ||
|   | [Build a Palindrome](https://www.hackerrank.com/challenges/challenging-palindromes)| <ul><li>Java</li></ul> |  | | Advanced | 80| ||
|   | [Build a String](https://www.hackerrank.com/challenges/build-a-string)| <ul><li>Java</li></ul> |  | | Hard | 80| ||
|   | [Gridland Provinces](https://www.hackerrank.com/challenges/gridland-provinces)| <ul><li>Java</li></ul> |  | | Hard | 80| ||
|   | [Ashton and String](https://www.hackerrank.com/challenges/ashton-and-string)| <ul><li>Java</li></ul> |  | | Advanced | 100| ||
|   | [String Similarity](https://www.hackerrank.com/challenges/string-similarity)| <ul><li>Java</li></ul> |  | | Expert | 100| ||
|   | [Super Functional Strings](https://www.hackerrank.com/challenges/super-functional-strings)| <ul><li>Java</li></ul> |  | | Advanced | 80| ||
|   | [Circular Palindromes](https://www.hackerrank.com/challenges/circular-palindromes)| <ul><li>Java</li></ul> |  | | Advanced | 120| ||
|   | [Similar Strings](https://www.hackerrank.com/challenges/similar-strings)| <ul><li>Java</li></ul> |  | | Advanced | 85| ||
|   | [Save Humanity](https://www.hackerrank.com/challenges/save-humanity)| <ul><li>Java</li></ul> |  | | Expert | 100| ||
|   | [Find Strings](https://www.hackerrank.com/challenges/find-strings)| <ul><li>Java</li></ul> |  | | Expert | 100| ||
|   | [Palindromic Border](https://www.hackerrank.com/challenges/palindromic-border)| <ul><li>Java</li></ul> |  | | Expert | 100| ||
|   | [Two Two](https://www.hackerrank.com/challenges/two-two)| <ul><li>Java</li></ul> |  | | Advanced | 150| ||
|   | [Two Strings Game](https://www.hackerrank.com/challenges/two-strings-game)| <ul><li>Java</li></ul> |  | | Expert | 100| ||
|   | [Letter Islands](https://www.hackerrank.com/challenges/letter-islands)| <ul><li>Java</li></ul> |  | | Expert | 100| ||
|   | [Pseudo-Isomorphic Substrings](https://www.hackerrank.com/challenges/pseudo-isomorphic-substrings)| <ul><li>Java</li></ul> |  | | Expert | 100| ||
|   | [How Many Substrings?](https://www.hackerrank.com/challenges/how-many-substrings)| <ul><li>Java</li></ul> |  | | Expert | 100| ||


### Sorting
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Intro to Tutorial Challenges](https://www.hackerrank.com/challenges/tutorial-intro)| <ul><li>[Java](./Algorithms/Sorting/Intro%20to%20Tutorial%20Challenges/Solution.java)</li><li>[C#](./Algorithms/Sorting/Intro%20to%20Tutorial%20Challenges/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 30| ||
|   | [Insertion Sort - Part 1](https://www.hackerrank.com/challenges/insertionsort1)| <ul><li>[Java](./Algorithms/Sorting/Insertion%20Sort%20-%20Part%201/Solution.java)</li><li>[C#](./Algorithms/Sorting/Insertion%20Sort%20-%20Part%201/Solution.cs)</li><ul> | _O(n)_ | _O(1)_ | Easy | 30 | ||
|   | [Insertion Sort - Part 2](https://www.hackerrank.com/challenges/insertionsort2)| <ul><li>[Java](./Algorithms/Sorting/Insertion%20Sort%20-%20Part%202/Solution.java)</li><li>[C#](./Algorithms/Sorting/Insertion%20Sort%20-%20Part%202/Solution.cs)</li><ul> | _O(n^2)_ | _O(1)_ | Easy | 30 | ||
|   | [Correctness and the Loop Invariant](https://www.hackerrank.com/challenges/correctness-invariant)| <ul><li>[Java](./Algorithms/Sorting/Correctness%20and%20the%20Loop%20Invariant/Solution.java)</li><li>[C#](./Algorithms/Sorting/Correctness%20and%20the%20Loop%20Invariant/Solution.cs)</li><ul> | _O(n^2)_ | _O(1)_ | Easy | 30 | ||
|   | [Running Time of Algorithms](https://www.hackerrank.com/challenges/runningtime)| <ul><li>[Java](./Algorithms/Sorting/Running%20Time%20of%20Algorithms/Solution.java)</li><li>[C#](./Algorithms/Sorting/Running%20Time%20of%20Algorithms/Solution.cs)</li><ul> | _O(n^2)_ | _O(1)_ | Easy | 30 | ||
|   | [Quicksort 1 - Partition](https://www.hackerrank.com/challenges/quicksort1)| <ul><li>[Java](./Algorithms/Sorting/Quicksort%201%20-%20Partition/Solution.java)</li><li>[C#](./Algorithms/Sorting/Quicksort%201%20-%20Partition/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 10| ||
|   | [Quicksort 2 - Sorting](https://www.hackerrank.com/challenges/quicksort2)| <ul><li>[Java](./Algorithms/Sorting/Quicksort%202%20-%20Sorting/Solution.java)</li><li>[C#](./Algorithms/Sorting/Quicksort%202%20-%20Sorting/Solution.cs)</li><ul> | _O(n^2)_ | _O(n)_ | Easy | 30| ||
|   | [Quicksort In-Place](https://www.hackerrank.com/challenges/quicksort3)| <ul><li>[Java](./Algorithms/Sorting/Quicksort%20In-Place/Solution.java)</li><ul> | _O(n^2)_ | _O(log(n))_ | Medium| 35| ||
|   | [Running Time of Quicksort](https://www.hackerrank.com/challenges/quicksort4)| <ul><li>[Java](./Algorithms/Sorting/Running%20Time%20of%20Quicksort/Solution.java)</li><ul> | _O(n log(n))_ | _O(log(n))_ | Easy | 35| ||
|   | [Counting Sort 1](https://www.hackerrank.com/challenges/countingsort1)| <ul><li>[Java](./Algorithms/Sorting/Counting%20Sort%201/Solution.java)</li><li>[C#](./Algorithms/Sorting/Counting%20Sort%201/Solution.cs)</li><ul> | _O(n+k)_ | _O(k)_ | Easy | 30| value of k in this problem is 100  ||
|   | [Counting Sort 2](https://www.hackerrank.com/challenges/countingsort2)| <ul><li>[Java](./Algorithms/Sorting/Counting%20Sort%202/Solution.java)</li><li>[C#](./Algorithms/Sorting/Counting%20Sort%202/Solution.cs)</li><ul> | _O(n+k)_ | _O(n+k)_ | Easy | 30| Value of k is 100 in this problem. ||
|   | [Counting Sort 3](https://www.hackerrank.com/challenges/countingsort3)| <ul><li>[Java](./Algorithms/Sorting/Counting%20Sort%203/Solution.java)</li><ul> | _O(n+k)_ | _O(k)_ | Easy | 30| ||
|   | [The Full Counting Sort](https://www.hackerrank.com/challenges/countingsort4)| <ul><li>[Java](./Algorithms/Sorting/The%20Full%20Counting%20Sort/Solution.java)</li><li>[C#](./Algorithms/Sorting/The%20Full%20Counting%20Sort/Solution.cs)</li><ul> | _O(n+k)_ | _O(n+k)_ | Medium | 40| ||
|   | [Closest Numbers](https://www.hackerrank.com/challenges/closest-numbers)| <ul><li>[Java](./Algorithms/Sorting/Closest%20Numbers/Solution.java)</li><li>[C#](./Algorithms/Sorting/Closest%20Numbers/Solution.cs)</li><ul> | _O(n log(n))_ | _O(n)_ | Easy | 35| ||
|   | [Find the Median](https://www.hackerrank.com/challenges/find-the-median)| <ul><li>[Java](./Algorithms/Sorting/Find%20the%20Median/Solution.java)</li><li>[C#](./Algorithms/Sorting/Find%20the%20Median/Solution.cs)</li><ul> | _O(n log(n))_ | _O(n)_ | Easy | 35| ||
|   | [Insertion Sort Advanced Analysis](https://www.hackerrank.com/challenges/insertion-sort)| <ul><li>Java</li></ul> |  | | Advanced | 50| ||
|   | [Fraudulent Activity Notifications](https://www.hackerrank.com/challenges/fraudulent-activity-notifications)| <ul><li>[Java](./Algorithms/Sorting/Fraudulent%20Activity%20Notifications/Solution.java)</li><ul> | _O(n^2)_ | _O(n)_ | Medium | 40| ||
|   | [Lily's Homework](https://www.hackerrank.com/challenges/lilys-homework)| <ul><li>[Java](./Algorithms/Sorting/Lily's%20Homework/Solution.java)</li><ul> | _O(n log(n))_ | _O(n)_  | Medium | 40| ||
|   | [Big Sorting](https://www.hackerrank.com/challenges/big-sorting)| <ul><li>[Java](./Algorithms/Sorting/Big%20Sorting/Solution.java)</li><li>[C#](./Algorithms/Sorting/Big%20Sorting/Solution.cs)</li><ul> | _O(n log(n))_ | _O(n)_ | Easy | 20| ||

### Search
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Hackerland Radio Transmitters](https://www.hackerrank.com/challenges/hackerland-radio-transmitters)| <ul><li>[JS](./Algorithms/Search/Hackerland%20Radio%20Transmitters/Solution.js)</li><li>[C#](./Algorithms/Search/Hackerland%20Radio%20Transmitters/Solution.cs)</li><ul> | _O(n log(n))_ | _O(n)_ | Medium | 25 | ||
|   | [Ice Cream Parlor](https://www.hackerrank.com/challenges/icecream-parlor)| <ul><li>[Java](./Algorithms/Search/Ice%20Cream%20Parlor/Solution.java)</li><li>[C#](./Algorithms/Search/Ice%20Cream%20Parlor/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 30 | ||
|   | [Binary Search: Ice Cream Parlor](https://www.hackerrank.com/challenges/ctci-ice-cream-parlor)| <ul><li>[Java](./Algorithms/Search/Binary%20Search%20Ice%20Cream%20Parlor/Solution.java)</li><ul> | _O(n)_ | _O(n)_ | Easy | 35 | ||
|   | [Gridland Metro](https://www.hackerrank.com/challenges/gridland-metro)| <ul><li>Java</li><li>[C#](./Algorithms/Search/Gridland%20Metro/Solution.cs)</li></ul> |  _O(k)_ | _O(k)_ | Medium | 25 | k = number of tracks ||
|   | [Missing Numbers](https://www.hackerrank.com/challenges/missing-numbers)| <ul><li>Java</li> <li>[C++](./Algorithms/Search/Missing%20Numbers/Solution.cpp)</li><li>[C#](./Algorithms/Search/Missing%20Numbers/Solution.cs)</li><ul> | _O(n)_ | _O(n)_ | Easy | 45 | ||
|   | [Minimum Loss](https://www.hackerrank.com/challenges/minimum-loss)| <ul><li>[Java](./Algorithms/Search/Minimum%20Loss/Solution.java)</li><ul> | _O(n log(n))_ | _O(n)_ | Medium | 35| ||
|   | [KnightL on a Chessboard](https://www.hackerrank.com/challenges/knightl-on-chessboard)| <ul><li>Java</li></ul> |  | | Medium | 35 | ||
|   | [Pairs](https://www.hackerrank.com/challenges/pairs)| <ul><li>Java</li> <li>[C++](./Algorithms/Search/Pairs/Solution.cpp)</li><li>[C#](./Algorithms/Search/Pairs/Solution.cs)</li><ul> | _O(n log(n))_ | _O(n)_ | Medium | 50 | ||
|   | [Sherlock and Array](https://www.hackerrank.com/challenges/sherlock-and-array)| <ul><li>Java</li> <li>[C++](./Algorithms/Search/SherlockandArray/Solution.cpp)</li><li>[C#](./Algorithms/Search/SherlockandArray/Solution.cs)</li><ul> | _O(n)_ | _O(n)_| Easy | 40 | ||
|   | [Maximum Subarray Sum](https://www.hackerrank.com/challenges/maximum-subarray-sum)| <ul><li>Java</li></ul> |  | | Hard | 65 | ||
|   | [Connected Cells in a grid](https://www.hackerrank.com/challenges/connected-cell-in-a-grid)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Short Palindrome](https://www.hackerrank.com/challenges/short-palindrome)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Maximizing Mission Points](https://www.hackerrank.com/challenges/maximizing-mission-points)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Count Luck](https://www.hackerrank.com/challenges/count-luck)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Cut the Tree](https://www.hackerrank.com/challenges/cut-the-tree)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Making Candies](https://www.hackerrank.com/challenges/making-candies)| <ul><li>Java</li></ul> |  | | Hard | 45 | ||
|   | [Gena Playing Hanoi](https://www.hackerrank.com/challenges/gena)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Beautiful Quadruples](https://www.hackerrank.com/challenges/xor-quadruples)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Bike Racers](https://www.hackerrank.com/challenges/bike-racers)| <ul><li>Java</li></ul> |  | | Hard | 65 | ||
|   | [Task Scheduling](https://www.hackerrank.com/challenges/task-scheduling)| <ul><li>Java</li></ul> |  | | Advanced | 70 | ||
|   | [Similar Pair](https://www.hackerrank.com/challenges/similarpair)| <ul><li>Java</li></ul> |  | | Advanced | 70 | ||
|   | [Absolute Element Sums](https://www.hackerrank.com/challenges/playing-with-numbers)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Sorted Subsegments](https://www.hackerrank.com/challenges/sorted-subsegments)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Distant Pairs](https://www.hackerrank.com/challenges/distant-pairs)| <ul><li>Java</li></ul> |  | | Expert | 80 | ||
|   | [King Richard's Knights](https://www.hackerrank.com/challenges/king-richards-knights)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||

### Graph Theory
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Roads and Libraries](https://www.hackerrank.com/challenges/torque-and-development)| <ul><li>Java</li></ul> |  | | Medium | 30| ||
|   | [Synchronous Shopping](https://www.hackerrank.com/challenges/synchronous-shopping)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Crab Graphs](https://www.hackerrank.com/challenges/crab-graphs)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Even Tree](https://www.hackerrank.com/challenges/even-tree)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Snakes and Ladders: The Quickest Way Up](https://www.hackerrank.com/challenges/the-quickest-way-up)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Subset Component](https://www.hackerrank.com/challenges/subset-component)| <ul><li>Java</li></ul> |  | | Hard | 50 | ||
|  |[Journey to the Moon](https://www.hackerrank.com/challenges/journey-to-the-moon)| <ul><li>[Java](./Algorithms/Graph%20Theory/Journey%20to%20the%20Moon/Solution.java)</li> <li>[Python3](./Algorithms/Graph%20Theory/Journey%20to%20the%20Moon/solution.py3)</li><ul> | _O(n + i)_ | _O(n)_| Medium | 50 | ||
|   | [Kruskal (MST): Really Special Subtree](https://www.hackerrank.com/challenges/kruskalmstrsub)| <ul><li>Java</li></ul> |  | | Hard | 50 | ||
|   | [Minimum Penalty Path](https://www.hackerrank.com/challenges/beautiful-path)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Demanding Money](https://www.hackerrank.com/challenges/borrowing-money)| <ul><li>Java</li></ul> |  | | Hard | 50 | ||
|   | [The Story of a Tree](https://www.hackerrank.com/challenges/the-story-of-a-tree)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Breadth First Search: Shortest Reach](https://www.hackerrank.com/challenges/bfsshortreach)| <ul><li>Java</li></ul> |  | | Medium | 55 | ||
|   | [The Value of Friendship](https://www.hackerrank.com/challenges/value-of-friendship)| <ul><li>Java</li></ul> |  | | Hard | 55 | ||
|   | [Clique](https://www.hackerrank.com/challenges/clique)| <ul><li>Java</li></ul> |  | | Medium | 60 | ||
|   | [Dijkstra: Shortest Reach 2](https://www.hackerrank.com/challenges/dijkstrashortreach)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Prim's (MST) : Special Subtree](https://www.hackerrank.com/challenges/primsmstsub)| <ul><li>Java</li></ul> |  | | Medium | 60 | ||
|   | [Roads in Hackerland](https://www.hackerrank.com/challenges/johnland)| <ul><li>Java</li></ul> |  | | Medium | 60 | ||
|   | [Toll Cost Digits](https://www.hackerrank.com/challenges/toll-cost-digits)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Real Estate Broker](https://www.hackerrank.com/challenges/real-estate-broker)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Matrix](https://www.hackerrank.com/challenges/matrix)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Bead Ornaments](https://www.hackerrank.com/challenges/beadornaments)| <ul><li>Java</li></ul> |  | | Advanced | 70 | ||
|   | [Rust & Murderer](https://www.hackerrank.com/challenges/mark-and-toys)| <ul><li>[Java](./Algorithms/Graph%20Theory/Rust%20&%20Murderer/Solution.java)</li><ul> | _O(n+m)_ | _O(n)_| Medium | 70 | ||
|   | [Recording Episodes](https://www.hackerrank.com/challenges/episode-recording)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Kingdom Connectivity](https://www.hackerrank.com/challenges/kingdom-connectivity)| <ul><li>Java</li></ul> |  | | Hard | 75 | ||
|   | [Journey Scheduling](https://www.hackerrank.com/challenges/journey-scheduling)| <ul><li>Java</li></ul> |  | | Hard | 75 | ||
|   | [Floyd : City of Blinding Lights](https://www.hackerrank.com/challenges/floyd-city-of-blinding-lights)| <ul><li>Java</li></ul> |  | | Hard | 75 | ||
|   | [Find the Path](https://www.hackerrank.com/challenges/shortest-path)| <ul><li>Java</li></ul> |  | | Hard | 75 | ||
|   | [Repair Roads](https://www.hackerrank.com/challenges/repair-roads)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Problem solving](https://www.hackerrank.com/challenges/problem-solving)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Computer Game](https://www.hackerrank.com/challenges/computer-game)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Jack goes to Rapture](https://www.hackerrank.com/challenges/jack-goes-to-rapture)| <ul><li>Java</li></ul> |  | | Medium | 80 | ||
|   | [Jim and his LAN Party](https://www.hackerrank.com/challenges/jim-and-his-lan-party)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Jeanie's Route](https://www.hackerrank.com/challenges/jeanies-route)| <ul><li>Java</li></ul> |  | | Medium | 80 | ||
|   | [Travel in HackerLand](https://www.hackerrank.com/challenges/travel-in-hackerland)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Jogging Cats](https://www.hackerrank.com/challenges/cat-jogging)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||
|   | [Tree Flow](https://www.hackerrank.com/challenges/tree-flow)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Tripartite Matching](https://www.hackerrank.com/challenges/tripartite-matching)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Jumping Rooks](https://www.hackerrank.com/challenges/jumping-rooks)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||
|   | [Minimum MST Graph](https://www.hackerrank.com/challenges/minimum-mst-graph)| <ul><li>Java</li></ul> |  | | Expert | 80 | ||
|   | [Coprime Paths](https://www.hackerrank.com/challenges/coprime-paths)| <ul><li>Java</li></ul> |  | | Expert | 80 | ||
|   | [DAG Queries](https://www.hackerrank.com/challenges/dag-queries)| <ul><li>Java</li></ul> |  | | Expert | 80 | ||
|   | [Liars](https://www.hackerrank.com/challenges/liars)| <ul><li>Java</li></ul> |  | | Advanced | 85 | ||
|   | [ByteLandianTours](https://www.hackerrank.com/challenges/bytelandian-tours)| <ul><li>Java</li></ul> |  | | Hard | 90 | ||
|   | [Kth Ancestor](https://www.hackerrank.com/challenges/kth-ancestor)| <ul><li>Java</li></ul> |  | | Hard | 90 | ||
|   | [Drive](https://www.hackerrank.com/challenges/drive)| <ul><li>Java</li></ul> |  | | Expert | 90 | ||
|   | [Road Network](https://www.hackerrank.com/challenges/road-network)| <ul><li>Java</li></ul> |  | | Expert | 90 | ||
|   | [Savita And Friends](https://www.hackerrank.com/challenges/savita-and-friends)| <ul><li>Java</li></ul> |  | | Hard | 90 | ||
|   | [Favorite sequence](https://www.hackerrank.com/challenges/favourite-sequence)| <ul><li>Java</li></ul> |  | | Advanced | 95 | ||
|   | [Quadrant Queries](https://www.hackerrank.com/challenges/quadrant-queries)| <ul><li>Java</li></ul> |  | | Advanced | 100 | ||
|   | [Going to the Office](https://www.hackerrank.com/challenges/going-office)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Ticket](https://www.hackerrank.com/challenges/ticket)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [HackerX](https://www.hackerrank.com/challenges/missile-defend)| <ul><li>Java</li></ul> |  | | Hard | 100 | ||
|   | [Hacker Country](https://www.hackerrank.com/challenges/hacker-country)| <ul><li>Java</li></ul> |  | | Hard | 100 | ||
|   | [Travelling Salesman in a Grid](https://www.hackerrank.com/challenges/tsp-grid)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Huarongdao](https://www.hackerrank.com/challenges/huarongdao)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Vertical Paths](https://www.hackerrank.com/challenges/vertical-paths)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [DFS Edges](https://www.hackerrank.com/challenges/dfs-edges)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Tree Splitting](https://www.hackerrank.com/challenges/tree-splitting)| <ul><li>Java</li></ul> |  | | Advanced | 100 | ||
|   | [Definite Random Walks](https://www.hackerrank.com/challenges/definite-random-walks)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Diameter Minimization](https://www.hackerrank.com/challenges/diameter-minimization)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Training the army](https://www.hackerrank.com/challenges/training-the-army)| <ul><li>Java</li></ul> |  | | Hard | 120 | ||
|   | [Alex vs Fedor](https://www.hackerrank.com/challenges/alex-vs-fedor)| <ul><li>Java</li></ul> |  | | Expert | 150 | ||

### Greedy
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Minimum Absolute Difference in an Array](https://www.hackerrank.com/challenges/minimum-absolute-difference-in-an-array)| <ul><li>[Java](./Algorithms/Greedy/Minimum%20Absolute%20Difference%20in%20an%20Array/Solution.java)</li> <li>[JS](./Algorithms/Greedy/Minimum%20Absolute%20Difference%20in%20an%20Array/Solution.js)</li><li>[C#](./Algorithms/Greedy/Minimum%20Absolute%20Difference%20in%20an%20Array/Solution.cs)</li><ul> | _O(n log(n))_ | _O(n)_ | Easy | 15| ||
|  |[Chief Hopper](https://www.hackerrank.com/challenges/chief-hopper)| <ul><li>[Java](./Algorithms/Greedy/Chief%20Hopper/Solution.java)</li><ul> | _O(n)_ | _O(n)_| Hard | 65 | ||
|  |[Mark and Toys](https://www.hackerrank.com/challenges/mark-and-toys)| <ul><li>[Java](./Algorithms/Greedy/Mark%20and%20Toys/Solution.java)</li> <li>[JS](./Algorithms/Greedy/Mark%20and%20Toys/Solution.js)</li><ul> | _O(n log(n))_ | _O(n)_| Easy | 35 | ||
|  | [Marc's Cakewalk](https://www.hackerrank.com/challenges/marcs-cakewalk)| <ul><li>[Java](./Algorithms/Greedy/Marc's%20Cakewalk/Solution.java)</li><li>[C#](./Algorithms/Greedy/Marc's%20Cakewalk/Solution.cs)</li><ul> | _O(n + k)_ | _O(k)_ | Easy | 15| ||
|  |[Grid Challenge](https://www.hackerrank.com/challenges/grid-challenge)| <ul><li>[Java](./Algorithms/Greedy/Grid%20Challenge/Solution.java)</li><ul> | _O(n*(n log (n)))_ | _O(n^2)_| Easy | 20 | ||
|  |[Luck Balance](https://www.hackerrank.com/challenges/luck-balance)| <ul><li>[Java](./Algorithms/Greedy/Luck%20Balance/Solution.java)</li><ul> | _O(n log(n))_ | _O(1)_ | Easy | 20| ||
|  |[Maximum Perimeter Triangle](https://www.hackerrank.com/challenges/maximum-perimeter-triangle)| <ul><li>[Java](./Algorithms/Greedy/Maximum%20Perimeter%20Triangle/Solution.java)</li><ul> | _O(n log (n))_ | _O(n)_| Easy | 20 | ||
|  |[Permuting Two Arrays](https://www.hackerrank.com/challenges/two-arrays)| <ul><li>[Java](./Algorithms/Greedy/Permuting%20Two%20Arrays/Solution.java)</li> <li>[JS](./Algorithms/Greedy/Permuting%20Two%20Arrays/Solution.js)</li><ul> | _O(n log (n))_ | _O(n)_| Easy | 40 | ||
|  |[Jim and the Orders](https://www.hackerrank.com/challenges/jim-and-the-orders)| <ul><li>[Java](./Algorithms/Greedy/Jim%20and%20the%20Orders/Solution.java)</li><ul> | _O(n log (n))_ | _O(n)_| Easy | 40 | ||
|  |[Equal Stacks](https://www.hackerrank.com/challenges/equal-stacks)| <ul><li>[Java](./Algorithms/Greedy/Equal%20Stacks/Solution.java)</li><ul> | _O(n)_ | _O(n)_| Easy | 25 | ||
|  |[Sherlock and The Beast](https://www.hackerrank.com/challenges/sherlock-and-the-beast)| <ul><li>[Java](./Algorithms/Greedy/Sherlock%20and%20The%20Beast/Solution.java)</li><ul> | _O(n)_ | _O(n)_| Easy | 30 | ||
|  |[Priyanka and Toys](https://www.hackerrank.com/challenges/priyanka-and-toys)| <ul><li>[Java](./Algorithms/Greedy/Priyanka%20and%20Toys/Solution.java)</li> <li>[JS](./Algorithms/Greedy/Priyanka%20and%20Toys/Solution.js)</li><ul> | _O(n log(n))_ | _O(n)_| Easy | 30 | ||
|  |[Largest Permutation](https://www.hackerrank.com/challenges/largest-permutation)| <ul><li>[JS](./Algorithms/Greedy/Largest%20Permutation/Solution.js)</li><ul> | _O(n)_ | _O(n)_ | Easy | 30| ||
|   | [Beautiful Pairs](https://www.hackerrank.com/challenges/beautiful-pairs)| <ul><li>Java</li></ul> |  | | Easy | 30| ||
|   | [Yet Another Minimax Problem](https://www.hackerrank.com/challenges/yet-another-minimax-problem)| <ul><li>Java</li></ul> |  | | Medium | 20| ||
|   | [Flipping the Matrix](https://www.hackerrank.com/challenges/flipping-the-matrix)| <ul><li>[Java](./Algorithms/Constructve%20Algorithms/Flipping%20Matrix/Solution.java)</li><ul> | _O(n^2)_ | _O(n^2)_ | Medium | 30 | ||
|   | [Roads and Libraries](https://www.hackerrank.com/challenges/torque-and-development)| <ul><li>Java</li></ul> |  | | Medium | 30| ||
|  |[Greedy Florist](https://www.hackerrank.com/challenges/greedy-florist)| <ul><li>[JS](./Algorithms/Greedy/Greedy%20Florist/Solution.js)</li><ul> | _O(n log (n))_ | _O(n)_| Medium | 35 | ||
|  |[Mark and Toys](https://www.hackerrank.com/challenges/mark-and-toys)| <ul><li>[Java](./Algorithms/Greedy/Mark%20and%20Toys/Solution.java)</li><ul> | _O(n log(n))_ | _O(n)_| Easy | 35 | ||
|   | [Max Min](https://www.hackerrank.com/challenges/angry-children)| <ul><li>[Java](./Algorithms/Greedy/Max%20Min/Solution.java)</li><ul> | _O(n log(n))_ | _O(1)_ | Medium | 35| ||
|   | [Permuting Two Arrays](https://www.hackerrank.com/challenges/two-arrays)| <ul><li>Java</li></ul> |  | | Easy | 40| ||
|   | [Jim and the Orders](https://www.hackerrank.com/challenges/jim-and-the-orders)| <ul><li>Java</li></ul> |  | | Easy | 40| ||
|   | [Goodland Electricity](https://www.hackerrank.com/challenges/pylons)| <ul><li>Java</li></ul> |  | | Medium | 40| ||
|   | [Fun Game](https://www.hackerrank.com/challenges/fun-game-1)| <ul><li>Java</li></ul> |  | | Medium | 40| ||
|   | [Reverse Shuffle Merge](https://www.hackerrank.com/challenges/reverse-shuffle-merge)| <ul><li>Java</li></ul> |  | | Advanced | 50| ||
|   | [Cutting Boards](https://www.hackerrank.com/challenges/board-cutting)| <ul><li>Java</li></ul> |  | | Hard | 60| ||
|   | [Algorithmic Crush](https://www.hackerrank.com/challenges/crush)| <ul><li>Java</li></ul> |  | | Hard | 60| ||
|   | [Prim's (MST): Special Subtree](https://www.hackerrank.com/challenges/primsmstsub)| <ul><li>Java</li></ul> |  | | Medium | 60| ||
|   | [Accessory Collection](https://www.hackerrank.com/challenges/accessory-collection)| <ul><li>Java</li></ul> |  | | Hard | 60| ||
|  |[Chief Hopper](https://www.hackerrank.com/challenges/rust-murderer)| <ul><li>[Java](./Algorithms/Greedy/Chief%20Hopper/Solution.java)</li><ul> | _O(n)_ | _O(n)_| Hard | 65 | ||
|   | [Sherlock and MiniMax](https://www.hackerrank.com/challenges/sherlock-and-minimax)| <ul><li>Java</li></ul> |  | | Hard | 70| ||
|   | [Team Formation](https://www.hackerrank.com/challenges/team-formation)| <ul><li>Java</li></ul> |  | | Advanced | 70| ||

### Dynamic Programming
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Equal](https://www.hackerrank.com/challenges/equal)| <ul><li>Java</li></ul> |  | | Medium | 30 | ||
|   | [Cut Tree](https://www.hackerrank.com/challenges/cuttree)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Mr K marsh](https://www.hackerrank.com/challenges/mr-k-marsh)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Sam and sub-strings](https://www.hackerrank.com/challenges/sam-and-substrings)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Summing Pieces](https://www.hackerrank.com/challenges/summing-pieces)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Short Palindrome](https://www.hackerrank.com/challenges/short-palindrome)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Abbreviation](https://www.hackerrank.com/challenges/abbr)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Fair Cut](https://www.hackerrank.com/challenges/fair-cut)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Fibonacci Modified](https://www.hackerrank.com/challenges/fibonacci-modified)| <ul><li>[Java](./Algorithms/Dynamic%20Programming/Modified%20Fibonacci/Solution.java)</li><ul> |  | | Medium | 45 | ||
|   | [Lego Blocks](https://www.hackerrank.com/challenges/lego-blocks)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Candies](https://www.hackerrank.com/challenges/candies)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Stock Maximize](https://www.hackerrank.com/challenges/stockmax)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Angry Childtren 2](https://www.hackerrank.com/challenges/angry-children-2)| <ul><li>Java</li></ul> |  | | Hard | 50 | ||
|   | [The Maximum Subarray](https://www.hackerrank.com/challenges/maxsubarray)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Sherlock and Cost](https://www.hackerrank.com/challenges/sherlock-and-cost)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Xor and Sum](https://www.hackerrank.com/challenges/xor-and-sum)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Counting Special Sub-Cubes](https://www.hackerrank.com/challenges/counting-special-sub-cubes)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Two Robots](https://www.hackerrank.com/challenges/two-robots)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Kingdom Division](https://www.hackerrank.com/challenges/kingdom-division)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Prime XOR](https://www.hackerrank.com/challenges/prime-xor)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [HackerRank City](https://www.hackerrank.com/challenges/hr-city)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Nikita and the Game](https://www.hackerrank.com/challenges/array-splitting)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Prime Digit Sums](https://www.hackerrank.com/challenges/prime-digit-sums)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Mandragora Forest](https://www.hackerrank.com/challenges/mandragora)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [LCS Returns](https://www.hackerrank.com/challenges/tutzki-and-lcs)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Grid Walking](https://www.hackerrank.com/challenges/grid-walking)| <ul><li>Java</li></ul> |  | | Medium | 55 | ||
|   | [Bricks Game](https://www.hackerrank.com/challenges/play-game)| <ul><li>Java</li></ul> |  | | Medium | 55 | ||
|   | [The Longest Common Subsequence](https://www.hackerrank.com/challenges/dynamic-programming-classics-the-longest-common-subsequence)| <ul><li>Java</li></ul> |  | | Medium | 55 | ||
|   | [Substring Diff](https://www.hackerrank.com/challenges/substring-diff)| <ul><li>Java</li></ul> |  | | Medium | 60 | ||
|   | [Brick Tiling](https://www.hackerrank.com/challenges/brick-tiling)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Alien Languages](https://www.hackerrank.com/challenges/alien-languages)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [The Longest Increasing Subsequence](https://www.hackerrank.com/challenges/longest-increasing-subsequent)| <ul><li>Java</li></ul> |  | | Advanced | 60 | ||
|   | [The Coin Change Problem](https://www.hackerrank.com/challenges/coin-change)| <ul><li>[Python3](./Algorithms/Dynamic%20Programming/The%20Coin%20Change%20Problem/solution.py)</li><ul> | _O(N*M)_ | _O(N)_| Hard | 60 | ||
|   | [Knapsack](https://www.hackerrank.com/challenges/unbounded-knapsack)| <ul><li>Java</li></ul> |  | | Medium | 60 | ||
|   | [Sherlock's Array Merging Algorithm](https://www.hackerrank.com/challenges/sherlocks-array-merging-algorithm)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [New Year Game](https://www.hackerrank.com/challenges/newyear-game)| <ul><li>Java</li></ul> |  | | Medium | 60 | ||
|   | [Shashank and the Palindromic Strings](https://www.hackerrank.com/challenges/shashank-and-palindromic-strings)| <ul><li>Java</li></ul> |  | | Advanced | 60 | ||
|   | [Decibinary Numbers](https://www.hackerrank.com/challenges/decibinary-numbers)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Choosing White Balls](https://www.hackerrank.com/challenges/choosing-white-balls)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [DP: Coin Change](https://www.hackerrank.com/challenges/ctci-coin-change)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Clues on a Binary Path](https://www.hackerrank.com/challenges/clues-on-a-binary-path)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [GCD Matrix](https://www.hackerrank.com/challenges/gcd-matrix)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Coin on the Table](https://www.hackerrank.com/challenges/coin-on-the-table)| <ul><li>Java</li></ul> |  | | Medium | 65 | ||
|   | [Interval Selection](https://www.hackerrank.com/challenges/interval-selection)| <ul><li>Java</li></ul> |  | | Medium | 65 | ||
|   | [Red John is Back](https://www.hackerrank.com/challenges/red-john-is-back)| <ul><li>Java</li></ul> |  | | Medium | 65 | ||
|   | [Play with words](https://www.hackerrank.com/challenges/strplay)| <ul><li>Java</li></ul> |  | | Medium | 65 | ||
|   | [Queens on Board](https://www.hackerrank.com/challenges/queens-on-board)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [String Reduction](https://www.hackerrank.com/challenges/string-reduction)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Far Vertices](https://www.hackerrank.com/challenges/far-vertices)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [The Indian Job](https://www.hackerrank.com/challenges/the-indian-job)| <ul><li>Java</li></ul> |  | | Medium | 70 | ||
|   | [Hexagonal Grid](https://www.hackerrank.com/challenges/hexagonal-grid)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Longest Palindromic Subsequence](https://www.hackerrank.com/challenges/longest-palindromic-subsequence)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Turn Off the Lights](https://www.hackerrank.com/challenges/turn-off-the-lights)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Tara's Beautiful Permutations](https://www.hackerrank.com/challenges/taras-beautiful-permutations)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Two Subarrays](https://www.hackerrank.com/challenges/two-subarrays)| <ul><li>Java</li></ul> |  | | Expert | 70 | ||
|   | [Mining](https://www.hackerrank.com/challenges/mining)| <ul><li>Java</li></ul> |  | | Advanced | 75 | ||
|   | [The Longest Common Subsequence (LCS)](https://www.hackerrank.com/challenges/linkedin-practice-dynamic-programming-lcs)| <ul><li>Java</li></ul> |  | | Hard | 75 | ||
|   | [Points in a Plane](https://www.hackerrank.com/challenges/points-in-a-plane)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||
|   | [Fairy Chess](https://www.hackerrank.com/challenges/fairy-chess)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||
|   | [Billboards](https://www.hackerrank.com/challenges/billboards)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||
|   | [Requirement](https://www.hackerrank.com/challenges/requirement)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||
|   | [A Super Hero](https://www.hackerrank.com/challenges/a-super-hero)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Covering the stains](https://www.hackerrank.com/challenges/covering-the-stains)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Superman Celebrates Diwali](https://www.hackerrank.com/challenges/superman-celebrates-diwali)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Wet Shark and Two Subsequences](https://www.hackerrank.com/challenges/wet-shark-and-two-subsequences)| <ul><li>Java</li></ul> |  | | Medium | 80 | ||
|   | [Zurikela's Graph](https://www.hackerrank.com/challenges/zurikela)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [New Year Present](https://www.hackerrank.com/challenges/newyear-present )| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Suffix Rotation](https://www.hackerrank.com/challenges/suffix-rotation)| <ul><li>Java</li></ul> |  | | Expert | 80 | ||
|   | [Black and White Tree](https://www.hackerrank.com/challenges/black-n-white-tree-1)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Beautiful Strings](https://www.hackerrank.com/challenges/beautiful-string)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Longest Mod Path](https://www.hackerrank.com/challenges/longest-mod-path)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Super Functional Strings](https://www.hackerrank.com/challenges/super-functional-strings)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||
|   | [Kitty's Calculations on a Tree](https://www.hackerrank.com/challenges/kittys-calculations-on-a-tree)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||
|   | [Liars](https://www.hackerrank.com/challenges/liars)| <ul><li>Java</li></ul> |  | | Advanced | 85 | ||
|   | [Dorsey Thief](https://www.hackerrank.com/challenges/dorsey-thief)| <ul><li>Java</li></ul> |  | | Advanced | 85 | ||
|   | [Swap Permutation](https://www.hackerrank.com/challenges/swappermutation)| <ul><li>Java</li></ul> |  | | Medium | 85 | ||
|   | [Candles Counting](https://www.hackerrank.com/challenges/candles-2)| <ul><li>Java</li></ul> |  | | Medium | 85 | ||
|   | [Square Subsequences](https://www.hackerrank.com/challenges/square-subsequences)| <ul><li>Java</li></ul> |  | | Hard | 90 | ||
|   | [Hyper Strings](https://www.hackerrank.com/challenges/hyper-strings)| <ul><li>Java</li></ul> |  | | Advanced | 90 | ||
|   | [Unique Divide And Conquer](https://www.hackerrank.com/challenges/unique-divide-and-conquer)| <ul><li>Java</li></ul> |  | | Advanced | 90 | ||
|   | [Super Kth LIS](https://www.hackerrank.com/challenges/super-kth-lis)| <ul><li>Java</li></ul> |  | | Advanced | 90 | ||
|   | [Counting Road Networks](https://www.hackerrank.com/challenges/counting-road-networks)| <ul><li>Java</li></ul> |  | | Expert | 90 | ||
|   | [Lucky Numbers](https://www.hackerrank.com/challenges/lucky-numbers)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Count Scorecards](https://www.hackerrank.com/challenges/count-scorecards)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Unfair Game](https://www.hackerrank.com/challenges/unfair-game)| <ul><li>Java</li></ul> |  | | Advanced | 100 | ||
|   | [Oil Well](https://www.hackerrank.com/challenges/oil-well)| <ul><li>Java</li></ul> |  | | Hard | 100 | ||
|   | [Modify The Sequence](https://www.hackerrank.com/challenges/modify-the-sequence)| <ul><li>Java</li></ul> |  | | Advanced | 100 | ||
|   | [Divisible Numbers](https://www.hackerrank.com/challenges/divisible-numbers)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Ones and Twos](https://www.hackerrank.com/challenges/ones-and-twos)| <ul><li>Java</li></ul> |  | | Hard | 100 | ||
|   | [Extremum Permutations](https://www.hackerrank.com/challenges/extremum-permutations)| <ul><li>Java</li></ul> |  | | Medium | 100 | ||
|   | [Tree Pruning](https://www.hackerrank.com/challenges/tree-pruning)| <ul><li>Java</li></ul> |  | | Advanced | 100 | ||
|   | [P-sequences](https://www.hackerrank.com/challenges/p-sequences)| <ul><li>Java</li></ul> |  | | Hard | 100 | ||
|   | [Best spot](https://www.hackerrank.com/challenges/best-spot)| <ul><li>Java</li></ul> |  | | Advanced | 100 | ||
|   | [Find the Seed](https://www.hackerrank.com/challenges/find-the-seed)| <ul><li>Java</li></ul> |  | | Advanced | 100 | ||
|   | [The Blacklist](https://www.hackerrank.com/challenges/the-blacklist)| <ul><li>Java</li></ul> |  | | Advanced | 100 | ||
|   | [Police Operation](https://www.hackerrank.com/challenges/police-operation)| <ul><li>Java</li></ul> |  | | Hard | 100 | ||
|   | [Road Maintenance](https://www.hackerrank.com/challenges/road-maintenance)| <ul><li>Java</li></ul> |  | | Hard | 100 | ||
|   | [King and Four Sons](https://www.hackerrank.com/challenges/happy-king)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Counting the Ways](https://www.hackerrank.com/challenges/count-ways-1)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Hard Disk Drives](https://www.hackerrank.com/challenges/hard-drive-disks)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [Travel around the world](https://www.hackerrank.com/challenges/travel-around-the-world)| <ul><li>Java</li></ul> |  | | Medium | 120 | ||
|   | [Robot](https://www.hackerrank.com/challenges/robot)| <ul><li>Java</li></ul> |  | | Advanced | 120 | ||
|   | [Vim War](https://www.hackerrank.com/challenges/vim-war)| <ul><li>Java</li></ul> |  | | Advanced | 120 | ||
|   | [Dortmund Dilemma](https://www.hackerrank.com/challenges/dortmund-dilemma)| <ul><li>Java</li></ul> |  | | Advanced | 150 | ||
|   | [Separate the chocolate](https://www.hackerrank.com/challenges/separate-the-chocolate)| <ul><li>Java</li></ul> |  | | Expert | 250 | ||

### Constructive Algorithms
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Lena Sort](https://www.hackerrank.com/challenges/lena-sort)| <ul><li>Java</li></ul> |  | | Medium | 30 | ||
|   | [Flipping the Matrix](https://www.hackerrank.com/challenges/flipping-the-matrix)| <ul><li>[Java](./Algorithms/Constructve%20Algorithms/Flipping%20Matrix/Solution.java)</li><ul> | _O(n^2)_ | _O(n^2)_ | Medium | 30 | ||
|   | [Gaming Array](https://www.hackerrank.com/challenges/an-interesting-game-1)| <ul><li>Java</li></ul> |  | | Medium | 35 | ||
|   | [New Year Chaos](https://www.hackerrank.com/challenges/new-year-chaos)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Bonetrousle](https://www.hackerrank.com/challenges/bonetrousle)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Yet Another KMP Problem](https://www.hackerrank.com/challenges/kmp-problem)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Beautiful 3 Set](https://www.hackerrank.com/challenges/beautiful-3-set)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Inverse RMQ](https://www.hackerrank.com/challenges/inverse-rmq)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Two Subarrays](https://www.hackerrank.com/challenges/two-subarrays)| <ul><li>Java</li></ul> |  | | Expert | 70 | ||
|   | [Lovely Triplets](https://www.hackerrank.com/challenges/lovely-triplets)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||
|   | [Array Construction](https://www.hackerrank.com/challenges/array-construction)| <ul><li>Java</li></ul> |  | | Advanced | 80 | ||


### Bit Manipulation
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Lonely Integer](https://www.hackerrank.com/challenges/lonely-integer)| <ul><li>[Java](./Algorithms/Bit%20Manipulation/Lonely%20Integer/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 20 | ||
|   | [Maximizing XOR](https://www.hackerrank.com/challenges/maximizing-xor)| <ul><li>Java</li></ul> |  |  | Easy | 30 | ||
|   | [Counter game](https://www.hackerrank.com/challenges/counter-game)| <ul><li>Java</li></ul> |  |  | Medium | 30 | ||
|   | [Xor-sequence](https://www.hackerrank.com/challenges/xor-se)| <ul><li>Java</li></ul> |  |  | Medium | 40 | ||
|   | [Sum vs XOR](https://www.hackerrank.com/challenges/sum-vs-xor)| <ul><li>[Java](./Algorithms/Bit%20Manipulation/Sum%20vs%20XOR/Solution.java)</li><ul> | _O(n log(n))_ | _O(1)_ | Easy | 20 | ||
|   | [The Great XOR](https://www.hackerrank.com/challenges/the-great-xor)| <ul><li>Java</li></ul> |  |  | Medium | 25 | ||
|   | [Flipping bits](https://www.hackerrank.com/challenges/flipping-bits)| <ul><li>Java</li></ul> |  |  | Easy | 40 | ||
|   | [Yet Another Minimax Problem](https://www.hackerrank.com/challenges/yet-another-minimax-problem)| <ul><li>Java</li></ul> |  |  | Medium | 30 | ||
|   | [Sansa and XOR](https://www.hackerrank.com/challenges/sansa-and-xor)| <ul><li>Java</li></ul> |  |  | Medium | 30 | ||
|   | [AND Product](https://www.hackerrank.com/challenges/and-product)| <ul><li>Java</li></ul> |  |  | Medium | 40 | ||
|   | [Xoring Ninja](https://www.hackerrank.com/challenges/xoring-ninja)| <ul><li>Java</li></ul> |  |  | Hard | 55 | ||
|   | [Cipher](https://www.hackerrank.com/challenges/cipher)| <ul><li>Java</li></ul> |  |  | Medium | 50 | ||
|   | [XOR Matrix](https://www.hackerrank.com/challenges/xor-matrix)| <ul><li>Java</li></ul> |  |  | Hard | 50 | ||
|   | [What's Next?](https://www.hackerrank.com/challenges/whats-next)| <ul><li>Java</li></ul> |  |  | Medium | 50 | ||
|   | [String Transmission](https://www.hackerrank.com/challenges/string-transmission)| <ul><li>Java</li></ul> |  |  | Hard | 60 | ||
|   | [A or B](https://www.hackerrank.com/challenges/aorb)| <ul><li>Java</li></ul> |  |  | Medium | 50 | ||
|   | [Manipulative Numbers](https://www.hackerrank.com/challenges/manipulative-numbers)| <ul><li>Java</li></ul> |  |  | Hard | 55 | ||
|   | [Stone game](https://www.hackerrank.com/challenges/stonegame)| <ul><li>Java</li></ul> |  |  | Hard | 70 | ||
|   | [2's complement](https://www.hackerrank.com/challenges/2s-complement)| <ul><li>Java</li></ul> |  |  | Advanced | 70 | ||
|   | [Changing Bits](https://www.hackerrank.com/challenges/changing-bits)| <ul><li>Java</li></ul> |  |  | Advanced | 70 | ||
|   | [XOR key](https://www.hackerrank.com/challenges/xor-key)| <ul><li>Java</li></ul> |  |  | Advanced | 80 | ||
|   | [Maximizing the Function](https://www.hackerrank.com/challenges/maximizing-the-function)| <ul><li>Java</li></ul> |  |  | Hard | 70 | ||
|   | [XOR Subsequences](https://www.hackerrank.com/challenges/xor-subsequence)| <ul><li>Java</li></ul> |  |  | Advanced | 80 | ||
|   | [Iterate It](https://www.hackerrank.com/challenges/iterate-it)| <ul><li>Java</li></ul> |  |  | Expert | 90 | ||
|   | [Hamming Distance](https://www.hackerrank.com/challenges/hamming-distance)| <ul><li>Java</li></ul> |  |  | Expert | 150 | ||
|   | [Mixing proteins](https://www.hackerrank.com/challenges/pmix)| <ul><li>Java</li></ul> |  |  | Hard | 80 | ||

### Recursion
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [The Power Sum](https://www.hackerrank.com/challenges/the-power-sum)| <ul><li>Java</li></ul> |  | | Easy | 20 | ||
|   | [Crossword Puzzle](https://www.hackerrank.com/challenges/crossword-puzzle)| <ul><li>Java</li></ul> |  | | Medium | 30 | ||
|   | [Recursive Digit Sum](https://www.hackerrank.com/challenges/recursive-digit-sum)| <ul><li>Java</li></ul> |  | | Medium | 30 | ||
|   | [Simplified Chess Engine](https://www.hackerrank.com/challenges/simplified-chess-engine)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Password Cracker](https://www.hackerrank.com/challenges/password-cracker)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Artithmetic Expressions](https://www.hackerrank.com/challenges/arithmetic-expressions)| <ul><li>Java</li></ul> |  | | Hard | 40 | ||
|   | [K Factorization](https://www.hackerrank.com/challenges/k-factorization)| <ul><li>Java</li></ul> |  | | Hard | 50 | ||
|   | [Bowling Pins](https://www.hackerrank.com/challenges/bowling-pins)| <ul><li>Java</li></ul> |  | | Advanced | 60 | ||
|   | [Simplified Chess Engine II](https://www.hackerrank.com/challenges/simplified-chess-engine-ii)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Repetitive K-Sums](https://www.hackerrank.com/challenges/repeat-k-sums)| <ul><li>Java</li></ul> |  | | Advanced | 150 | ||

### Game Theory
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Game of Stones](https://www.hackerrank.com/challenges/game-of-stones-1)| <ul><li>[JS](./Algorithms/Game%20Theory/Game%20of%20Stones/Solution.js)</li><ul> | _O(n)_ | _O(1)_ | Easy | 15 | ||
|   | [Tower Breakers](https://www.hackerrank.com/challenges/tower-breakers-1)| <ul><li>Java</li></ul> |  | | Easy | 15 | ||
|   | [A Chessboard Game](https://www.hackerrank.com/challenges/a-chessboard-game-1)| <ul><li>Java</li></ul> |  | | Easy | 15 | ||
|   | [Introduction to Nim Game](https://www.hackerrank.com/challenges/nim-game-1)| <ul><li>Java</li></ul> |  | | Easy | 15 | ||
|   | [Misère Nim](https://www.hackerrank.com/challenges/misere-nim-1)| <ul><li>Java</li></ul> |  | | Easy | 20 | ||
|   | [Nimble Game](https://www.hackerrank.com/challenges/nimble-game-1)| <ul><li>Java</li></ul> |  | | Easy | 20 | ||
|   | [Alice and Bob's Silly Game](https://www.hackerrank.com/challenges/alice-and-bobs-silly-game)| <ul><li>Java</li></ul> |  | | Medium | 30 | ||
|   | [Poker Nim](https://www.hackerrank.com/challenges/poker-nim-1)| <ul><li>Java</li></ul> |  | | Easy | 20 | ||
|   | [Tower Breakers, Revisited!](https://www.hackerrank.com/challenges/tower-breakers-revisited-1)| <ul><li>Java</li></ul> |  | | Medium | 25 | ||
|   | [Tower Breakers, Again!](https://www.hackerrank.com/challenges/tower-breakers-again-1)| <ul><li>Java</li></ul> |  | | Medium | 30 | ||
|   | [Zero-Move Nim](https://www.hackerrank.com/challenges/zero-move-nim)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Chessboard Game, Again!](https://www.hackerrank.com/challenges/chessboard-game-again-1)| <ul><li>Java</li></ul> |  | | Medium | 30 | ||
|   | [Digits Square Board](https://www.hackerrank.com/challenges/digits-square-board-1)| <ul><li>Java</li></ul> |  | | Medium | 35 | ||
|   | [Fun Game](https://www.hackerrank.com/challenges/fun-game-1)| <ul><li>Java</li></ul> |  | | Medium | 40 | ||
|   | [Stone Division](https://www.hackerrank.com/challenges/stone-division)| <ul><li>Java</li></ul> |  | | Hard | 50 | ||
|   | [Chocolate in Box](https://www.hackerrank.com/challenges/chocolate-in-box)| <ul><li>Java</li></ul> |  | | Medium | 70 | ||
|   | [Kitty and Katty](https://www.hackerrank.com/challenges/kitty-and-katty)| <ul><li>Java</li></ul> |  | | Medium | 80 | ||
|   | [Powers Game](https://www.hackerrank.com/challenges/powers-game-1)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Deforestation](https://www.hackerrank.com/challenges/deforestation-1)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Bob and Ben](https://www.hackerrank.com/challenges/bob-and-ben)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Tower Breakers - The Final Battle](https://www.hackerrank.com/challenges/tower-breakers-the-final-battle-1)| <ul><li>Java</li></ul> |  | | Medium | 50 | ||
|   | [Simple Game](https://www.hackerrank.com/challenges/simple-game)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Permutation game](https://www.hackerrank.com/challenges/permutation-game)| <ul><li>Java</li></ul> |  | | Medium | 70 | ||
|   | [Move the Coins](https://www.hackerrank.com/challenges/move-the-coins)| <ul><li>Java</li></ul> |  | | Hard | 60 | ||
|   | [Play on benders](https://www.hackerrank.com/challenges/benders-play)| <ul><li>Java</li></ul> |  | | Medium | 70 | ||
|   | [New Year Game](https://www.hackerrank.com/challenges/newyear-game)| <ul><li>Java</li></ul> |  | | Medium | 60 | ||
|   | [Stone Piles](https://www.hackerrank.com/challenges/stone-piles)| <ul><li>Java</li></ul> |  | | Hard | 80 | ||
|   | [Chocolate Game](https://www.hackerrank.com/challenges/chocolate-game)| <ul><li>Java</li></ul> |  | | Hard | 90 | ||
|   | [Manasa and Prime game](https://www.hackerrank.com/challenges/manasa-and-prime-game)| <ul><li>Java</li></ul> |  | | Hard | 90 | ||
|   | [Vertical Rooks](https://www.hackerrank.com/challenges/vertical-rooks)| <ul><li>Java</li></ul> |  | | Medium | 90 | ||
|   | [A stones game](https://www.hackerrank.com/challenges/half)| <ul><li>Java</li></ul> |  | | Medium | 90 | ||
|   | [Tastes Like Winning](https://www.hackerrank.com/challenges/taste-of-win)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||

### NP Complete
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Walking the Approximate Longest Path](https://www.hackerrank.com/challenges/walking-the-approximate-longest-path)| <ul><li>Java</li></ul> |  | | Hard | 70 | ||
|   | [Sam's Puzzle (Approximate)](https://www.hackerrank.com/challenges/sams-puzzle)| <ul><li>Java</li></ul> |  | | Advanced | 85 | ||
|   | [Spies, Revised](https://www.hackerrank.com/challenges/spies-revised)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||
|   | [TBS Problem](https://www.hackerrank.com/challenges/inheritance)| <ul><li>Java</li></ul> |  | | Expert | 100 | ||

### Object Oriented Programming
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|   | [Class vs. Instance](https://www.hackerrank.com/challenges/class-vs-instance)| <ul><li>[Java](./Java/Class%20vs.%20Instance/Solution.java)</li><ul> | _N/A_ | _N/A_ | Easy | 30| ||
|   | [Inheritance](https://www.hackerrank.com/challenges/inheritance)| <ul><li>[Java](.Java/Inheritance/Solution.java)</li><ul> | _O(n)_ | _O(1)_ | Easy | 30 | ||
|   | [Abstract Classes](https://www.hackerrank.com/challenges/abstract-classes)| <ul><li>[Java](./Java/Abstract%20Classes/Solution.java)</li><ul> | _N/A_ | _N/A_ | Easy | 30| ||
|   | [Complex Numbers](https://www.hackerrank.com/challenges/complex-numbers)| <ul><li>[Java](./Java/Complex%20Numbers/Solution.java)</li><ul> | _O(1)_ | _O(1)_ | Easy | 30 | ||

### Arrays
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Arrays - DS](https://www.hackerrank.com/challenges/arrays-ds/problem)| <ul><li>[C++](./DataStructures/Arrays/Arrays%20-%20DS/Solution.cpp)</li><ul> | _O(n)_ | _O(n)_| Easy | 10 | ||
|  |[2D Array - DS](https://www.hackerrank.com/challenges/2d-array/problem)| <ul><li>[C++](./DataStructures/Arrays/2D%20Array%20-%20DS/Solution.cpp)</li><ul> | _O(1)_ | _O(1)_| Easy | 15 | ||
|  |[Sparse Arrays](https://www.hackerrank.com/challenges/sparse-arrays/problem)| <ul><li>[C#](./DataStructures/Arrays/Sparse%20Arrays/Solution.cs)</li><ul> | _O(n + q)_ | _O(n + q)_| Medium | 25 | n = number of input strings, q = number of queries ||
|  |[Dynamic Array](https://www.hackerrank.com/challenges/dynamic-array/problem)| <ul><li>[C#](./DataStructures/Arrays/Dynamic%20Array/Solution.cs)</li><ul> | _O(q)_ | _O(n)_| Easy | 15 | q = Number of queries ||

### Linked Lists
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Print the Elements of a Linked List](https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list)| <ul><li>[C++](./DataStructures/Linked%20Lists/Print%20the%20Elements%20of%20a%20Linked%20List/Solution.cpp)</li><ul> | _O(n)_ | _O(1)_| Easy | 5 | ||
|  |[Reverse a Linked List](https://www.hackerrank.com/challenges/reverse-a-linked-list)| <ul><li>[Java](./DataStructures/Linked%20Lists/Reverse%20a%20linked%20list/Solution.java)</li><ul> | _O(n)_ | _O(1)_| Easy | 5 | ||
|  |[Compare Two Linked Lists](https://www.hackerrank.com/challenges/compare-two-linked-lists)| <ul><li>[C++](./DataStructures/Linked%20Lists/Compare%20two%20linked%20lists/Solution.cpp)</li><ul> | _O(n)_ | _O(1)_| Easy | 5 | ||
|  |[Delete a node](https://www.hackerrank.com/challenges/delete-a-node-from-a-linked-list/problem)| <ul><li>[C++](./DataStructures/Linked%20Lists/Delete%20Node/solution.cpp)</li><ul> | _O(n)_ | _O(1)_| Easy | 5 | ||

### Trees
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Tree: Preorder Traversal](https://www.hackerrank.com/challenges/tree-preorder-traversal/)| <ul><li>[C++](./DataStructures/Trees/Tree%20Preorder%20Traversal/Solution.cpp)</li><ul> | _O(n)_ | _O(n)_| Easy | 10 | ||
|  |[Swap Nodes [Algo]](https://www.hackerrank.com/challenges/swap-nodes-algo/)| <ul><li>[C#](./DataStructures/Trees/Swap%20Nodes%20[Algo]/Solution.cs)</li><ul> | _O(n)_ | _O(n)_| Medium | 40 | ||

### Balanced Trees
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Self Balancing Tree](https://www.hackerrank.com/challenges/self-balancing-tree/)| <ul><li>[C++](./DataStructures/Balanced%20Trees/Self%20Balancing%20Tree/Solution.cpp)</li><ul> | _O(log(n))_ | _O(n)_| Medium | 50 | ||

### Stacks
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Maximum Element](https://www.hackerrank.com/challenges/maximum-element/)| <ul><li>[C++](./DataStructures/Stacks/Maximum%20Element/Solution.cpp)</li><ul> | _Push-O(1), Delete - O(n), Print - O(1)_ | _Push - O(1), Delete - O(1), Print - O(1)_| Easy | 20 | ||
|  |[Balanced Brackets](https://www.hackerrank.com/challenges/balanced-brackets/)| <ul><li>[Java](./DataStructures/Stacks/Balanced%20Brackets/Solution.java)</li><ul> | _O(n)_ | _O(n)_| Medium | 25 | ||

### Queues
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Queue using Two Stacks](https://www.hackerrank.com/challenges/queue-using-two-stacks/)| <ul><li>[C#](./DataStructures/Queues/Queue%20using%20Two%20Stacks/Solution.cs)</li><ul> | _Enqueue - O(1), Dequeue - O(n), Print - O(n)_ | _Enqueue - O(1), Dequeue - O(1), Print - O(1)_| Medium | 30 | ||

### Heap
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[QHEAP1](https://www.hackerrank.com/challenges/qheap1/)| <ul><li>[C#](./DataStructures/Heap/QHEAP1/Solution.cs)</li><ul> | _Insert - O(log(n)), Delete - O(n), Print - O(1)_ | _Insert - O(1), Delete - O(1), Print - O(1)_| Easy | 25 | ||

### Disjoint Set
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Spaceholder](https://www.hackerrank.com/challenges/spaceholder)| <ul><li>[C#]()</li><ul> | _O(1)_ | _O(1)_| Easy | 1 | ||

### Multiple Choice
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Data Structures MCQ 1](https://www.hackerrank.com/challenges/how-well-do-you-know-trees/problem)| <ul><li>[Language Independent](./DataStructures/Multiple%20Choice/Data%20Structures%20MCQ%201/Solution.md)</li><ul> | _NA_ | _NA_| Hard | 5 | ||
|  |[Data Structures MCQ 2](https://www.hackerrank.com/challenges/are-you-an-expert-on-data-structures/problem)| <ul><li>[Language Independent](./DataStructures/Multiple%20Choice/Data%20Structures%20MCQ%202/Solution.md)</li><ul> | _NA_ | _NA_| Hard | 5 | ||
|  |[Data Structures MCQ 3](https://www.hackerrank.com/challenges/are-you-an-expert-on-data-structures-1/problem)| <ul><li>[Language Independent](./DataStructures/Multiple%20Choice/Data%20Structures%20MCQ%203/Solution.md)</li><ul> | _NA_ | _NA_| Hard | 5 | ||

### Trie
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Contacts](https://www.hackerrank.com/challenges/contacts/problem)| <ul><li>[C#](./DataStructures/Trie/Contacts/Solution.cs)</li><ul> | _Add - O(L), Find - O(L)_ | _Add - O(L), Find - O(1)_| Medium | 40 | L = Length of a contact name ||

### Advanced
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Spaceholder](https://www.hackerrank.com/challenges/spaceholder)| <ul><li>[C#]()</li><ul> | _O(1)_ | _O(1)_| Easy | 1 | ||

### Fundamentals
| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note
-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----
|  |[Leonardo's Prime Factors](https://www.hackerrank.com/challenges/leonardo-and-prime/problem)| <ul><li>[C#](./Mathematics/Fundamentals/Leonardo's%20Prime%20Factors/Solution.cs)</li><ul> | _O(1)_ | _O(1)_| Easy | 10 | ||



[HackerRank]:https://cloud.githubusercontent.com/assets/19765741/25342064/d17a563c-28d8-11e7-83fc-763d4ab4820a.jpg

[Problems Solved]:https://img.shields.io/badge/Problems%20Solved-132-brightgreen.svg
[Language]:https://img.shields.io/badge/Language-Java/Python/C++-orange.svg
[UpToDate]:https://img.shields.io/badge/Latest%20Update-n/a-lightgrey.svg

[AlgorithmsPercentile]:https://img.shields.io/badge/Percentile-94th-brightgreen.svg
[MachineLearningPercentile]:https://img.shields.io/badge/Percentile-n/a-lightgrey.svg
[FunctionalLanguagesPercentile]:https://img.shields.io/badge/Percentile-n/a-lightgrey.svg

[AlgorithmsRank]:https://img.shields.io/badge/Rank-4392-brightgreen.svg
[AlgorithmsPoints]:https://img.shields.io/badge/Points-3450-brightgreen.svg

[DataStructuresRank]:https://img.shields.io/badge/Rank-114680-red.svg
[DataStructuresPoints]:https://img.shields.io/badge/Points-25.00-red.svg

[MathematicsRank]:https://img.shields.io/badge/Rank-n/a-lightgrey.svg
[MathematicsPoints]:https://img.shields.io/badge/Points-n/a-lightgrey.svg

[JavaRank]:https://img.shields.io/badge/Rank-20998-yellow.svg
[JavaPoints]:https://img.shields.io/badge/Points-163.00-yellow.svg
