## LeetCode 166. Fraction to Recurring Decimal

 12345 class Solution {     public String fractionToDecimal(long numerator, long denominator) {                 String flag="";         if(numerator*d[......]

## LeetCode 225. Implement Stack using Queues

 12345678910 static auto x = []() {     ios::sync_with_stdio(false);     cin.tie(nullptr);     return 0; }(); class MyStack { private:     queue q; publ[......]

## LeetCode 205. Isomorphic Strings

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

## LeetCode 119. Pascal’s Triangle II

 12345 /**  * Note: The returned array must be malloced, assume caller calls free().  */ int* getRow(int rowIndex, int* returnSize){      *returnSize=r[......]

## LeetCode 111. Minimum Depth of Binary Tree

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

## LeetCode 9. Palindrome Number

 12 bool isPalindrome(int x){     if(x[......]

## LeetCode 1078. Occurrences After Bigram

 1234 class Solution {     public String[] findOcurrences(String text, String first, String second) {         String[] arr=text.split(" ");         Arr[......]

## LeetCode 633. Sum of Square Numbers

 123456789 bool check(int d){     int t= sqrt(d);     return d==t*t; } bool judgeSquareSum(int c){     if(c%4==3)return false;         long a=0;     l[......]