## Palindromic Anagram

Given a string s, determine whether any anagram of s is a palindrome.

Given a string s, determine whether any anagram of s is a palindrome.

Given a singly linked list node, swap each pair of nodes and return the new head.

Given a list of integers nums, pack consecutive elements of the same value into sublists.

You are given n people represented as an integer from 0 to n - 1, and a list of friends tuples, where person friends[i][0] and person friends[i][1] are frien...

Given an integer n, return first n integers sorted in lexicographic order.

Given a list of sorted lists of integers, merge them into one large sorted list.

Given a singly linked list node, convert it to a binary tree path using these rules:

Given a string s containing brackets "(" and ")", return the length of the longest subsequence of balanced brackets.

Given the root to a binary tree root, return the largest sum of any path that goes from the root to a leaf.

You are given a string s containing "1"s and "0"s. Return the number of substrings that contain only "1"s. Mod the result by 10 ** 9 + 7.

You are given a two-dimensional list of integers matrix which contains 1s and 0s. Given that each row is sorted in ascending order with 0s coming before 1s, ...

Given two strings s0 and s1, return whether they are anagrams of each other.