Educative – Coderust 3.0: Faster Coding Interview Preparation
This product will available in 2-3 weeks later after you pay. Also
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. Also
Coderust 3.0: Faster Coding Interview Preparation
BINARY SEARCHPREVIEW
Find Maximum in Sliding Window Also
Search rotated array
Find smallest common number Also
Coderust 3.0: Faster Coding Interview Preparation
Rotate Array Also
Find low/high index
Move zeros to left Also
Find maximum single sell profit
Implement Quicksort
Merge Overlapping Intervals Also
Sum of Two ValuesPreview
2
LINKED LIST
Coderust 3.0: Faster Coding Interview Preparation Also
Reverse a singly linked listPreview
Remove Duplicates from a Linked List
Delete node with a given key Also
Insertion Sort of a Linked List
Intersection Point of Two ListsPreview
Nth from last node
Swap Nth Node with Head Also
Merge Two Sorted Linked Lists
Merge Sort
Reverse even nodes Also
Rotate a Linked List
Reverse k Elements
Add Two Integers Also
Copy linked list with arbitrary pointer
3
MATH & STATS
Find kth permutationPreview Also
Integer Division
Pythagorean Triplets
All Sum Combinations Also
Find Missing Number
Permute String
All Subsets Also
Is Number Valid?
Power of a Number
Calculate Square Root Also
4
STRING
Reverse words in a sentencePreview
Remove Duplicates Also
Remove white spaces
String Segmentation
XML to Tree Also
Find all palindrome substrings
Regular Expression Also
5
TREES
Coderust 3.0: Faster Coding Interview Preparation Also
Check if two binary trees are identicalPreview
Write an In-Order Iterator for a Binary Tree
Iterative Inorder Traversal Also
Inorder Successor BST
Level Order Traversal of Binary Tree
Is Binary Search Tree? Also
Convert Binary Tree To Doubly Linked List
Print Tree Perimeter
Connect Same Level Siblings Also
Serialize/Deserialize Binary Tree
Connect All Siblings
Inorder Successor BST with parent pointers
Nth Highest in BST
Mirror binary tree nodes Also
Delete zero sum sub-trees
N-ary Tree to Binary Tree
6
STACKS AND QUEUES
Stack using QueuesPreview
Queue using Stacks Also
Expression Evaluation
7
GRAPHS
Clone a Directed GraphPreview
Minimum Spanning Tree
Word Chaining Also
8
BACK TRACKING
BogglePreview
All Possible Parentheses
Solve N-Queens problem Also
Find K-sum subsets
9
DYNAMIC PROGRAMMING
Fibonacci numbersPreview Also
Largest Sum Subarray
MaxSum Subsequence – Nonadjacent Elements
Game Scoring: Find number of ways a player can score ‘n’ runs Also
Coin Changing Problem
Levenshtein Distance Also
10
MISCELLANEOUS
Sum of Three ValuesPreview Also
Make Columns and Rows Zeros
Search in a Matrix Also
Implement LRU Cache
Host Endianness
Closest Meeting Point Also
11
APPENDIX
Testimonials
Frequently Asked Questons Also
Other Resources
Also Get Educative – Coderust 3.0: Faster Coding Interview Preparation on Traderknow.com
Visit more course: FOREX TRADING COURSE
The same course: Bill Williams Eduard Altmann SMB Simpler Trading Van Tharp Atlas Api Training Trading Template Sunil Mangwani Sunil Mangwani Frank Paul . Also Market Delta Tradingacademy Simplertrading Urbanforex. Also Candlechartscom Dan Sheridan Pipsociety Atlas Api Training TopTradeTools Todd Mitchell Jerry Singh OpenTrader Alexandertrading Daytradingzones
Please contact email: [email protected]
Course Features
- Lectures 0
- Quizzes 0
- Duration 30 hours
- Skill level All levels
- Language English
- Students 94
- Assessments Yes