Here are some HackerRank problems and my solutions.
Feel free to ask any questions or make suggestions!
HackerRank assigns their problems a difficulty rating (Easy, Medium, Hard, Expert, Advanced). The assigned difficulty rating does not necessarily match how difficult programming the solution is. Some of the "medium" problems take 15 minutes to solve, and others take over an hour understanding their related problem space (such as the longest common subsequence problem).
-
Binary Search Tree: Lowest Common Ancestor (Easy) Problem | Solution
-
Trees: Is This a Binary Search Tree? (Medium) Problem | Solution
-
Insert a node at a specific position in a linked list (Easy) Problem | Solution
-
Inserting a Node Into a Sorted Doubly Linked List (Easy) Problem | Solution
- First Non-Duplicate Solution
Feel free to create a GitHub Issue or PR.
This project uses the Google Style Guide here.