Given a string, find and return the longest palindromic substring in it. A palindrome is a word that reads the same forward and backward. The substring must be contiguous within the original string.
You are given a 0-indexed array ’nums’ where each element represents the maximum length you can jump forward from that index. You are initially positioned at nums[0], and you need to reach the last index. Return the minimum number of jumps needed to reach the last index.
You are given an integer array nums. Starting from the first index, each element represents the maximum jump length you can make from that position. Return true if you can reach the last index, or false otherwise.
A robot starts at the top-left corner of an m x n grid and can only move right or down. Determine the total number of unique paths it can take to reach the bottom-right corner.
