compsci_guides
compsci_guides copied to clipboard
codepath
Guides focused on fundamental computer science concepts
Hey there, I noticed that the Similar Questions section on this [page](https://github.com/codepath/compsci_guides/wiki/Symmetric-Tree) links inaccurately to the corresponding Leetcode problem. Same Trees problem links to Minimum Depth of Binary Tree problem....
Hello, I've noticed an issue in the Heap Deletion section of the documentation. In step 3 of the "Deleting from this heap" process, the text references nodes 6 and 7,...
Cannot view Two Pointer via the wiki or the code path website.
In System Design [Introduction to System Design](https://guides.codepath.com/compsci/Introduction-to-System-Design) link is not working
Hi, In the Majority Elements Walkthrough, the bonus portion refers to "boyer-miller majority voting algorithm" but the correct algorithm is "Boyer-Moore Majority Voting" 
### The LinkedList guide is missing runtime and memory complexity details for various programming techniques, including: Two pointer technique Dummy node technique Multi-pass technique **The Heap markdown file does not...
Line 5 of the code says to append(threshold) but it should be append(num)
Hi, The test case 2 is: print(min_swaps("]]][[[")) The answer should be 3 but provided 2.
https://github.com/codepath/compsci_guides/wiki/Marking-the-Event-Timeline This is a solution, I was able to come up with that actually worked using the BFS approach mentioned but the time complexity is kind of busted. ``` def...
https://github.com/codepath/compsci_guides/wiki/Minimum-Changes-to-Make-Schedule-Balanced Better solution is understanding about stack but using a integer variable to simulate the stack because in this case we can have constant space complexity instead linear space complexity....