## LeetCode 925. Long Pressed Name

 12345678 bool isLongPressedName(char* name, char* typed) {     char* n=name;     char* t=typed;     if(*n!=*t){         return false;     }         w[......]

## LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal

 123 struct TreeNode* getRoot(                          int* inorder,int inorderStart,int inorderEnd,                          int* postorder,int posto[......]

## LeetCode 537. Complex Number Multiplication

 12345 char* complexNumberMultiply(char* a, char* b) {     int a1,a2,b1,b2;     sscanf(a, "%d+%di", &a1,&a2);     sscanf(b, "%d+%di", &b1,&b2);     int[......]

## LeetCode 989. Add to Array-Form of Integer

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

## LeetCode 991. Broken Calculator

 12345 int brokenCalc(int X, int Y) {     if(X==Y)return 0;     else if(X>Y) return X-Y;     else if((Y&1)==0) return brokenCalc(X,Y>>1)+1;     else retur[......]

## LeetCode 919. Complete Binary Tree Inserter

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

## LeetCode 165. Compare Version Numbers

 12345 char* compareVersionHelper(char* version,int* v){     char* t=version;     *v=0;     while(*t!='\0'&&*t!='.'){         *v=*v*10+(*t-'0');[......]

## LeetCode 216. Combination Sum III

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

## LeetCode 40. Combination Sum II

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

## LeetCode 518. Coin Change 2

 12345 int change(int amount, int* coins, int coinsSize) {     int* dp=(int*)calloc(amount+1,sizeof(int));     dp[0]=1;         for(int i=0;i[......]