Pocket guide for the coding round...
Sandeep Singh
@Walmart Labs| Ex-Visa |S/W, Data Enginner | NLP | DL| ML| Time Series Forcasting| Spark,Kafka | Microservices/Event driven | DevOps(Docker,K8s)
Step1:
Learn and practice below Data structure and algorithms. Analyze time and space complexity.
Array,Stack,Queue, LinkedList, BST,Graph,Dynamic Programming,Recursion,String Tries,Dynamic Programming.
I personally like the below tools to visualize algorithms.
Famous Algorithm: KMP, Kadane's algorithm, Dijkstra's algorithm, Kruskal's algorithm, greedy algorithm, Divide-and-conquer algorithm
Searching: Linear, Binary.
Optimized Approach: Dynamic Programming
Sorting: Selection, Bubble, Quick, Merge, Counting, Bucket, Heap.
Step 2:
Problem Solving: You can use below platform for problem-solving:
Famous Books:
Cracking the coding interview Data Structures and Algorithms Made Easy in Java Introduction to Algorithms by Thomas H. Cormen
Please correct me if anything is wrong.
Associate Director of Engineering @MakeMyTrip | Building Systems that Scale
4 å¹´Very handy !!! ... Please share a System Design guide as Well.