solution of comman hackerRank and Leetcode Questions
-
Updated
Jul 9, 2022 - 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.
solution of comman hackerRank and Leetcode Questions
Solutions in Kotlin (or Java if Kotlin is unavailable) for the HackerRank Interview Preparation Kit
Optimal solutions to data structure & algorithm questions from variety of sources.
30 Days of Code by HackerRank in Kotlin
Repository with solutions to "Problem Solving - Prepare" from hacker Rank. Problems solved in Kotlin.
This repo made for HackerRank solutions. If you want add one more solution (we prefer all languages) then fork this repo and make your solution.
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.
My very own solutions to problems published on popular code golf platforms
🦾 Compilation of challenges from the "Problem Solving (Algorithms)" section of HackerRank
kotlinPractice
Some of my solutions to different competitive-progamming questions
This repo holds my solutions for coding websites.
My solutions to programming challenges from websites such as HackerRank and LeetCode
Master data structures & algorithms in Kotlin with solved problems and coding challenges.
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.
My solutions from my HackerRank account
🎯 Soluções propostas para os problemas do HackerRank
Created by Vivek Ravisankar, Hari Karunanidhi
Released July 2009