bunnyadad

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

class Solution {
public:

bunnyadad

class Solution {
public:
    int maxArea(vector<int> height)
    {
        int max_area = 0;
        int left = 0;
        int right = height.size() - 1;

        while (left < right)
        {

bunnyadad

class Solution {
public:
    bool isPalindrome(int x)
    {
        if (x<0) return false;
        
        vector<int> vx;
        while (x)
        {
            vx.push_back(x % 10);

bunnyadad

class Solution {
public:
    int reverse(int x)
    {
        auto str = to_string(x);
        reverse(str.begin(), str.end());
        try
        {
            return x < 0 ? -stoi(str) : stoi(str);
        }

bunnyadad

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

class Solution {
public:
    string convert(string s, int numRows)

bunnyadad

#include <iostream>
#include <string>
#include <bitset>
#include <vector>

using namespace std;

class Solution {
public:
    int lengthOfLongestSubstring(string s)

bunnyadad

#include <iostream>

struct ListNode
{
     int val;
     ListNode *next;
     ListNode(int x) : val(x), next(NULL) {}
 };

class Solution

bunnyadad

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) 
    {
        map<int, int> nums_map;
        for (size_t i = 0; i < nums.size(); i++)
        {
            auto complement = target - nums[i];
            if (nums_map.find(complement) != nums_map.end()) return {(int)i, nums_map[complement]};
            

bunnyadad

#include <iostream>
#include <string>
#include <vector>
#include <regex>

using namespace std;

class Font
{
public:

bunnyadad

#include <iostream>
#include <string>
#include <map>
using namespace std;

size_t isMine(char c)
{
    return c == '*' ? 1 : 0;
}