3106. Lexicographically Smallest String After Operations With Constraint
3106. Lexicographically Smallest String After Operations With Constraint
Description
You are given a string s and an integer k.
3105. Longest Strictly Increasing or Strictly Decreasing Subarray
3105. Longest Strictly Increasing or Strictly Decreasing Subarray
Description
You are given an array of integers nums. Return the length of the longest subarray of nums which is either strictly increasing or strictly decreasing.
1457. Pseudo-Palindromic Paths in a Binary Tree
1457. Pseudo-Palindromic Paths in a Binary Tree
Description
Given a binary tree where node values are digits from 1 to 9. A path in the binary tree is said to be pseudo-palindromic if at least one permutation of the node values in the path is a palindrome.
1022. Sum of Root To Leaf Binary Numbers
1022. Sum of Root To Leaf Binary Numbers
Description
You are given the root of a binary tree where each node has a value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit.
988. Smallest String Starting From Leaf
988. Smallest String Starting From Leaf
Description
You are given the root of a binary tree where each node has a value in the range [0, 25] representing the letters 'a' to 'z'.
298. Binary Tree Longest Consecutive Sequence
298. Binary Tree Longest Consecutive Sequence
Description
Given the root of a binary tree, return the length of the longest consecutive sequence path .
199. Binary Tree Right Side View
199. Binary Tree Right Side View
Description
Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.