Beginner
1. Binary Search2. Linear Search3. Fibonacci Search4. Bubble Sort5. Insertion Sort6. Selection Sort7. Quick Sort8. Merge Sort9. Addition of two matrixes10. Subtraction of two matrixes11. Multiplication of two matrixes12. Transpose of given Matrix13. EUCLIDIAN GCD ALGORITHM14. Fabinocci Numbers with matrix multiplication15. Fast Exponential16. Modular inversion17. Prime seiving18. Heap(using array)19. Heapify20. Heap Sort21. Linear Probing22. Open Addressing23. Collision Avoidance24. Binary Search Tree Traversal Techniques25. Finding Kth Largest Element in Binary Tree26. Diameter of a Binary search tree27. Depth of Binary Tree28. Number of Nodes in BST29. Convert Array to Binary Tree30. Convert Array to General Tree31. Lowest Common Ancestor
Login to see Discussion
Approach
i)create a method modinverse and which takes a and m as argument
ii)assign m to m1 , 0 to y and 1 to x
iii)if m equal to 1 return 0
iv)while a is greater than 1 assign a/m to q, t to a,update m to a%m,a to t, t to y and finally assign x-qy to x and t ot x
v)if x is less than 0 add m1 to x
vi)return the value of x
vii)in main method take the required input from the user and print the output
Time Complexity:
Space Complexity: O(1)
Note :
Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.
Login to see Solution