Coderust 3.0: Faster Coding Interview Preparation
Want to land a software engineering job in the tech industry? Coderust 3.0 is here to help.
The course walks you through 80+ example problems and their solutions with step by step visualizations – so that you are actually learning instead of blindly memorizing solutions.
All the solutions can be run in the browser, and you can modify your code on the fly to test different approaches. Solutions are available in Python, C++, Java, JavaScript, and Ruby.
Coderust 3.0: Faster Coding Interview Preparation
BINARY SEARCHPREVIEW
Find Maximum in Sliding Window
Find smallest common number
Coderust 3.0: Faster Coding Interview Preparation
Rotate Array
Find maximum single sell profit
Merge Overlapping Intervals
Coderust 3.0: Faster Coding Interview Preparation
Reverse a singly linked listPreview
Remove Duplicates from a Linked List
Delete node with a given key
Insertion Sort of a Linked List
Intersection Point of Two ListsPreview
Merge Two Sorted Linked Lists
Copy linked list with arbitrary pointer
Find kth permutationPreview
Reverse words in a sentencePreview
Find all palindrome substrings
Coderust 3.0: Faster Coding Interview Preparation
Check if two binary trees are identicalPreview
Write an In-Order Iterator for a Binary Tree
Iterative Inorder Traversal
Level Order Traversal of Binary Tree
Convert Binary Tree To Doubly Linked List
Connect Same Level Siblings
Serialize/Deserialize Binary Tree
Inorder Successor BST with parent pointers
Delete zero sum sub-trees
N-ary Tree to Binary Tree
6
STACKS AND QUEUES
Stack using QueuesPreview
Clone a Directed GraphPreview
MaxSum Subsequence – Nonadjacent Elements
Game Scoring: Find number of ways a player can score ‘n’ runs
Sum of Three ValuesPreview
Make Columns and Rows Zeros
Frequently Asked Questions
7 reviews for Coderust 3.0: Faster Coding Interview Preparation – Educative
There are no reviews yet.