Insertion sort is an in-place sorting algorithm. Insertion sort works by picking each unsorted element and placing it in its correct sorted

Given an array of integers, nums, return all the triplets in the given array nums[i], nums[j], nums[k] such that i != j, i != k, and j != k

LRU cache stores items in the order in which they were requested. In LRU strategy, when the cache is full, the item that hasn't been used