My very own solutions to problems published on popular code golf platforms

🦾 Compilation of challenges from the "Problem Solving (Algorithms)" section of HackerRank

Master data structures & algorithms in Kotlin with solved problems and coding challenges.

Some of my solutions to different competitive-progamming questions

This repo holds my solutions for coding websites.

https://www.hackerrank.com/domains/tutorials/30-days-of-code

Hacker Rank solutions

The Z Algorithm is a linear-time string matching algorithm used to find all the occurrences of a pattern string in a text string. It uses a preprocessing step to create a Z array, which stores the length of the longest common prefix of the text and a suffix starting from a specific position.

🎯 Soluções propostas para os problemas do HackerRank

Resolution of all the challenges I performed in "Hacker rank" using kotlin.

Solutions for Hacker Rank problems by using kotlin lang

This repo is aim to help developers in demonstrate how to provide the ideal and easiest solution for the HackerRank Problems Solving and Algorithms.

Learning Kotlin lang while solving hackerrank challenges

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.

repositorio com solucoes dos problemas na área de algoritmos gulosos (Greedy) do site hackerrank

Decision Trees are a popular machine learning algorithm used for classification and regression tasks. It is a tree-based model where each node represents a decision based on a feature of the data and each leaf represents a prediction.

A repo for solutions to Hackerrank problems in Kotlin

This repository contains my solutions for mini projects from LeetCode and HackerRank coded in Kotlin, Java, Dart and C#. It is for developers who want to improve their skills or want to see my solutions.