binary search

Binary Search using Kotlin – Searching Algorithms #1

Vamsi Tallapudi Algorithms, Interview Questions, Kotlin, Programming Leave a Comment

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

Vamsi Tallapudi Algorithms, Interview Questions, Kotlin Leave a Comment

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

Vamsi Tallapudi Algorithms, Interview Questions, Kotlin 1 Comment

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 …

bubble sort kotlin

Bubble Sort Kotlin Implementation – Sorting Algorithms #2

Vamsi Tallapudi Algorithms, Kotlin, Programming Leave a Comment

Bubble Sort is the simplest Algorithm of all the sorting techniques. It compares two adjacent elements and swaps them if they are in wrong order. In this article we will focus on Bubble Sort Kotlin Implementation How Bubble Sort Works? Bubble sort works by iterating through the array of N elements, from the first element to the last, comparing each …