Collection of various algorithms in mathematics, computer science etc implemented in Kotlin for educational purposes.

Prepare for coding interviews with the LeetCode Solution Android App. Practice your coding skills with solutions and explanations for various problems on LeetCode. Option to save and submit your own solutions.

Algorithm Tester: Contains several Kotlin solutions for algorithms and data structure problems typically encountered at many technical interviews for software engineers. Uses JUnit5 tests to ensure for correct functionality and solutions.

FFT is an efficient algorithm for computing the discrete Fourier transform (DFT) of a sequence, enabling the frequency analysis of signals in linear time. It plays a crucial role in various applications, including image processing, audio compression, and cryptography.

The Closest Pair of Points problem is a computational geometry problem in which the task is to find the two points in a set of points in a plane that are closest to each other. The solution to this problem has numerous applications in areas such as computer graphics, geographic information systems, and pattern recognition.

Contains datas structures and most common problems solved with Kotlin

.A Generative Adversarial Network (GAN) is a deep learning architecture used to generate new data that resembles existing data. It consists of two neural networks, a generator and a discriminator, that are trained in competition with each other. The generator creates synthetic data, while the discriminator tries to distinguish between real.

Neural networks are a type of machine learning algorithm modeled after the structure and function of the human brain. They are used for tasks such as image and speech recognition, natural language processing, and decision making. Neural networks consist of layers of interconnected nodes, called artificial neurons, that process information

The Boyer-Moore algorithm is a string search algorithm that efficiently searches for the occurrence of a pattern in a text. It works by pre-processing the pattern to determine the bad character rule and good suffix rule, which are used to quickly skip over sections of the text that cannot match the pattern. Time complexity of O(n/m)

Backtracking algorithms solve problems by trying out solutions incrementally and undoing them if they lead to a dead end. It is a systematic method of trying out different solutions to a problem by incrementally building a solution and undoing it if it leads to an invalid state.

The Knuth-Morris-Pratt (KMP) algorithm is a linear time pattern matching algorithm that efficiently searches for occurrences of a pattern in a text. It pre-processes the pattern to determine a partial match table which is used to quickly skip over sections of the text that cannot match the pattern.

Playing With View Colors

Approximation algorithms are algorithms that find approximate solutions to optimization problems, usually with a guarantee of the solution's quality relative to the optimal solution. They are used when exact solutions are too time-consuming to compute. Approximation algorithms trade-off optimality for efficiency and are commonly used in scheduling.

Backtracking algorithms solve problems by trying out solutions incrementally and undoing them if they lead to a dead end. It is a systematic method of trying out different solutions to a problem by incrementally building a solution and undoing it if it leads to an invalid state. It is commonly used in solving problems such as the n-queens problem.