class Solution {
public:
    bool isSubsequence(string s, string t) {
        int left{};
        int right{};
        while(left<s.size() && right<t.size()){
            if(s[left] == t[right])left++;
            right++;
        }


        return left==s.size();
    }
};

class Solution {
public:
    vector<int> plusOne(vector<int>& digits){
        vector<int> result = digits;
        for(int i = result.size()-1;i>-1;--i){
            if(i==result.size()-1)
                ++result[i];
            if(result[i]==10){
                result[i] = 0;
                if(i!=0) ++result[i-1];
                else{
                    result.push_back(0);
                    result[i] = 1;
                }
            }    
        }
        return result;
    }
};

пробелы поставлю

class Solution {
public:
    int numberOfBeams(vector<string>& bank) {
        int result{};
        int preCounter{};
        int counter = {};

        for(int y = 0;y<bank.size();++y){

            for(int x = 0;x<bank[y].size();++x){

                if(bank[y][x] == '1')counter++;

            }

            if(counter == 0){
                continue;
            }

            cout<<counter<<endl;

            if(y == 0){

                preCounter = counter;
                counter = 0;

            }else{

                result += preCounter*counter;
                preCounter = counter;
                counter = 0;

            }
        }

        return result;
    }
};

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
int result = 0;
public:
    int rangeSumBST(TreeNode* root, int low, int high) {
        if(root == NULL)return result;
        
        if(root->val >= low && root->val <= high)result += root->val;

        rangeSumBST(root->left,low,high);
        rangeSumBST(root->right,low,high);

        return result;
    }
};

  tree->val != NULL  

class Solution {
int result{};
public:
    int rangeSumBST(TreeNode* root, int low, int high) {
        if(root == NULL)return result;
        
        if(root->val >= low && root->val <= high)result += root->val;

        rangeSumBST(root->left,low,high);
        rangeSumBST(root->right,low,high);

        return result;
    }
};

#include <iostream>

class Artist {
public:
    void Start() {
        Requesting();
    }
private:

    void Requesting() {
        std::string figure;
        bool run = 0; // run будет равна false
        std::cout << "Write what figure you want to draw: \n 1: Romb \n 2: Square \n 3: Triangle \n Write number or figure name: ";
        std::cin >> figure;
        while (!run) {
            if (figure == "1" || figure == "Romb") {
                DrawRomb();
                break;
            }
            else if (figure == "2" || figure == "Square") {
                DrawSquare();
                break;
            }
            else if (figure == "3" || figure == "Triangle") {
                DrawTriangle();
                break;
            }
            else {
                std::cout << "Please enter again: ";
                std::cin >> figure;
            }
        }
    }
    void DrawRomb() {
        int radius{}; // radius == 0
        std::cout << "Enter radius: ";
        std::cin >> radius;
        std::cout << "\n";
        int xval = radius;
        bool part1 = 1;
        int sval = radius + 1;
        for (int i = 0; i < (radius * 2) + 1; ++i) {
            for (int j = 0; j < (radius * 2) + 2; ++j) {
                if (j == xval || j == sval) {
                    if (j == xval) {
                        std::cout << "x";
                    }
                    if (j == sval) {
                        std::cout << "s";
                    }
                }
                else {
                    std::cout << " ";
                }
            }
            if (i >= radius)part1 = false;
            if (part1) {
                --xval;
                ++sval;
            }
            else {
                ++xval;
                --sval;
            }
            std::cout << std::endl;
        }

    }

    void DrawTriangle() {
        int height{};
        char c;
        std::cout << "Write height: ";
        std::cin >> height;
        std::cout << "\nWrite symbol to draw triangle: ";
        std::cin >> c;
        int index = height;
        int index2 = height - 1;
        std::cout << "\n";
        for (int y = 0; y < height; ++y) {
            for (int x = 0; x < height * 2; ++x) {
                if (y == height - 1)
                    std::cout << c;
                else if (x == index || x == index2)
                    std::cout << c;
                else std::cout << ' ';

            }
            index++;
            index2--;
            std::cout << "\n";
        }
    }

    void DrawSquare() {
        int size{};
        std::string temp;
        std::cout << "Write size of side: ";
        std::cin >> size;
        std::cout << "\nFilled? (yes/no): ";
        std::cin >> temp;
        bool filled = temp == "yes";

        if (!filled) {
            for (int y = 0; y < size; ++y) {
                for (int x = 0; x < size; ++x) {
                    if (y == 0 || y == size - 1)
                        std::cout << '#';
                    else if (x == 0 || x == size - 1)
                        std::cout << '#';
                    else
                        std::cout << ' ';
                }
                std::cout << "\n";

            }
        }
        else {
            for (int y = 0; y < size; ++y) {
                for (int x = 0; x < size; ++x) {
                    std::cout << '#';
                }
                std::cout << "\n";

            }
        }
    }
};


int main() {
    Artist art;
    art.Start();

    return 0;
}