[tabby title="Task"] The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want ...

[tabby title="Task"] Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is ...

[tabby title="Task"] A linked list of length n is given such that each node contains an additional random pointer, which could point ...

[tabby title="Task"] Implement pow(x, n), which calculates x raised to the power n (i.e., xn). Example 1: Input: x = 2.00000, n = 10 Output: 1024.00000 ...

[tabby title="Task"] Write a function to find the longest common prefix string amongst an array of strings. If there is ...

[tabby title="Task"] Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol                Value I ...

[tabby title="Task"] Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that ...

[tabby title="Task"] A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot ...

[tabby title="Task"] Write a program to find the node at which the intersection of two singly linked lists begins. For ...

[tabby title="Task"] Implement an algorithm to determine if a string (of characters from ‘a’ to ‘z’) has all unique characters ...