Can a String be Constructing by Removing a Letter from Another String?
Given two strings s0 and s1, return whether you can obtain s1 by removing 1 letter from s0. Example 1 Input s0 = “hello” s1 = “hello” Output false …
Algorithms to Convert Binary Linked List to Integer
Given a single linked list node, representing a binary number with most significant digits first, return it as an integer. Example 1 Input node = 1 → 0 → …
Algorithms to Compute the SubString with Indexing into an Infinite String
You are given a string s and two integers i and j where i < j. Let’s say p is an infinite string of s repeating forever. Return the …
From Breadth First Search Algorithm to Dijkstra Shortest Distance from Source to Every Vertex
The BFS (Breadth First Search Algorithm) expands the children nodes level by level, which allows you find the shortest distance between source and every other vertices. However, the graph …
Algorithm to Sort the Columns of a Matrix using Transpose
Given a two-dimensional integer matrix, sort each of the columns in ascending order. Example 1 Input matrix = , , ] Output , , ] Column Sort In order …
C++ Implementation of Segment Tree
Segment Tree is one of the most important data structure in Computer Science. Similar to Binary Index Tree, a Segment Tree allows us to update and query (range) in …