Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/ryanfehr/hackerrank

HackerRank solutions in Java/JS/Python/C++/C#
https://github.com/ryanfehr/hackerrank
algorithms cpp csharp data-structures hackerrank java java8 javascript python
Last synced: about 7 hours ago
JSON representation
HackerRank solutions in Java/JS/Python/C++/C#
Host: GitHub
URL: https://github.com/ryanfehr/hackerrank
Owner: RyanFehr
License: mit
Created: 2016-09-11T01:23:55.000Z (about 8 years ago)
Default Branch: master
Last Pushed: 2024-02-22T11:50:08.000Z (7 months ago)
Last Synced: 2024-09-25T01:39:01.506Z (about 9 hours ago)
Topics: algorithms, cpp, csharp, data-structures, hackerrank, java, java8, javascript, python
Language: Java
Homepage:
Size: 873 KB
Stars: 1,281
Watchers: 90
Forks: 694
Open Issues: 119
Metadata Files:
- Readme: README.md
- License: license.md
Awesome Lists containing this project

README

        [CopyrightLicense]:./license.md



	





    Solutions to problems on HackerRank.





	Check out HackerRank's new format here





	If you are interested in helping or have a solution in a different language feel free to make a pull request.





	

	

	



## 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)| 


[Java](./Algorithms/Warmup/Solve%20Me%20First/Solution.java)
 [C#](./Algorithms/Warmup/Solve%20Me%20First/Solution.cs)

 | _O(1)_ | _O(1)_| Easy | 1 | ||

|  |[Simple Array Sum](https://www.hackerrank.com/challenges/simple-array-sum)| 

[Java](./Algorithms/Warmup/Simple%20Array%20Sum/Solution.java)
 [C#](./Algorithms/Warmup/Simple%20Array%20Sum/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 10 | ||

|  |[Compare the Triplets](https://www.hackerrank.com/challenges/compare-the-triplets)| 

[Java](./Algorithms/Warmup/Compare%20the%20Triplets/Solution.java)
 [C#](./Algorithms/Warmup/Compare%20the%20Triplets/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy | 10 | ||

|  |[A Very Big Sum](https://www.hackerrank.com/challenges/a-very-big-sum)| 

[Java](./Algorithms/Warmup/A%20Very%20Big%20Sum/Solution.java)
 [C#](./Algorithms/Warmup/A%20Very%20Big%20Sum/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 10 | ||

|  |[Diagonal Difference](https://www.hackerrank.com/challenges/diagonal-difference)| 

[Java](./Algorithms/Warmup/Diagonal%20Difference/Solution.java)

[C#](./Algorithms/Warmup/Diagonal%20Difference/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 10 | ||

|  |[Plus Minus](https://www.hackerrank.com/challenges/plus-minus)| 

[Java](./Algorithms/Warmup/Plus%20Minus/Solution.java)

[C#](./Algorithms/Warmup/Plus%20Minus/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 10 | ||

|  |[Staircase](https://www.hackerrank.com/challenges/staircase)| 

[Java](./Algorithms/Warmup/Staircase/Solution.java)

[C#](./Algorithms/Warmup/Staircase/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 10 | ||

|  |[Mini-Max Sum](https://www.hackerrank.com/challenges/mini-max-sum)| 

[Java](./Algorithms/Warmup/Mini-Max%20Sum/Solution.java)

[C#](./Algorithms/Warmup/Mini-Max%20Sum/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy | 10 | ||

|  |[Time Conversion](https://www.hackerrank.com/challenges/time-conversion)| 

[Java](./Algorithms/Warmup/Time%20Conversion/Solution.java)

[C#](./Algorithms/Warmup/Time%20Conversion/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy | 15 | ||

|  |[Birthday Cake Candles](https://www.hackerrank.com/challenges/birthday-cake-candles)| 

[Java](./Algorithms/Warmup/Birthday%20Cake%20Candles/Solution.java)

[C#](./Algorithms/Warmup/Birthday%20Cake%20Candles/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 10 | ||

### Implementation

| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note

-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----

|   | [Grading Students](https://www.hackerrank.com/challenges/grading)| 


[Java](./Algorithms/Implementation/Grading%20Students/Solution.java)
 [JS](./Algorithms/Implementation/Grading%20Students/Solution.js)
 [C#](./Algorithms/Implementation/Grading%20Students/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy| 10| ||

|   | [Apple and Orange](https://www.hackerrank.com/challenges/apple-and-orange)| 

[Java](./Algorithms/Implementation/Apple%20and%20Orange/Solution.java)
 [JS](./Algorithms/Implementation/Apple%20and%20Orange/Solution.js)
 [C#](./Algorithms/Implementation/Apple%20and%20Orange/Solution.cs)

 | _O(n+m)_ | _O(1)_ | Easy| 10| ||

|   | [Kangaroo](https://www.hackerrank.com/challenges/kangaroo)| 

[Java](./Algorithms/Implementation/Kangaroo/Solution.java)
 [C#](./Algorithms/Implementation/Kangaroo/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy| 10| ||

|   | [Between Two Sets](https://www.hackerrank.com/challenges/between-two-sets)| 

[Java](./Algorithms/Implementation/Between%20Two%20Sets/Solution.java)
 [C#](./Algorithms/Implementation/Between%20Two%20Sets/Solution.cs)

 | _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)| 

[Java](./Algorithms/Implementation/Divisible%20Sum%20Pairs/Solution.java)

[C#](./Algorithms/Implementation/Divisible%20Sum%20Pairs/Solution.cs)

 | _O(n^2)_ | _O(1)_ | Easy| 10| ||

|   | [Birthday Chocolate](https://www.hackerrank.com/challenges/the-birthday-bar)| 

[Java](./Algorithms/Implementation/Birthday%20Chocolate/Solution.java)
 [C#](./Algorithms/Implementation/Birthday%20Chocolate/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy| 10| ||

|   | [Breaking the Records](https://www.hackerrank.com/challenges/breaking-best-and-worst-records)| 

[Java](./Algorithms/Implementation/Breaking%20the%20Records/Solution.java)
 [C#](./Algorithms/Implementation/Breaking%20the%20Records/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy| 10| ||

|   | [Migratory Birds](https://www.hackerrank.com/challenges/migratory-birds)| 

[Java](./Algorithms/Implementation/Migratory%20Birds/Solution.java)
 [JS](./Algorithms/Implementation/Migratory%20Birds/Solution.js)

[C#](./Algorithms/Implementation/Migratory%20Birds/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy| 10| ||

|   | [Day of the Programmer](https://www.hackerrank.com/challenges/day-of-the-programmer)| 

[Java](./Algorithms/Implementation/Day%20Of%20The%20Programmer/Solution.java)

[C#](./Algorithms/Implementation/Day%20Of%20The%20Programmer/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy| 15| ||

|   | [Bon Appetit](https://www.hackerrank.com/challenges/bon-appetit)| 

[Java](./Algorithms/Implementation/Bon%20Appetit/Solution.java)

[C#](./Algorithms/Implementation/Bon%20Appetit/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy| 10| ||

|   | [Sock Merchant](https://www.hackerrank.com/challenges/sock-merchant)| 

[Java](./Algorithms/Implementation/Sock%20Merchant/Solution.java)
 [C#](./Algorithms/Implementation/Sock%20Merchant/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy| 10| ||

|   | [Drawing Book](https://www.hackerrank.com/challenges/drawing-book)| 

[Java](./Algorithms/Implementation/Drawing%20Book/Solution.java)
 [C#](./Algorithms/Implementation/Drawing%20Book/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy| 10| ||

|   | [Counting Valleys](https://www.hackerrank.com/challenges/counting-valleys)| 

[Java](./Algorithms/Implementation/Counting%20Valleys/Solution.java)
 [JS](./Algorithms/Implementation/Counting%20Valleys/Solution.js)
 [C#](./Algorithms/Implementation/Counting%20Valleys/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy| 15| ||

|   | [Cats and a Mouse](https://www.hackerrank.com/challenges/cats-and-a-mouse)| 

[Java](./Algorithms/Implementation/Cats%20and%20a%20Mouse/Solution.java)
 [C#](./Algorithms/Implementation/Cats%20and%20a%20Mouse/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy| 15| ||

|   | [Electronics Shop](https://www.hackerrank.com/challenges/electronics-shop)| 

[Java](./Algorithms/Implementation/Electronics%20Shop/Solution.java)
 [JS](./Algorithms/Implementation/Electronics%20Shop/Solution.js)
 [C#](./Algorithms/Implementation/Electronics%20Shop/Solution.cs)

 | _O(n log (n))_ | _O(1)_ | Easy| 15| n = m+n||	

|   | [Picking Numbers](https://www.hackerrank.com/challenges/picking-numbers)| 

[Java](./Algorithms/Implementation/Picking%20Numbers/Solution.java)
 [C#](./Algorithms/Implementation/Picking%20Numbers/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy| 20| ||

|   | [Climbing the Leaderboard](https://www.hackerrank.com/challenges/climbing-the-leaderboard)| 

[Java](./Algorithms/Implementation/Climbing%20the%20Leaderboard/Solution.java)
 [JS](./Algorithms/Implementation/Climbing%20the%20Leaderboard/Solution.js)
 [C#](./Algorithms/Implementation/Climbing%20the%20Leaderboard/Solution.cs)

 | _O(n+m)_ | _(n)_ | Easy| 20| ||

|   | [The Hurdle Race](https://www.hackerrank.com/challenges/the-hurdle-race)| 

[Java](./Algorithms/Implementation/The%20Hurdle%20Race/Solution.java)
 [C#](./Algorithms/Implementation/The%20Hurdle%20Race/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy| 15| ||

|   | [Designer PDF Viewer](https://www.hackerrank.com/challenges/designer-pdf-viewer)| 

[Java](./Algorithms/Implementation/Designer%20PDF%20Viewer/Solution.java)
 [JS](./Algorithms/Implementation/Designer%20PDF%20Viewer/Solution.js)
 [C#](./Algorithms/Implementation/Designer%20PDF%20Viewer/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy| 20| ||

|   | [Forming a Magic Square](https://www.hackerrank.com/challenges/magic-square-forming)| 

[Java](./Algorithms/Implementation/Forming%20a%20Magic%20Square/Solution.java)

 | _O(1)_ | _O(1)_ | Easy| 20| ||

|   | [Utopian Tree](https://www.hackerrank.com/challenges/utopian-tree)| 

[Java](./Algorithms/Implementation/Utopian%20Tree/Solution.java)
 [JS](./Algorithms/Implementation/Utopian%20Tree/Solution.js)
 [C#](./Algorithms/Implementation/Utopian%20Tree/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Angry Professor](https://www.hackerrank.com/challenges/angry-professor)| 

[Java](./Algorithms/Implementation/Angry%20Professor/Solution.java)
 [JS](./Algorithms/Implementation/Angry%20Professor/Solution.js)
 [C#](./Algorithms/Implementation/Angry%20Professor/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Beautiful Days at the Movies](https://www.hackerrank.com/challenges/beautiful-days-at-the-movies)| 

[Java](./Algorithms/Implementation/Beautiful%20Days%20at%20the%20Movies/Solution.java)
 [JS](./Algorithms/Implementation/Beautiful%20Days%20at%20the%20Movies/Solution.js)
 [C#](./Algorithms/Implementation/Beautiful%20Days%20at%20the%20Movies/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 15| ||

|   | [Viral Advertising](https://www.hackerrank.com/challenges/strange-advertising)| 

[Java](./Algorithms/Implementation/Viral%20Advertising/Solution.java)
 [JS](./Algorithms/Implementation/Viral%20Advertising/Solution.js)
 [C#](./Algorithms/Implementation/Viral%20Advertising/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 15| ||

|   | [Save the Prisoner!](https://www.hackerrank.com/challenges/save-the-prisoner)| 

[Java](./Algorithms/Implementation/Save%20the%20Prisoner!/Solution.java)
 [C#](./Algorithms/Implementation/Save%20the%20Prisoner!/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy | 15| ||

|   | [Circular Array Rotation](https://www.hackerrank.com/challenges/circular-array-rotation)| 

[Java](./Algorithms/Implementation/Circular%20Array%20Rotation/Solution.java)
 [C#](./Algorithms/Implementation/Circular%20Array%20Rotation/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Sequence Equation](https://www.hackerrank.com/challenges/permutation-equation)| 

[Java](./Algorithms/Implementation/Sequence%20Equation/Solution.java)
 [C#](./Algorithms/Implementation/Sequence%20Equation/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 20| ||

|   | [Jumping on the Clouds: Revisited](https://www.hackerrank.com/challenges/jumping-on-the-clouds-revisited)| 

[Java](./Algorithms/Implementation/Jumping%20on%20the%20Clouds-%20Revisited/Solution.java)
 [C#](./Algorithms/Implementation/Jumping%20on%20the%20Clouds-%20Revisited/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 15| ||

|   | [Find Digits](https://www.hackerrank.com/challenges/find-digits)| 

[Java](./Algorithms/Implementation/Find%20Digits/Solution.java)
 [C#](./Algorithms/Implementation/Find%20Digits/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 25| ||

|   | [Extra Long Factorials](https://www.hackerrank.com/challenges/extra-long-factorials)| 

[Java](./Algorithms/Implementation/Extra%20Long%20Factorials/Solution.java)
 [C#](./Algorithms/Implementation/Extra%20Long%20Factorials/Solution.cs)

 | _O(n)_ | _O(1)_ | Medium | 20| ||

|   | [Append and Delete](https://www.hackerrank.com/challenges/append-and-delete)| 

[Java](./Algorithms/Implementation/Append%20and%20Delete/Solution.java)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Sherlock and Squares](https://www.hackerrank.com/challenges/sherlock-and-squares)| 

[Java](./Algorithms/Implementation/Sherlock%20and%20Squares/Solution.java)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Library Fine](https://www.hackerrank.com/challenges/library-fine)| 

[Java](./Algorithms/Implementation/Library%20Fine/Solution.java)
 [C#](./Algorithms/Implementation/Library%20Fine/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy| 15| ||

|   | [Cut the sticks](https://www.hackerrank.com/challenges/cut-the-sticks)| 

[Java](./Algorithms/Implementation/Cut%20the%20sticks/Solution.java)
 [C#](./Algorithms/Implementation/Cut%20the%20sticks/Solution.cs)

 | _O(n log(n))_ | _O(n)_ | Easy | 25| ||

|   | [Non-Divisible Subset](https://www.hackerrank.com/challenges/non-divisible-subset)| 

[Java](./Algorithms/Implementation/Non-Divisible%20Subset/Solution.java)

 | _O(n)_ | _O(n)_ | Medium | 20| ||

|   | [Repeated String](https://www.hackerrank.com/challenges/repeated-string)| 

[Java](./Algorithms/Implementation/Repeated%20String/Solution.java)
 [C#](./Algorithms/Implementation/Repeated%20String/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 20| ||

|   | [Jumping on the Clouds](https://www.hackerrank.com/challenges/jumping-on-the-clouds)| 

[Java](./Algorithms/Implementation/Jumping%20on%20the%20Clouds/Solution.java)

[C#](./Algorithms/Implementation/Jumping%20on%20the%20Clouds/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 20| ||

|   | [Equalize the Array](https://www.hackerrank.com/challenges/equality-in-a-array)| 

[Java](./Algorithms/Implementation/Equalize%20the%20Array/Solution.java)

[C#](./Algorithms/Implementation/Equalize%20the%20Array/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 20| ||

|   | [Queen's Attack II](https://www.hackerrank.com/challenges/queens-attack-2)| 

[Java](./Algorithms/Implementation/Queen's%20Attack%20II/Solution.java)

 | _O(k)_ | _O(1)_ | Medium | 30| ||

|   | [ACM ICPC Team](https://www.hackerrank.com/challenges/acm-icpc-team)| 

[Java](./Algorithms/Implementation/ACM%20ICPC%20Team/Solution.java)

 | _O(n^3)_ | _O(n)_ | Easy | 25| ||

|   | [Taum and B'day](https://www.hackerrank.com/challenges/taum-and-bday)| 

[Java](./Algorithms/Implementation/Taum%20and%20B'day/Solution.java)

[C#](./Algorithms/Implementation/Taum%20and%20B'day/Solution.cs)

 | _O(1)_ | _O(1)_ | Easy | 25| ||

|   | [Organizing Containers of Balls](https://www.hackerrank.com/challenges/organizing-containers-of-balls)| 

[Java](./Algorithms/Implementation/Organizing%20Containers%20of%20Balls/Solution.java)

 | _O(n^2)_ | _O(n^2)_ | Medium | 30| ||

|   | [Encryption](https://www.hackerrank.com/challenges/encryption)| 

[Java](./Algorithms/Implementation/Encryption/Solution.java)

[C#](./Algorithms/Implementation/Encryption/Solution.cs)

 | _O(n)_ | _O(1)_ | Medium | 30| ||

|   | [Bigger is Greater](https://www.hackerrank.com/challenges/bigger-is-greater)| 

[Java](./Algorithms/Implementation/Bigger%20is%20Greater/Solution.java)

 | _O(n)_ | _O(n)_ | Medium | 35| ||

|   | [Modified Kaprekar Numbers](https://www.hackerrank.com/challenges/kaprekar-numbers)| 

[Java](./Algorithms/Implementation/Modified%20Kaprekar%20Numbers/Solution.java)

[C#](./Algorithms/Implementation/Modified%20Kaprekar%20Numbers/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 30| ||

|   | [Minimum Distances](https://www.hackerrank.com/challenges/minimum-distances)| 

[Java](./Algorithms/Implementation/Minimum%20Distances/Solution.java)

[C#](./Algorithms/Implementation/Minimum%20Distances/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 20| ||

|   | [Beautiful Triplets](https://www.hackerrank.com/challenges/beautiful-triplets)| 

[Java](./Algorithms/Implementation/Beautiful%20Triplets/Solution.java)

[C#](./Algorithms/Implementation/Beautiful%20Triplets/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 20| ||

|   | [Strings: Making Anagrams](https://www.hackerrank.com/challenges/ctci-making-anagrams)| 

[Java](./Algorithms/Implementation/Strings%20Making%20Anagrams/Solution.java)

 | _O(|a|+|b|)_ | _O(1)_ | Easy | 30| ||

|   | [The Time in Words](https://www.hackerrank.com/challenges/the-time-in-words)| 

[Java](./Algorithms/Implementation/The%20Time%20in%20Words/Solution.java)

[C#](./Algorithms/Implementation/The%20Time%20in%20Words/Solution.cs)

 | _O(1)_ | _O(1)_ | Medium | 25| ||

|   | [Chocolate Feast](https://www.hackerrank.com/challenges/chocolate-feast)| 

[Java](./Algorithms/Implementation/Chocolate%20Feast/Solution.java)

[C#](./Algorithms/Implementation/Chocolate%20Feast/Solution.cs)

 | _O(log(n))_ | _O(1)_ | Easy | 25| Base of logarithmic time complexity is m ||

|   | [Service Lane](https://www.hackerrank.com/challenges/service-lane)| 

[Java](./Algorithms/Implementation/Service%20Lane/Solution.java)

[C#](./Algorithms/Implementation/Service%20Lane/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 20| ||

|   | [Lisa's Workbook](https://www.hackerrank.com/challenges/lisa-workbook)| 

[Java](./Algorithms/Implementation/Lisa's%20Workbook/Solution.java)

[C#](./Algorithms/Implementation/Lisa's%20Workbook/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 25| ||

|   | [Flatland Space Stations](https://www.hackerrank.com/challenges/flatland-space-stations)| 

[Java](./Algorithms/Implementation/Flatland%20Space%20Stations/Solution.java)

[C#](./Algorithms/Implementation/Flatland%20Space%20Stations/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 25| ||

|   | [Fair Rations](https://www.hackerrank.com/challenges/fair-rations)| 

[Java](./Algorithms/Implementation/Fair%20Rations/Solution.java)

[C#](./Algorithms/Implementation/Fair%20Rations/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 25| ||

|   | [Cavity Map](https://www.hackerrank.com/challenges/cavity-map)| 

[Java](./Algorithms/Implementation/Cavity%20Map/Solution.java)

[C#](./Algorithms/Implementation/Cavity%20Map/Solution.cs)

 | _O(n^2)_ | _O(n^2)_ | Easy | 30| ||

|   | [Manasa and Stones](https://www.hackerrank.com/challenges/manasa-and-stones)| 

[Java](./Algorithms/Implementation/Manasa%20and%20Stones/Solution.java)

[C#](./Algorithms/Implementation/Manasa%20and%20Stones/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 30| ||

|   | [The Grid Search](https://www.hackerrank.com/challenges/the-grid-search)| 

[Java](./Algorithms/Implementation/The%20Grid%20Search/Solution.java)

 | _O(n)_ | _O(n)_ | Medium | 30| n = len(word)||

|   | [Happy Ladybugs](https://www.hackerrank.com/challenges/happy-ladybugs)| 

[Java](./Algorithms/Implementation/Happy%20Ladybugs/Solution.java)

 | _O(n)_ | _O(n)_ | Easy | 30| ||

|   | [Strange Counter](https://www.hackerrank.com/challenges/strange-code)| 

[Java](./Algorithms/Implementation/Strange%20Counter/Solution.java)

 | _O(n)_ | _O(1)_ | Easy | 30| n = t ||

|   | [Absolute Permuation](https://www.hackerrank.com/challenges/absolute-permutation)| 

[Java](./Algorithms/Implementation/Absolute%20Permuation/Solution.java)

 | _O(n)_ | _O(n)_ | Medium | 40| ||

|   | [The Bomberman Game](https://www.hackerrank.com/challenges/bomber-man)| 

[Java](./Algorithms/Implementation/The%20Bomberman%20Game/Solution.java)

 | _O(n*m)_ | _O(n*m)_ | Medium | 40| ||

|   | [Ema's Supercomputer](https://www.hackerrank.com/challenges/two-pluses)| Java |  | | Medium | 40| ||

|   | [Larry's Array](https://www.hackerrank.com/challenges/larrys-array)| Java |  | | Medium | 40| ||

|   | [Almost Sorted](https://www.hackerrank.com/challenges/almost-sorted)| Java |  | | Medium | 50| ||

|   | [Matrix Layer Rotation](https://www.hackerrank.com/challenges/matrix-rotation-algo)| 

[Python3](./Algorithms/Implementation/Matrix%20Layer%20Rotation/Solution.py3)

 | _O(n*m)_ | _O(n*m)_ | Hard | 80| ||

|   | [Consecutive 1s in Binary Numbers](https://www.hackerrank.com/challenges/linkedin-practice-binary-numbers)| 

[Java](./Algorithms/Implementation/Consecutive%201s%20in%20Binary%20Numbers/Solution.java)

 | _O(n)_ | _O(1)_ | Easy | 30| ||

|   | [Nested Logic](https://www.hackerrank.com/challenges/linkedin-practice-nested-logic)| 

[Java](./Algorithms/Implementation/Nested%20Logic/Solution.java)

 | _O(1)_ | _O(1)_ | Easy | 40| ||

|   | [Bitwise AND](https://www.hackerrank.com/challenges/linkedin-practice-bitwise-and)| 

[Java](./Algorithms/Implementation/Bitwise%20AND/Solution.java)

 | _O(1)_ | _O(1)_ | Easy | 20| ||

### Strings

| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note

-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----

|   | [Super Reduced String](https://www.hackerrank.com/challenges/reduced-string)| 


[Java](./Algorithms/Strings/Super%20Reduced%20String/Solution.java)

[C#](./Algorithms/Strings/Super%20Reduced%20String/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 10| ||

|   | [camelCase](https://www.hackerrank.com/challenges/camelcase)| 

[Java](./Algorithms/Strings/camelCase/Solution.java)

[C#](./Algorithms/Strings/camelCase/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 15| ||

|   | [Strong Password](https://www.hackerrank.com/challenges/strong-password)| 

[C#](./Algorithms/Strings/Strong%20Password/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 15| ||

|   | [Two Characters](https://www.hackerrank.com/challenges/two-characters)| 

[Java](./Algorithms/Strings/Two%20Characters/Solution.java)

[C#](./Algorithms/Strings/Two%20Characters/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy| 15| ||

|   | [Caesar Cipher](https://www.hackerrank.com/challenges/caesar-cipher-1)| 

[Java](./Algorithms/Strings/Caesar%20Cipher/Solution.java)

[C#](./Algorithms/Strings/Caesar%20Cipher/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 15| ||

|   | [Caesar Cipher: Encryption](https://www.hackerrank.com/challenges/linkedin-practice-caesar-cipher)| 

[Java](./Algorithms/Strings/Caesar%20Cipher%20Encryption/Solution.java)

 | _O(n)_ | _O(n)_ | Easy | 40 | ||

|   | [Mars Exploration](https://www.hackerrank.com/challenges/mars-exploration)| 

[Java](./Algorithms/Strings/Mars%20Exploration/Solution.java)

[C#](./Algorithms/Strings/Mars%20Exploration/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 15| ||

|   | [HackerRank in a String!](https://www.hackerrank.com/challenges/hackerrank-in-a-string)| 

[Java](./Algorithms/Strings/HackerRank%20in%20a20String!/Solution.java)
 [JS](./Algorithms/Strings/HackerRank%20in%20a20String!/Solution.js)

[C#](./Algorithms/Strings/HackerRank%20in%20a20String!/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Pangrams](https://www.hackerrank.com/challenges/pangrams)| 

[Java](./Algorithms/Strings/Pangrams/Solution.java)

[C#](./Algorithms/Strings/Pangrams/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Weighted Uniform Strings](https://www.hackerrank.com/challenges/weighted-uniform-string)| 

[Java](./Algorithms/Strings/Weighted%20Uniform%20Strings/Solution.java)

[C#](./Algorithms/Strings/Weighted%20Uniform%20Strings/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 20| ||

|   | [Separate the Numbers](https://www.hackerrank.com/challenges/separate-the-numbers)| 

Java

[C#](./Algorithms/Strings/Separate%20the%20Numbers/Solution.cs)

 |  _O(n)_ | _O(n)_ | Easy | 20| ||

|   | [Funny String](https://www.hackerrank.com/challenges/funny-string)| 

[Java](./Algorithms/Strings/Funny%20String/Solution.java)

[C#](./Algorithms/Strings/Funny%20String/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 25| ||

|   | [Gemstones](https://www.hackerrank.com/challenges/gem-stones)| 

[Java](./Algorithms/Strings/Gemstones/Solution.java)

[C#](./Algorithms/Strings/Gemstones/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Alternating Characters](https://www.hackerrank.com/challenges/alternating-characters)| 

[Java](./Algorithms/Strings/Alternating%20Characters/Solution.java)

[C#](./Algorithms/Strings/Alternating%20Characters/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Beautiful Binary String](https://www.hackerrank.com/challenges/beautiful-binary-string)| 

[Java](./Algorithms/Strings/Beautiful%20Binary%20String/Solution.java)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [The Love-Letter Mystery](https://www.hackerrank.com/challenges/the-love-letter-mystery)| 

[Java](./Algorithms/Strings/The%20Love-Letter%20Mystery/Solution.java)

 | _O(n)_ | _O(1)_ | Easy | 20| ||

|   | [Determining DNA Health](https://www.hackerrank.com/challenges/determining-dna-health)| Java |  | | Hard | 50| ||

|   | [Palindrome Index](https://www.hackerrank.com/challenges/palindrome-index)| 

[Java](./Algorithms/Strings/Palindrome%20Index/Solution.java)

 | _O(n)_ | _O(1)_ | Easy | 25| ||

|   | [Anagram](https://www.hackerrank.com/challenges/anagram)| 

[Java](./Algorithms/Strings/Anagram/Solution.java)

 | _O(n)_ | _O(1)_ | Easy | 25| ||

|   | [Making Anagrams](https://www.hackerrank.com/challenges/making-anagrams)| 

[Java](./Algorithms/Strings/Making%20Anagrams/Solution.java)

 | _O(n)_ | _O(n)_ | Easy | 30| ||

|   | [Game of Thrones - I](https://www.hackerrank.com/challenges/game-of-thrones)| 

[Java](./Algorithms/Strings/Game%20of%20Thrones-I/Solution.java)

[C#](./Algorithms/Strings/Game%20of%20Thrones-I/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 30| ||

|   | [Two Strings](https://www.hackerrank.com/challenges/two-strings)| 

[Java](./Algorithms/Strings/Two%20Strings/Solution.java)

[C#](./Algorithms/Strings/Two%20Strings/Solution.cs)

 | _O(|a| + |b|)_ | _O(1)_ | Easy | 25| a and b are lengths of the input strings ||

|   | [String Construction](https://www.hackerrank.com/challenges/string-construction)| 

[Java](./Algorithms/Strings/String%20Construction/Solution.java)

 | _O(n)_ | _O(n)_ | Easy | 25| ||

|   | [Sherlock and Valid String](https://www.hackerrank.com/challenges/sherlock-and-valid-string)| 

[Java](./Algorithms/Strings/Sherlock%20and%20Valid%20String/Solution.java)

 | _O(n)_ | _O(n)_ | Hard | 100| ||

|   | [Richie Rich](https://www.hackerrank.com/challenges/richie-rich)| 

Java
 [Python3](./Algorithms/Strings/Richie%20Rich/solution.py)

 | _O(n)_  | _O(n)_ | Medium | 30| ||

|   | [Sherlock and Anagrams](https://www.hackerrank.com/challenges/sherlock-and-anagrams)| Java |  | | Medium | 50| ||

|   | [Common Child](https://www.hackerrank.com/challenges/common-child)| Java |  | | Hard | 60| ||

|   | [Bear and Steady Gene](https://www.hackerrank.com/challenges/bear-and-steady-gene)| Java |  | | Medium | 50| ||

|   | [Morgan and a String](https://www.hackerrank.com/challenges/morgan-and-a-string)| 

[Java](./Algorithms/Strings/Morgan%20and%20a%20String/Solution.java)

 | _O((|a|+|b|)^2)_ | _O(|a| + |b|)_ | Expert | 100| ||

|   | [Count Strings](https://www.hackerrank.com/challenges/count-strings)| Java |  | | Hard | 80| ||

|   | [String Function Calculation](https://www.hackerrank.com/challenges/string-function-calculation)| Java |  | | Advanced | 80| ||

|   | [Build a Palindrome](https://www.hackerrank.com/challenges/challenging-palindromes)| Java |  | | Advanced | 80| ||

|   | [Build a String](https://www.hackerrank.com/challenges/build-a-string)| Java |  | | Hard | 80| ||

|   | [Gridland Provinces](https://www.hackerrank.com/challenges/gridland-provinces)| Java |  | | Hard | 80| ||

|   | [Ashton and String](https://www.hackerrank.com/challenges/ashton-and-string)| Java |  | | Advanced | 100| ||

|   | [String Similarity](https://www.hackerrank.com/challenges/string-similarity)| Java |  | | Expert | 100| ||

|   | [Super Functional Strings](https://www.hackerrank.com/challenges/super-functional-strings)| Java |  | | Advanced | 80| ||

|   | [Circular Palindromes](https://www.hackerrank.com/challenges/circular-palindromes)| Java |  | | Advanced | 120| ||

|   | [Similar Strings](https://www.hackerrank.com/challenges/similar-strings)| Java |  | | Advanced | 85| ||

|   | [Save Humanity](https://www.hackerrank.com/challenges/save-humanity)| Java |  | | Expert | 100| ||

|   | [Find Strings](https://www.hackerrank.com/challenges/find-strings)| Java |  | | Expert | 100| ||

|   | [Palindromic Border](https://www.hackerrank.com/challenges/palindromic-border)| Java |  | | Expert | 100| ||

|   | [Two Two](https://www.hackerrank.com/challenges/two-two)| Java |  | | Advanced | 150| ||

|   | [Two Strings Game](https://www.hackerrank.com/challenges/two-strings-game)| Java |  | | Expert | 100| ||

|   | [Letter Islands](https://www.hackerrank.com/challenges/letter-islands)| Java |  | | Expert | 100| ||

|   | [Pseudo-Isomorphic Substrings](https://www.hackerrank.com/challenges/pseudo-isomorphic-substrings)| Java |  | | Expert | 100| ||

|   | [How Many Substrings?](https://www.hackerrank.com/challenges/how-many-substrings)| Java
 |  | | Expert | 100| ||

### Sorting

| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note

-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----

|   | [Intro to Tutorial Challenges](https://www.hackerrank.com/challenges/tutorial-intro)| 


[Java](./Algorithms/Sorting/Intro%20to%20Tutorial%20Challenges/Solution.java)

[C#](./Algorithms/Sorting/Intro%20to%20Tutorial%20Challenges/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 30| ||

|   | [Insertion Sort - Part 1](https://www.hackerrank.com/challenges/insertionsort1)| 

[Java](./Algorithms/Sorting/Insertion%20Sort%20-%20Part%201/Solution.java)

[C#](./Algorithms/Sorting/Insertion%20Sort%20-%20Part%201/Solution.cs)

 | _O(n)_ | _O(1)_ | Easy | 30 | ||

|   | [Insertion Sort - Part 2](https://www.hackerrank.com/challenges/insertionsort2)| 

[Java](./Algorithms/Sorting/Insertion%20Sort%20-%20Part%202/Solution.java)

[C#](./Algorithms/Sorting/Insertion%20Sort%20-%20Part%202/Solution.cs)

 | _O(n^2)_ | _O(1)_ | Easy | 30 | ||

|   | [Correctness and the Loop Invariant](https://www.hackerrank.com/challenges/correctness-invariant)| 

[Java](./Algorithms/Sorting/Correctness%20and%20the%20Loop%20Invariant/Solution.java)

[C#](./Algorithms/Sorting/Correctness%20and%20the%20Loop%20Invariant/Solution.cs)

 | _O(n^2)_ | _O(1)_ | Easy | 30 | ||

|   | [Running Time of Algorithms](https://www.hackerrank.com/challenges/runningtime)| 

[Java](./Algorithms/Sorting/Running%20Time%20of%20Algorithms/Solution.java)

[C#](./Algorithms/Sorting/Running%20Time%20of%20Algorithms/Solution.cs)

 | _O(n^2)_ | _O(1)_ | Easy | 30 | ||

|   | [Quicksort 1 - Partition](https://www.hackerrank.com/challenges/quicksort1)| 

[Java](./Algorithms/Sorting/Quicksort%201%20-%20Partition/Solution.java)

[C#](./Algorithms/Sorting/Quicksort%201%20-%20Partition/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 10| ||

|   | [Quicksort 2 - Sorting](https://www.hackerrank.com/challenges/quicksort2)| 

[Java](./Algorithms/Sorting/Quicksort%202%20-%20Sorting/Solution.java)

[C#](./Algorithms/Sorting/Quicksort%202%20-%20Sorting/Solution.cs)

 | _O(n^2)_ | _O(n)_ | Easy | 30| ||

|   | [Quicksort In-Place](https://www.hackerrank.com/challenges/quicksort3)| 

[Java](./Algorithms/Sorting/Quicksort%20In-Place/Solution.java)

 | _O(n^2)_ | _O(log(n))_ | Medium| 35| ||

|   | [Running Time of Quicksort](https://www.hackerrank.com/challenges/quicksort4)| 

[Java](./Algorithms/Sorting/Running%20Time%20of%20Quicksort/Solution.java)

 | _O(n log(n))_ | _O(log(n))_ | Easy | 35| ||

|   | [Counting Sort 1](https://www.hackerrank.com/challenges/countingsort1)| 

[Java](./Algorithms/Sorting/Counting%20Sort%201/Solution.java)

[C#](./Algorithms/Sorting/Counting%20Sort%201/Solution.cs)

 | _O(n+k)_ | _O(k)_ | Easy | 30| value of k in this problem is 100  ||

|   | [Counting Sort 2](https://www.hackerrank.com/challenges/countingsort2)| 

[Java](./Algorithms/Sorting/Counting%20Sort%202/Solution.java)

[C#](./Algorithms/Sorting/Counting%20Sort%202/Solution.cs)

 | _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)| 

[Java](./Algorithms/Sorting/Counting%20Sort%203/Solution.java)

 | _O(n+k)_ | _O(k)_ | Easy | 30| ||

|   | [The Full Counting Sort](https://www.hackerrank.com/challenges/countingsort4)| 

[Java](./Algorithms/Sorting/The%20Full%20Counting%20Sort/Solution.java)

[C#](./Algorithms/Sorting/The%20Full%20Counting%20Sort/Solution.cs)

 | _O(n+k)_ | _O(n+k)_ | Medium | 40| ||

|   | [Closest Numbers](https://www.hackerrank.com/challenges/closest-numbers)| 

[Java](./Algorithms/Sorting/Closest%20Numbers/Solution.java)

[C#](./Algorithms/Sorting/Closest%20Numbers/Solution.cs)

 | _O(n log(n))_ | _O(n)_ | Easy | 35| ||

|   | [Find the Median](https://www.hackerrank.com/challenges/find-the-median)| 

[Java](./Algorithms/Sorting/Find%20the%20Median/Solution.java)

[C#](./Algorithms/Sorting/Find%20the%20Median/Solution.cs)

 | _O(n log(n))_ | _O(n)_ | Easy | 35| ||

|   | [Insertion Sort Advanced Analysis](https://www.hackerrank.com/challenges/insertion-sort)| Java |  | | Advanced | 50| ||

|   | [Fraudulent Activity Notifications](https://www.hackerrank.com/challenges/fraudulent-activity-notifications)| 

[Java](./Algorithms/Sorting/Fraudulent%20Activity%20Notifications/Solution.java)

 | _O(n^2)_ | _O(n)_ | Medium | 40| ||

|   | [Lily's Homework](https://www.hackerrank.com/challenges/lilys-homework)| 

[Java](./Algorithms/Sorting/Lily's%20Homework/Solution.java)

 | _O(n log(n))_ | _O(n)_  | Medium | 40| ||

|   | [Big Sorting](https://www.hackerrank.com/challenges/big-sorting)| 

[Java](./Algorithms/Sorting/Big%20Sorting/Solution.java)

[C#](./Algorithms/Sorting/Big%20Sorting/Solution.cs)

 | _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)| 


[JS](./Algorithms/Search/Hackerland%20Radio%20Transmitters/Solution.js)

[C#](./Algorithms/Search/Hackerland%20Radio%20Transmitters/Solution.cs)

 | _O(n log(n))_ | _O(n)_ | Medium | 25 | ||

|   | [Ice Cream Parlor](https://www.hackerrank.com/challenges/icecream-parlor)| 

[Java](./Algorithms/Search/Ice%20Cream%20Parlor/Solution.java)

[C#](./Algorithms/Search/Ice%20Cream%20Parlor/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 30 | ||

|   | [Binary Search: Ice Cream Parlor](https://www.hackerrank.com/challenges/ctci-ice-cream-parlor)| 

[Java](./Algorithms/Search/Binary%20Search%20Ice%20Cream%20Parlor/Solution.java)

 | _O(n)_ | _O(n)_ | Easy | 35 | ||

|   | [Gridland Metro](https://www.hackerrank.com/challenges/gridland-metro)| 

Java

[C#](./Algorithms/Search/Gridland%20Metro/Solution.cs)

 |  _O(k)_ | _O(k)_ | Medium | 25 | k = number of tracks ||

|   | [Missing Numbers](https://www.hackerrank.com/challenges/missing-numbers)| 

Java
 [C++](./Algorithms/Search/Missing%20Numbers/Solution.cpp)

[C#](./Algorithms/Search/Missing%20Numbers/Solution.cs)

 | _O(n)_ | _O(n)_ | Easy | 45 | ||

|   | [Minimum Loss](https://www.hackerrank.com/challenges/minimum-loss)| 

[Java](./Algorithms/Search/Minimum%20Loss/Solution.java)

 | _O(n log(n))_ | _O(n)_ | Medium | 35| ||

|   | [KnightL on a Chessboard](https://www.hackerrank.com/challenges/knightl-on-chessboard)| Java |  | | Medium | 35 | ||

|   | [Pairs](https://www.hackerrank.com/challenges/pairs)| 

Java
 [C++](./Algorithms/Search/Pairs/Solution.cpp)

[C#](./Algorithms/Search/Pairs/Solution.cs)

 | _O(n log(n))_ | _O(n)_ | Medium | 50 | ||

|   | [Sherlock and Array](https://www.hackerrank.com/challenges/sherlock-and-array)| 

Java
 [C++](./Algorithms/Search/SherlockandArray/Solution.cpp)

[C#](./Algorithms/Search/SherlockandArray/Solution.cs)

 | _O(n)_ | _O(n)_| Easy | 40 | ||

|   | [Maximum Subarray Sum](https://www.hackerrank.com/challenges/maximum-subarray-sum)| Java |  | | Hard | 65 | ||

|   | [Connected Cells in a grid](https://www.hackerrank.com/challenges/connected-cell-in-a-grid)| Java |  | | Medium | 50 | ||

|   | [Short Palindrome](https://www.hackerrank.com/challenges/short-palindrome)| Java |  | | Medium | 40 | ||

|   | [Maximizing Mission Points](https://www.hackerrank.com/challenges/maximizing-mission-points)| Java |  | | Hard | 70 | ||

|   | [Count Luck](https://www.hackerrank.com/challenges/count-luck)| Java |  | | Medium | 50 | ||

|   | [Cut the Tree](https://www.hackerrank.com/challenges/cut-the-tree)| Java |  | | Medium | 50 | ||

|   | [Making Candies](https://www.hackerrank.com/challenges/making-candies)| Java |  | | Hard | 45 | ||

|   | [Gena Playing Hanoi](https://www.hackerrank.com/challenges/gena)| Java |  | | Medium | 50 | ||

|   | [Beautiful Quadruples](https://www.hackerrank.com/challenges/xor-quadruples)| Java |  | | Medium | 50 | ||

|   | [Bike Racers](https://www.hackerrank.com/challenges/bike-racers)| Java |  | | Hard | 65 | ||

|   | [Task Scheduling](https://www.hackerrank.com/challenges/task-scheduling)| Java |  | | Advanced | 70 | ||

|   | [Similar Pair](https://www.hackerrank.com/challenges/similarpair)| Java |  | | Advanced | 70 | ||

|   | [Absolute Element Sums](https://www.hackerrank.com/challenges/playing-with-numbers)| Java |  | | Hard | 70 | ||

|   | [Sorted Subsegments](https://www.hackerrank.com/challenges/sorted-subsegments)| Java |  | | Hard | 80 | ||

|   | [Distant Pairs](https://www.hackerrank.com/challenges/distant-pairs)| Java |  | | Expert | 80 | ||

|   | [King Richard's Knights](https://www.hackerrank.com/challenges/king-richards-knights)| Java
 |  | | Hard | 80 | ||

### Graph Theory

| #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Points          | Note

-----|---------------- |:---------------:| --------------- | --------------- |:-------------:|:--------------:| -----

|   | [Roads and Libraries](https://www.hackerrank.com/challenges/torque-and-development)| 
Java |  | | Medium | 30| ||

|   | [Synchronous Shopping](https://www.hackerrank.com/challenges/synchronous-shopping)| Java |  | | Medium | 40 | ||

|   | [Crab Graphs](https://www.hackerrank.com/challenges/crab-graphs)| Java |  | | Medium | 50 | ||

|   | [Even Tree](https://www.hackerrank.com/challenges/even-tree)| Java |  | | Medium | 50 | ||

|   | [Snakes and Ladders: The Quickest Way Up](https://www.hackerrank.com/challenges/the-quickest-way-up)| Java |  | | Medium | 50 | ||

|   | [Subset Component](https://www.hackerrank.com/challenges/subset-component)| Java |  | | Hard | 50 | ||

|  |[Journey to the Moon](https://www.hackerrank.com/challenges/journey-to-the-moon)| 

[Java](./Algorithms/Graph%20Theory/Journey%20to%20the%20Moon/Solution.java)
 [Python3](./Algorithms/Graph%20Theory/Journey%20to%20the%20Moon/solution.py3)

 | _O(n + i)_ | _O(n)_| Medium | 50 | ||

|   | [Kruskal (MST): Really Special Subtree](https://www.hackerrank.com/challenges/kruskalmstrsub)| Java |  | | Hard | 50 | ||

|   | [Minimum Penalty Path](https://www.hackerrank.com/challenges/beautiful-path)| Java |  | | Medium | 50 | ||

|   | [Demanding Money](https://www.hackerrank.com/challenges/borrowing-money)| Java |  | | Hard | 50 | ||

|   | [The Story of a Tree](https://www.hackerrank.com/challenges/the-story-of-a-tree)| Java |  | | Medium | 50 | ||

|   | [Breadth First Search: Shortest Reach](https://www.hackerrank.com/challenges/bfsshortreach)| Java |  | | Medium | 55 | ||

|   | [The Value of Friendship](https://www.hackerrank.com/challenges/value-of-friendship)| Java |  | | Hard | 55 | ||

|   | [Clique](https://www.hackerrank.com/challenges/clique)| Java |  | | Medium | 60 | ||

|   | [Dijkstra: Shortest Reach 2](https://www.hackerrank.com/challenges/dijkstrashortreach)| Java |  | | Hard | 60 | ||

|   | [Prim's (MST) : Special Subtree](https://www.hackerrank.com/challenges/primsmstsub)| Java |  | | Medium | 60 | ||

|   | [Roads in Hackerland](https://www.hackerrank.com/challenges/johnland)| Java |  | | Medium | 60 | ||

|   | [Toll Cost Digits](https://www.hackerrank.com/challenges/toll-cost-digits)| Java |  | | Hard | 60 | ||

|   | [Real Estate Broker](https://www.hackerrank.com/challenges/real-estate-broker)| Java |  | | Hard | 60 | ||

|   | [Matrix](https://www.hackerrank.com/challenges/matrix)| Java |  | | Hard | 70 | ||

|   | [Bead Ornaments](https://www.hackerrank.com/challenges/beadornaments)| Java |  | | Advanced | 70 | ||

|   | [Rust & Murderer](https://www.hackerrank.com/challenges/mark-and-toys)| 

[Java](./Algorithms/Graph%20Theory/Rust%20&%20Murderer/Solution.java)

 | _O(n+m)_ | _O(n)_| Medium | 70 | ||

|   | [Recording Episodes](https://www.hackerrank.com/challenges/episode-recording)| Java |  | | Hard | 70 | ||

|   | [Kingdom Connectivity](https://www.hackerrank.com/challenges/kingdom-connectivity)| Java |  | | Hard | 75 | ||

|   | [Journey Scheduling](https://www.hackerrank.com/challenges/journey-scheduling)| Java |  | | Hard | 75 | ||

|   | [Floyd : City of Blinding Lights](https://www.hackerrank.com/challenges/floyd-city-of-blinding-lights)| Java |  | | Hard | 75 | ||

|   | [Find the Path](https://www.hackerrank.com/challenges/shortest-path)| Java |  | | Hard | 75 | ||

|   | [Repair Roads](https://www.hackerrank.com/challenges/repair-roads)| Java |  | | Hard | 80 | ||

|   | [Problem solving](https://www.hackerrank.com/challenges/problem-solving)| Java |  | | Hard | 80 | ||

|   | [Computer Game](https://www.hackerrank.com/challenges/computer-game)| Java |  | | Hard | 80 | ||

|   | [Jack goes to Rapture](https://www.hackerrank.com/challenges/jack-goes-to-rapture)| Java |  | | Medium | 80 | ||

|   | [Jim and his LAN Party](https://www.hackerrank.com/challenges/jim-and-his-lan-party)| Java |  | | Hard | 80 | ||

|   | [Jeanie's Route](https://www.hackerrank.com/challenges/jeanies-route)| Java |  | | Medium | 80 | ||

|   | [Travel in HackerLand](https://www.hackerrank.com/challenges/travel-in-hackerland)| Java |  | | Hard | 80 | ||

|   | [Jogging Cats](https://www.hackerrank.com/challenges/cat-jogging)| Java |  | | Advanced | 80 | ||

|   | [Tree Flow](https://www.hackerrank.com/challenges/tree-flow)| Java |  | | Hard | 80 | ||

|   | [Tripartite Matching](https://www.hackerrank.com/challenges/tripartite-matching)| Java |  | | Hard | 80 | ||

|   | [Jumping Rooks](https://www.hackerrank.com/challenges/jumping-rooks)| Java |  | | Advanced | 80 | ||

|   | [Minimum MST Graph](https://www.hackerrank.com/challenges/minimum-mst-graph)| Java |  | | Expert | 80 | ||

|   | [Coprime Paths](https://www.hackerrank.com/challenges/coprime-paths)| Java |  | | Expert | 80 | ||

|   | [DAG Queries](https://www.hackerrank.com/challenges/dag-queries)| Java |  | | Expert | 80 | ||

|   | [Liars](https://www.hackerrank.com/challenges/liars)| Java |  | | Advanced | 85 | ||

|   | [ByteLandianTours](https://www.hackerrank.com/challenges/bytelandian-tours)| Java |  | | Hard | 90 | ||

|   | [Kth Ancestor](https://www.hackerrank.com/challenges/kth-ancestor)| Java |  | | Hard | 90 | ||

|   | [Drive](https://www.hackerrank.com/challenges/drive)| Java |  | | Expert | 90 | ||

|   | [Road Network](https://www.hackerrank.com/challenges/road-network)| Java |  | | Expert | 90 | ||

|   | [Savita And Friends](https://www.hackerrank.com/challenges/savita-and-friends)| Java |  | | Hard | 90 | ||

|   | [Favorite sequence](https://www.hackerrank.com/challenges/favourite-sequence)| Java |  | | Advanced | 95 | ||

|   | [Quadrant Queries](https://www.hackerrank.com/challenges/quadrant-queries)| Java |  | | Advanced | 100 | ||

|   | [Going to the Office](https://www.hackerrank.com/challenges/going-office)| Java |  | | Expert | 100 | ||

|   | [Ticket](https://www.hackerrank.com/challenges/ticket)| Java |  | | Expert | 100 | ||

|   | [HackerX](https://www.hackerrank.com/challenges/missile-defend)| Java |  | | Hard | 100 | ||

|   | [Hacker Country](https://www.hackerrank.com/challenges/hacker-country)| Java |  | | Hard | 100 | ||

|   | [Travelling Salesman in a Grid](https://www.hackerrank.com/challenges/tsp-grid)| Java |  | | Expert | 100 | ||

|   | [Huarongdao](https://www.hackerrank.com/challenges/huarongdao)| Java |  | | Expert | 100 | ||

|   | [Vertical Paths](https://www.hackerrank.com/challenges/vertical-paths)| Java |  | | Expert | 100 | ||

|   | [DFS Edges](https://www.hackerrank.com/challenges/dfs-edges)| Java |  | | Expert | 100 | ||

|   | [Tree Splitting](https://www.hackerrank.com/challenges/tree-splitting)| Java |  | | Advanced | 100 | ||

|   | [Definite Random Walks](https://www.hackerrank.com/challenges/definite-random-walks)| Java |  | | Expert | 100 | ||

|   | [Diameter Minimization](https://www.hackerrank.com/challenges/diameter-minimization)| Java |  | | Expert | 100 | ||

|   | [Training the army](https://www.hackerrank.com/challenges/training-the-army)| Java |  | | Hard | 120 | ||

|   | [Alex vs Fedor](https://www.hackerrank.com/challenges/alex-vs-fedor)| Java
 |  | | 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)| 


[Java](./Algorithms/Greedy/Minimum%20Absolute%20Difference%20in%20an%20Array/Solution.java)
 [JS](./Algorithms/Greedy/Minimum%20Absolute%20Difference%20in%20an%20Array/Solution.js)

[C#](./Algorithms/Greedy/Minimum%20Absolute%20Difference%20in%20an%20Array/Solution.cs)

 | _O(n log(n))_ | _O(n)_ | Easy | 15| ||

|  |[Chief Hopper](https://www.hackerrank.com/challenges/chief-hopper)|