Robina Li

Given an array of integers arr and an integer d. In one step you can jump from index i to index:

Given an integer array nums, return the number of longest increasing subsequences.

Given an array of strings words and an integer k, return the k most frequent strings.

Given a string s, return the longest palindromic substring in s.

Given an n-ary tree, return the level order traversal of its nodes’ values.

You have a graph of n nodes labeled from 0 to n - 1. You are given an integer n and an array edges where edges[i] = [ai, bi] indicates...

Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level).

Given the root of a binary tree with unique values and the values of two different nodes of the tree x and y, return true if the nodes corresponding to...

Given the root of a binary tree, return the zigzag level order traversal of its nodes’ values. (i.e., from left to right, then right to left for the next level...

Given an integer array nums and an integer k, return the kth largest element in the array.