Search for a command to run...
Series
We say that two strings are anagrams of each other if they have the exact same letters in same quantity of existance of each letter, regardless of non-alphabetic letters and case sensitivity. Here's an example // 'hello', 'elloh' -> anagrams // 'love...
What is Recursion? A recursive function is a function that calls itself until it doesn’t. And this technique is called recursion. Syntax const recurse = () => { recurse(); } recurse(); This recursive function will keep calling itself forever, S...
What is Sorting? Sorting refers to ordering data in an increasing or decreasing fashion according to some linear relationship among the data items. If we've an array of numbers [6, 1, 5 ,8 ,11 ,4] Maybe we want to sort in ascending order [1, 4, 5, 6,...
Definition Binary Search is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(Log n). Com...
What is Caesar Cipher? In cryptography, a Caesar cipher, also known as Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which...
