Compute the Nth Row of a Pascal’s Triangle using Dynamic Programming Algorithm
Given an integer n, return the nth (0-indexed) row of Pascal’s triangle. Pascal’s triangle can be created as follows: In the top row, there is an array of 1. …
Tag: c++
Two Pointer with Sliding Window Algorithm to Compute the Longest Substring with At Most K Distinct Characters
Given a string, find the length of the longest substring T that contains at most k distinct characters. Example 1: Input: s = “eceba”, k = 2 Output: 3 …
Depth First Search Algorithm (Preorder Traversal) to Compute the Kth Smallest in a Binary Search Tree
Given a binary search tree root, and k return the kth (0-indexed) smallest value in root. It is guaranteed that the tree has at least k + 1 nodes. …
Recursive Algorithm to Compute the Linked List Jumps
You are given a singly linked list node containing positive integers. Return the same linked list where every node’s next points to the node val nodes ahead. If there’s …
Recursive Algorithm to Delete a Node from a Singly Linked List
Given a singly linked list node, and an integer target, return the same linked list with all nodes whose value is target removed. Example 1 Input node = 0 …