I’ve joined LeetCode’s Content Creator Team to publish official solutions since Oct 26, 2020. Here you may find some of my work that’s published on LeetCode:

Continue reading “LeetCode Authorized Author”## Database Index

According to WIKIPEDIA, a database index is a data structure that improves the speed of data retrieval on a database table at the cost of additional writes and storage space to maintain the index. One of the most used data structure to implement index is B-tree. Generally, there are two types of index: clustered index and non-clustered index.

Continue reading “Database Index”## Java Garbage Collection

## What is garbage collection

Continue reading “Java Garbage Collection”## [Leetcode]1626. Best Team With No Conflicts

You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is theContinue reading “[Leetcode]1626. Best Team With No Conflicts”sumof scores of all the players in the team. However, the basketball team is not allowed to haveconflicts. Aconflictexists if a younger player has astrictly higherscore than an older player. A conflict doesnotoccur between players of the same age. Given two lists,`scores`

and`ages`

, where each`scores[i]`

and`ages[i]`

represents the score and age of the`i`

player, respectively, return^{th}the highest overall score of all possible basketball teams.

## [Challenge]Minimum adjacent swaps required to Sort Binary array

Given a binary array, task is to sort this binary array using minimum swaps. We are allowed to swap only adjacent elementsContinue reading “[Challenge]Minimum adjacent swaps required to Sort Binary array”

## [Leetcode]179. Largest Number

Given a list of non negative integers, arrange them such that they form the largest number.Continue reading “[Leetcode]179. Largest Number”

## [Leetcode]48. Rotate Image

You are given anContinue reading “[Leetcode]48. Rotate Image”nxn2D`matrix`

representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the imagein-place, which means you have to modify the input 2D matrix directly.DO NOTallocate another 2D matrix and do the rotation.

## [Leetcode]1589. Maximum Sum Obtained of Any Permutation

We have an array of integers,Continue reading “[Leetcode]1589. Maximum Sum Obtained of Any Permutation”`nums`

, and an array of`requests`

where`requests[i] = [start`

. The_{i}, end_{i}]`i`

request asks for the sum of^{th}`nums[start`

. Both_{i}] + nums[start_{i}+ 1] + ... + nums[end_{i}- 1] + nums[end_{i}]`start`

and_{i}`end`

are_{i}0-indexed. Returnthe maximum total sum of all requestsamong all permutationsof`nums`

. Since the answer may be too large, return itmodulo`10`

.^{9}+ 7