https://github.com/kylemit/code-challenges

Code Challenge Solutions
https://github.com/kylemit/code-challenges

algorithms data-structures hackerrank hackerrank-solutions leetcode leetcode-solutions

Last synced: 9 days ago
JSON representation

Code Challenge Solutions

• Host: GitHub
• URL: https://github.com/kylemit/code-challenges
• Owner: KyleMit
• License: mit
• Created: 2021-10-21T23:37:43.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2022-12-02T00:51:03.000Z (almost 2 years ago)
• Last Synced: 2024-10-13T14:03:55.929Z (24 days ago)
• Topics: algorithms, data-structures, hackerrank, hackerrank-solutions, leetcode, leetcode-solutions
• Language: TypeScript
• Homepage:
• Size: 445 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Code Challenges

* [LeetCode / KyleMit](https://leetcode.com/KyleMit/)

* [HackerRank / KyleMit](www.hackerrank.com/kylemit)

## Leet Code

* [Data Structure Course](https://leetcode.com/study-plan/data-structure/)

* [Algorithm Course](https://leetcode.com/study-plan/algorithm/)

## Hacker Rank

### Data Structures

* [x] Arrays

* [ ] Linked Lists

* [ ] Trees

* [ ] Balanced Trees

* [ ] Stacks

* [ ] Queues

* [ ] Heap

* [ ] Disjoint Set

* [ ] Multiple Choice

* [ ] Trie

* [ ] Advanced

### Algorithms

* [ ] Warmup

* [ ] Implementation

* [ ] Strings

* [ ] Sorting

* [ ] Search

* [ ] Graph Theory

* [ ] Greedy

* [ ] Dynamic Programming

* [ ] Constructive Algorithms

* [ ] Bit Manipulation

* [ ] Recursion

* [ ] Game Theory

* [ ] NP Complete

* [ ] Debugging

### SQL

* [ ] Basic Select

* [ ] Advanced Select

* [ ] Aggregation

* [ ] Basic Join

* [ ] Advanced Join

* [ ] Alternative Queries

## Prior Art

* [marinskiy/HackerrankPractice](https://github.com/marinskiy/HackerrankPractice)

## Resources

* Wikipedia

  * [Dynamic programming](https://en.wikipedia.org/wiki/Dynamic_programming)

  * [Sentinel value](https://en.wikipedia.org/wiki/Sentinel_value)

  * [Dijkstra's algorithm](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)

  * [Graph traversal](https://en.wikipedia.org/wiki/Graph_traversal)

  * [Binary tree](https://en.wikipedia.org/wiki/Binary_tree)

  * [Binary search tree](https://en.wikipedia.org/wiki/Binary_search_tree)

  * [Binary heap](https://en.wikipedia.org/wiki/Binary_heap)

  * [Min-max heap](https://en.wikipedia.org/wiki/Min-max_heap)

  * [Priority queue](https://en.wikipedia.org/wiki/Priority_queue)

  * [Tree traversal](https://en.wikipedia.org/wiki/Tree_traversal)

  * [Trie (Prefix Tree)](https://en.wikipedia.org/wiki/Trie)

  * [Lowest common ancestor (LCA)](https://en.wikipedia.org/wiki/Lowest_common_ancestor)

  * [Lexicographic order](https://en.wikipedia.org/wiki/Lexicographic_order)

* Geeks for Geeks

  * [Tree Traversals (Inorder, Preorder and Postorder)](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder)

  * [Min Heap in Java](https://www.geeksforgeeks.org/min-heap-in-java/)