Blogs Hub

by AskGif | Oct 05, 2020 | Category :coding

Shuffle String - Sort - Easy - LeetCode

Shuffle String - Sort - Easy - LeetCode

Given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string. Return the shuffled string. &nbsp; Example 1: <br />Input: s = "codeleet", ind

read more...

by AskGif | Oct 05, 2020 | Category :coding

Sort Integers by The Number of 1 Bits - Sort - Easy - LeetCode

Sort Integers by The Number of 1 Bits - Sort - Easy - LeetCode

Given an integer array arr. You have to sort the integers in the array in ascending order by the number of 1's in their binary representation and in case of two or more integers have the same number of 1's you have to sort them in ascending order. Return the sorted array. &nbsp;

read more...

by AskGif | Oct 05, 2020 | Category :coding

Matrix Cells in Distance Order - Sort - Easy - LeetCode

Matrix Cells in Distance Order - Sort - Easy - LeetCode

We are given a matrix with R rows and C columns has cells with integer coordinates (r, c), where 0 &lt;= r &lt; R and 0 &lt;= c &lt; C. Additionally, we are given a cell in that matrix with coordinates (r0, c0). Return the coordinates of all cells in the matrix, sorted by their dist

read more...

by AskGif | Jul 19, 2018 | Category :coding

Implement Quick Sort Using C-Sharp.

Implement Quick Sort Using C-Sharp.

Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. Developed by Tony Hoare in 1959 and published in 1961, it is still a commonly used algorithm for sorting. When implemented well, it

read more...

by AskGif | Jul 19, 2018 | Category :coding

Implement Merge Sort Using C-Sharp

Implement Merge Sort Using C-Sharp

In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Merge sort is a

read more...