📚 Algorithms, Data Structures, Design Patterns, Concurrency in Kotlin

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

Kotlin solutions of the LeetCode Top Interview Questions.

Collection of solutions for algorithm problems from Codility and other sources in Kotlin.

Solutions to problems found in Elements of programming interviews book

Penerapan Weighted PRNG dengan studi kasus Gacha pada game Genshin Impact

Server-driven UI refers to a design pattern in which the user interface is primarily controlled and rendered by a server, with the client serving as a display and interaction layer. This approach allows for a separation of concerns between the presentation and business logic, and can simplify client-side development.

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.

Deep Reinforcement Learning is a subfield of machine learning where an agent learns to make decisions in an environment through trial and error, with feedback in the form of rewards or penalties. It has applications in robotics, game AI, and decision making.

Learning Kotlin lang while solving hackerrank challenges

Base algorithms implementations, base data structure implementations, Leetcode problems solutions

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.

🎯 Soluções propostas para os problemas do HackerRank

A sudoku solver algorithm is a computational method used to fill in the blanks of a partially filled sudoku puzzle with the correct digits. It uses techniques such as constraint propagation, backtracking, and heuristics to find the solution to the puzzle.

A collection of data structures and algorithms in various languages for practicing purposes

다양한 사이트들의 알고리즘 문제를 해결하고 기록합니다.

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.