Repository files navigation

The current repository contains a set of learning resources, and coding challenges solutions that I have implemented as result of my training, to pass a microsoft interview that allowed me to receive an offer at Microsoft for a SWE intern and full time role.

• 📫 How to reach me:You can find me also onLinkedln or 💌Mail me atdavidepollicino2015@gmail.com

1. Structure of the repository
2. Platforms for Training
3. When contribute
4. How to contribute
5. Connect with me

## PLEASEIf you need more material like this,nominate me as github start, to get help the project to gain more visibility and contributions

1. Fork the repository
2. Do the desired changes (add/delete/modify)
3. Make a pull request

1. If there is no solution to a problem in the main branch.
2. If your solution is asymptotically faster than the one in the main branch.
3. If your algorithm is of the same time complexity but with reduced code size. In this case, comment out the original solution and make a pull request with your solution.
4. If you have another method of solving the problem which is asymptotically slower than the original method then, comment your solution in the main file and make a pull request.
5. If you would like to make any positive change to the lectures content

Paypal Me

1. Prefix Sum
2. Sliding Window Technique
3. Binary search
4. GCD of two numbers in LogN
5. Sieve of Eratosthenes, Segmented Sieve
6. Modular arithmetic
7. Bit Manipulation
8. Greedy Algorithms
9. Two Pointers
10. Kadane's Algorithm
11. Meet in the Middle Algorithm
12. Recursion
13. Divide and Conquer
14. Next Greater/Smaller Element using Stack
15. Problems related to Parenthesis
16. Backtracking
17. Problems related to Constructive Algorithms
18. Problems related to Heap
19. Inclusion-Exclusion Principle
20. Finding nCr and nPr for Queries
21. Rabin Karp Algorithm
22. Prefix Function
23. KMP Algorithm
24. Z-Function
25. Manacher's Algorithm
26. DFS/BFS Traversal in Graph/Tree
27. Diameter of Tree
28. Euler Tour of Tree
29. Finding LCA using Euler Tour
30. Finding LCA using Binary Lifting
31. Distance between two nodes
32. Subtree Problems
33. Connected Components, Topological Sort, Cycle Detection, Bipartite Check-in Graph
34. Dijkstra's Algorithm
35. Bellman-Ford Algorithm
36. Floyd Warshall Algorithm
37. Bridges in Graph
38. Prim's Algorithm
39. 0/1 BFS
40. Dynamic Programming, DP with Bitmask, DP on trees
41. Disjoint Set
42. Kruskal's Algorithm
43. Fenwick Trees, Binary Lifting on Fenwick Tree
44. Matrix Exponentiation
45. Sqrt Exponentiation
46. Segment Trees
47. Lazy Propagation on Segment Trees
48. Sprague/Grundy Theorem
49. Heavy Light Decomposition
50. FFT/NTT

If you need more material like this,nominate me as github star, to get help the project to gain more visibility and contributions