binary search

Binary Search using Kotlin – Searching Algorithms #1

In this article, let us discuss one more Algorithm – Binary Search which is the most frequently asked Algorithms during Interviews. Let us discuss about it in brief and how to implement its algorithm using Kotlin Programming Language. According to Wikipedia, A Binary Search is a search algorithm that finds the position of a target value within a sorted array. The …

hackland election

HackLand Election – Coding Interview Questions #1

This series will be focused on Coding interview questions curated from various interviews / via online source. ”  Hackland Election There are n citizens voting in this year’s Hackland election. Each voter writes the name of their chosen candidate on a ballot and places it in a ballot box. The candidate with the highes number of votes win the election; if two or …

merge sort kotlin

Merge sort Kotlin Implementation – Sorting Algorithms #3

Merge Sort is sorting based on Divide and Conquer strategy and is one of the famous algorithms among Sorting. In this article, we will be discussing about Merge Sort Kotlin Implementation. How Merge sort Works? Merge sort algorithm technique basically involves two processes – one process splits the array into two halves and sorts them individually. The other process involves …

selection sort kotlin

Selection Sort Kotlin with Example – Sorting Algorithms #1

Selection Sort is one of the most important sorting algorithm frequently looked upon and is even asked in the Interviews. In this article we will look at Selection Sort Kotlin Implementation with example. Before diving into the code, let us see what is a Selection sort and Whether its efficient to use or not. What is a Selection Sort Selection sort is …