dzdzvcsd,

fsfsdfsdfdsfsdf

test

class Solution {
public:
    bool isGoodLength(int len, string& s) {
        
    }

    string longestPalindrome(string s) {
        int l = 1; // a string of length 1 can always be a pallindrome
        int r = s.length() + 1; // it is impossible to find a string of length s.length() + 1, leave alone pallindromic

        while(r > l + 1) {
            int mid = l + (r - l) / 2;

            if(isGoodLength(mid, s)) {
                l = mid;
            } else {
                r = mid;
            }
        }
    }
};

[*.cs]
indent_style = space
indent_size = 2
tab_width = 2
csharp_new_line_before_open_brace = none

var obj = {
    prop: 1,
    getProp: function(){
         return function() { console.log(this.prop) };
    },
};

obj.getProp()();