I share my HackerRank solutions in this repository.
-
Updated
Sep 9, 2024 - Kotlin
HackerRank is a tech company that focuses on competitive programming challenges for both consumers and businesses, where developers compete by trying to program according to provided specifications. HackerRank's programming challenges can be solved in a variety of programming languages (including Java, C++, PHP, Python, SQL, JavaScript) and span multiple computer science domains. When a programmer submits a solution to a programming challenge, their submission is scored on the accuracy of their output. Programmers are then ranked globally on the HackerRank leaderboard and earn badges based on their accomplishments to drive competition among users.
I share my HackerRank solutions in this repository.
Optimal solutions to data structure & algorithm questions from variety of sources.
🦾 Compilation of challenges from the "Problem Solving (Algorithms)" section of HackerRank
Master data structures & algorithms in Kotlin with solved problems and coding challenges.
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.
Resolution of all the challenges I performed in "Hacker rank" using kotlin.
🎯 Soluções propostas para os problemas do HackerRank
🏝️ A Kotlin solution set for the first 100 Project Euler problems.
Oppia is an open-source platform for creating interactive educational content on Android. It uses AI algorithms to provide personalized feedback and adapt to each learner's abilities. Oppia enables teachers, educators, and content creators to build engaging and interactive lessons, assessments, and games, making learning more accessible
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.
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.
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.
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.
Repository with solutions to "Problem Solving - Prepare" from hacker Rank. Problems solved in Kotlin.
My solutions from my HackerRank account
My solutions for HackerRank's challenges with Kotlin - Problem Solving
solution of comman hackerRank and Leetcode Questions
This repo holds my solutions for coding websites.
This repo is aim to help developers in demonstrate how to provide the ideal and easiest solution for the HackerRank Problems Solving and Algorithms.
Created by Vivek Ravisankar, Hari Karunanidhi
Released July 2009