Mathematical Algorithms for the day before your coding interview

Mathematical Algorithms are fundamentally important as several real-life problems can be modeled as a Mathematical problem. Solving such problems require mathematical insights.These problems are a fundamental part of Interviews as it illustrates the thinking process of the candidate clearly. By going through the problems in this book, you will be well prepared to tackle any Mathematical problem.Following are some of the problems we have explored which involve ideas to solve a wider range of problems. Smallest number with multiplesThis is a unique problem where we learn key insights regarding Prime factorization, role of primes in multiples and much more. Largest palindromeIn this problem, we have reduced 810000 comparisons to 362 comparisons based on three deep insights. This is a dramatic improvement. GCD of sub-partsThis problem brings up key insights involving GCD (a common and important topic) and in the process, we have explored several standard algorithms like Euclidean s GCD Algorithm. Next PermutationThis problem demonstrates a significant improvement from O(N^N x N x logN) time to O(N) time complexity. Moreover, it illustrates that improving time complexity does not necessarily mean increasing space complexity.With these problems and the thought process to solve them, you will be fully prepared.Read this book now and ace your upcoming coding interview. This is a must read for everyone preparing for Coding Interviews at top companies.