LRU cache implementation: Here we have two methods get and set which are defined as follows: get(x) : If the key x exists in the cache, returns its value and update reference position in the list. Else returns -1. set(x,y) : Inserts the value if the key x is not already present. If the cache reaches its capacity… Read More »
Radix Sort is the answer when elements are in the range from 1 to n^2. The idea of Radix Sort is to do digit by digit sort starting from least significant digit to most significant digit. Radix sort uses counting sort as a subroutine to sort. Radix Sort: Radix Sort basically consists of the following steps: Take the… Read More »
Given an array arr[ ] of N non-negative integers, the task is to sort these integers according to sum of their digits. Examples : Input : 12 10 102 31 15 Output : 10 102 12 31 15 Input : 12 10 14 31 15 199 Output : 10 12 31 14 15 199 12 => 1 +… Read More »
You are given an array of integers and sum. You have to find out if there exist a pair of sum is equal to that sum or not. Print “Yes” if exist, else “No”. Examples: Input: 1,2,2,4,4 Sum:8 Output: Yes Input: 2,3,4,5 Sum:6 Output: No Approach-1: Brute Force method: In this method we iterate two for loops just… Read More »
Algorithm is a step-by-step procedure which is used to solve a problem. It is important Computer Science and Software Engineering. We can improve our program efficiency in cost and time by choosing appropriate algorithm and data structures for a particular program. An algorithm is a sequence of computational steps that transform the input into the output. Definition of… Read More »