## LeetCode 1028. Recover a Tree From Preorder Traversal

 1234567 /**  * Definition for a binary tree node.  * struct TreeNode {  *     int val;  *     TreeNode *left;  *     TreeNode *right;  *     TreeNode([......]

## LeetCode 149. Max Points on a Line

 123456789 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); class Solution { public:     int maxPoints([......]

## LeetCode 52. N-Queens II

 123456789 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); class Solution { private:     int ret;[......]

## LeetCode 187. Repeated DNA Sequences

 123456789 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); class Solution { public:     vector findRep[......]

## LeetCode 872. Leaf-Similar Trees

 12345678 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); /**  * Definition for a binary tree node.[......]

## LeetCode 1154. Day of the Year

 1234 class Solution {     static int[] arr={0,31,59,90,120,151,181,212,243,273,304,334};     public int dayOfYear(String date) {         String[] date[......]

## LeetCode 443. String Compression

 123456789 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); class Solution { public:     int compress(v[......]

## LeetCode 593. Valid Square

 123456789 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); class Solution { private:     bool isVertic[......]