I'm in deep love with competitive programming. I used to feel pleasure while learning new algorithms and solving harder problems. Some of them i will mention later in my this website are really heart touching to me. I feel motivated and enthusiastic after solving and understanding harder problems and concepts, as there are some concepts which also somehow related to many ongoing life problems. Sometimes i also used to relate some of the problems directly with my life.
1. Sliding window technique
2. Binary search
3. Finding GCD by Euclidean and extended Euclidean
4. Linear Diophantine Equation
5. Checking primes in sqrt(n)
6. Seive Of Eratosthones
7. Segmented Seive
8. Finding prime factorisation of a number in log n per query
9. Euler Totient Function
10. Fermat Little Theorm
11. Wilson's Theorm
12. Binary Exponentiation
13. Modular Arithmetic
14. Modular Inverse Of A Number
15. Modular Exponentiation
16. Chinese Remainder Theorm
17. Factorial Modulo Mod
18. Inclusion Exclusion Principle
19. Finding nCr and nPr for queries
20. Sorting Algorithms
21. 2 Pointer Approach
22. Power Set of a Given Array Using BIT
23. Greedy algorithms
24. Kadane's algorithm
25. Pegionhole Principle
26. Job Sequencing Activity Selection
27. Backtracking
28. Meet In The Middle Algorithm
29. Divide And Conquer
30. Next Greator And Next Smaller Using Stack
31. Parenthesis problem
32. Largest Rectangular Area In Histogram
33. Heaps and Priority Queues
34. Hashing On Strings
35. Rabin Karp Algorithm
36. Prefix Function
37. KMP Algorithm
38. Z Function
39. Manacher's Algorithm
40. Tree/Graph Representation
41. DFS/BFS Traversal In Graph Tree
42. Diameter Of A Tree
43. Euler Tour Of The Tree
44. Finding LCA Using Euler Tour
45. Finding LCA Using Binary Lifting
46. Distance Between Two Nodes
47. Subtree Problems
48. Connected Components
49. Topological Sort
50. Cycle Detection In Graph
51. Bipartite Check In Graph
52. SCC Using Kosaraju's Agorithm
53. Dijkstra Algorithm
54. Bellmann Ford Algorithm
55. Floyd Warshall Algorithm
56. Bridges In Graph
57. Articulation Points In Graph
58. MST Using Kruskal's Algorithm
59. Prims Algorithm
60. 0/1 BFS
61. Finding Bridges Online
62. Dynamic programming
63. Dynamic programming With Bit-Masking
64. Dynamic programming On Trees
65. Disjoint Set
66. Sparse Table
67. Fenwick Tree
68. Binary Lifting On Fenwick Tree
69. Matrix Exponentiation
70. Sqrt Decomposition
71. Mo's Algorithm
72. Segment Trees
73. Lazy Propagation on Segment Trees
74. Sprague-Grundy Theorm
75. Flows And Related Stuff
76. Heavy Light Decomposition
77. Convex Hull Algorithm
78. FFT/NTT