Skip to content

Commit

Permalink
Fixed URLs
Browse files Browse the repository at this point in the history
  • Loading branch information
@RodneyShag
RodneyShag committed Jul 27, 2018
1 parent 9d997f9 commit 0d0ee97
Show file tree
Hide file tree
Showing 10 changed files with 640 additions and 640 deletions.
54 changes: 27 additions & 27 deletions 10 Days of Statistics/readme.md
View file

Large diffs are not rendered by default.

56 changes: 28 additions & 28 deletions 30 Days of Code/readme.md
View file

Large diffs are not rendered by default.

80 changes: 40 additions & 40 deletions Algorithms/readme.md
View file

Large diffs are not rendered by default.

40 changes: 20 additions & 20 deletions Cracking the Coding Interview/readme.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2,23 +2,23 @@

| Topic | Challenge | Points | Solution |
|:---------------------:|:--------------------------------------------------------------------------------------------------------:|:------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|
| Techniques / Concepts | [Time Complexity: Primality](https://www.hackerrank.com/challenges/ctci-big-o) | 15 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/Time%20Complexity%20-%20Primality/Solution.java) |
| Techniques / Concepts | [Recursion: Fibonacci Numbers](https://www.hackerrank.com/challenges/ctci-fibonacci-numbers) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/Recursion%20-%20Fibonacci%20Numbers/Solution.java) |
| Techniques / Concepts | [Recursion: Davis' Staircase](https://www.hackerrank.com/challenges/ctci-recursive-staircase) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/Recursion%20-%20Davis'%20Staircase/Solution.java) |
| Techniques / Concepts | [DP: Coin Change](https://www.hackerrank.com/challenges/ctci-coin-change) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/DP%20-%20Coin%20Change/Solution.java) |
| Techniques / Concepts | [Bit Manipulation: Lonely Integer](https://www.hackerrank.com/challenges/ctci-lonely-integer) | 60 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/Bit%20Manipulation%20-%20Lonely%20Integer/Solution.java) |
| Data Structures | [Arrays: Left Rotation](https://www.hackerrank.com/challenges/ctci-array-left-rotation) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Arrays%20-%20Left%20Rotation/Solution.java) |
| Data Structures | [Strings: Making Anagrams](https://www.hackerrank.com/challenges/ctci-making-anagrams) | 25 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Strings%20-%20Making%20Anagrams/Solution.java) |
| Data Structures | [Hash Tables: Ransom Note](https://www.hackerrank.com/challenges/ctci-ransom-note) | 25 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Hash%20Tables%20-%20Ransom%20Note/Solution.java) |
| Data Structures | [Linked Lists: Detect a Cycle](https://www.hackerrank.com/challenges/ctci-linked-list-cycle) | 25 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Linked%20Lists%20-%20Detect%20a%20Cycle/Solution.java) |
| Data Structures | [Stacks: Balanced Brackets](https://www.hackerrank.com/challenges/ctci-balanced-brackets) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Stacks%20-%20Balanced%20Brackets/Solution.java) |
| Data Structures | [Queues: A Tale of Two Stacks](https://www.hackerrank.com/challenges/ctci-queue-using-two-stacks) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Queue%20-%20A%20Tale%20of%20Two%20Stacks/Solution.java) |
| Data Structures | [Trees: Is This a Binary Search Tree?](https://www.hackerrank.com/challenges/ctci-is-binary-search-tree) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Trees%20-%20Is%20This%20a%20Binary%20Search%20Tree/Solution.java) |
| Data Structures | [Heaps: Find the Running Median](https://www.hackerrank.com/challenges/ctci-find-the-running-median) | 50 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Heaps%20-%20Find%20the%20Running%20Median/Solution.java) |
| Data Structures | [Tries: Contacts](https://www.hackerrank.com/challenges/ctci-contacts) | 50 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Tries%20-%20Contacts/Solution.java) |
| Algorithms | [Sorting: Bubble Sort](https://www.hackerrank.com/challenges/ctci-bubble-sort) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/Sorting%20-%20Bubble%20Sort/Solution.java) |
| Algorithms | [Sorting: Comparator](https://www.hackerrank.com/challenges/ctci-comparator-sorting) | 35 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/Sorting%20-%20Comparator/Solution.java) |
| Algorithms | [Merge Sort: Counting Inversions](https://www.hackerrank.com/challenges/ctci-merge-sort) | 35 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/Merge%20Sort%20-%20Counting%20Inversions/Solution.java) |
| Algorithms | [Binary Search: Ice Cream Parlor](https://www.hackerrank.com/challenges/ctci-ice-cream-parlor) | 45 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/Binary%20Search%20-%20Ice%20Cream%20Parlor/Solution.java) |
| Algorithms | [DFS: Connected Cell in a Grid](https://www.hackerrank.com/challenges/ctci-connected-cell-in-a-grid) | 45 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/DFS%20-%20Connected%20Cell%20in%20a%20Grid/Solution.java) |
| Algorithms | [BFS: Shortest Reach in a Graph](https://www.hackerrank.com/challenges/ctci-bfs-shortest-reach) | 45 | [Solution.java](https://github.com/RodneyShag/HackerRank-solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/BFS%20-%20Shortest%20Reach%20in%20a%20Graph/Solution.java) |
| Techniques / Concepts | [Time Complexity: Primality](https://www.hackerrank.com/challenges/ctci-big-o) | 15 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/Time%20Complexity%20-%20Primality/Solution.java) |
| Techniques / Concepts | [Recursion: Fibonacci Numbers](https://www.hackerrank.com/challenges/ctci-fibonacci-numbers) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/Recursion%20-%20Fibonacci%20Numbers/Solution.java) |
| Techniques / Concepts | [Recursion: Davis' Staircase](https://www.hackerrank.com/challenges/ctci-recursive-staircase) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/Recursion%20-%20Davis'%20Staircase/Solution.java) |
| Techniques / Concepts | [DP: Coin Change](https://www.hackerrank.com/challenges/ctci-coin-change) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/DP%20-%20Coin%20Change/Solution.java) |
| Techniques / Concepts | [Bit Manipulation: Lonely Integer](https://www.hackerrank.com/challenges/ctci-lonely-integer) | 60 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Techniques%2C%20Concepts/Bit%20Manipulation%20-%20Lonely%20Integer/Solution.java) |
| Data Structures | [Arrays: Left Rotation](https://www.hackerrank.com/challenges/ctci-array-left-rotation) | 20 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Arrays%20-%20Left%20Rotation/Solution.java) |
| Data Structures | [Strings: Making Anagrams](https://www.hackerrank.com/challenges/ctci-making-anagrams) | 25 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Strings%20-%20Making%20Anagrams/Solution.java) |
| Data Structures | [Hash Tables: Ransom Note](https://www.hackerrank.com/challenges/ctci-ransom-note) | 25 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Hash%20Tables%20-%20Ransom%20Note/Solution.java) |
| Data Structures | [Linked Lists: Detect a Cycle](https://www.hackerrank.com/challenges/ctci-linked-list-cycle) | 25 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Linked%20Lists%20-%20Detect%20a%20Cycle/Solution.java) |
| Data Structures | [Stacks: Balanced Brackets](https://www.hackerrank.com/challenges/ctci-balanced-brackets) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Stacks%20-%20Balanced%20Brackets/Solution.java) |
| Data Structures | [Queues: A Tale of Two Stacks](https://www.hackerrank.com/challenges/ctci-queue-using-two-stacks) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Queue%20-%20A%20Tale%20of%20Two%20Stacks/Solution.java) |
| Data Structures | [Trees: Is This a Binary Search Tree?](https://www.hackerrank.com/challenges/ctci-is-binary-search-tree) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Trees%20-%20Is%20This%20a%20Binary%20Search%20Tree/Solution.java) |
| Data Structures | [Heaps: Find the Running Median](https://www.hackerrank.com/challenges/ctci-find-the-running-median) | 50 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Heaps%20-%20Find%20the%20Running%20Median/Solution.java) |
| Data Structures | [Tries: Contacts](https://www.hackerrank.com/challenges/ctci-contacts) | 50 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Data%20Structures/Tries%20-%20Contacts/Solution.java) |
| Algorithms | [Sorting: Bubble Sort](https://www.hackerrank.com/challenges/ctci-bubble-sort) | 30 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/Sorting%20-%20Bubble%20Sort/Solution.java) |
| Algorithms | [Sorting: Comparator](https://www.hackerrank.com/challenges/ctci-comparator-sorting) | 35 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/Sorting%20-%20Comparator/Solution.java) |
| Algorithms | [Merge Sort: Counting Inversions](https://www.hackerrank.com/challenges/ctci-merge-sort) | 35 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/Merge%20Sort%20-%20Counting%20Inversions/Solution.java) |
| Algorithms | [Binary Search: Ice Cream Parlor](https://www.hackerrank.com/challenges/ctci-ice-cream-parlor) | 45 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/Binary%20Search%20-%20Ice%20Cream%20Parlor/Solution.java) |
| Algorithms | [DFS: Connected Cell in a Grid](https://www.hackerrank.com/challenges/ctci-connected-cell-in-a-grid) | 45 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/DFS%20-%20Connected%20Cell%20in%20a%20Grid/Solution.java) |
| Algorithms | [BFS: Shortest Reach in a Graph](https://www.hackerrank.com/challenges/ctci-bfs-shortest-reach) | 45 | [Solution.java](https://github.com/RodneyShag/HackerRank_solutions/blob/master/Cracking%20the%20Coding%20Interview/Algorithms/BFS%20-%20Shortest%20Reach%20in%20a%20Graph/Solution.java) |
Loading

0 comments on commit 0d0ee97

Please sign in to comment.