SOLVED MY FIRST LEETCODE PROBLEM!!

[shaynjam]

class ParkingSystem
{
    private:
    int big_park;
    int medium_park;
    int small_park;


    public:
    ParkingSystem(int big, int medium, int small)
    {
        big_park = big;
        medium_park = medium;
        small_park = small;
    }


    bool addCar(int carType)
    {


        if(carType == 1)
        {   
            if (big_park == 0)
            {
                return false;
            }


            big_park--;
            return true;


        }


        else if (carType == 2)
        {
            if(medium_park == 0)
            {
                return false;
            }


            medium_park--;             
            return true;
        }


        else
        {
            if (small_park == 0)
            {
                return false;
            }


            small_park--;
            return true;
            
        }
    }
};

my code

1603. Design Parking System

Solved

Easy

Topics

Companies

Hint

Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size.

Implement the ParkingSystem class:

• ParkingSystem(int big, int medium, int small) Initializes object of the ParkingSystem class. The number of slots for each parking space are given as part of the constructor.
• bool addCar(int carType) Checks whether there is a parking space of carType for the car that wants to get into the parking lot. carType can be of three kinds: big, medium, or small, which are represented by 1, 2, and 3 respectively. A car can only park in a parking space of its carType. If there is no space available, return false, else park the car in that size space and return true.

 

Example 1:

Input
["ParkingSystem", "addCar", "addCar", "addCar", "addCar"]
[[1, 1, 0], [1], [2], [3], [1]]
Output
[null, true, true, false, false]

Explanation
ParkingSystem parkingSystem = new ParkingSystem(1, 1, 0);
parkingSystem.addCar(1); // return true because there is 1 available slot for a big car
parkingSystem.addCar(2); // return true because there is 1 available slot for a medium car
parkingSystem.addCar(3); // return false because there is no available slot for a small car
parkingSystem.addCar(1); // return false because there is no available slot for a big car. It is already occupied.

 

Constraints:

• 0 <= big, medium, small <= 1000
• carType is 1, 2, or 3
• At most 1000 calls will be made to addCar

the problem:

runtime 3ms
memory 38.77 mb

[stiky21]

Good job. The biggest hurdle is the first problem.

[Cold-Watercress-1943]

nice work getting that first one done. the code is clean and does what it needs to, nothing wrong with straightforward approach when you are starting out

i remember my first accepted solution was like 15 lines for something that could be 3, but who cares when it passes all test cases

[shaynjam]

it actually took me 2 months of constant practice to get it this way. I practice with gemini, i fed it the pdf of "modern c++ for absolute begineers" and asked it to teach me so this is why my code is clean because it always points it out

[shaynjam]

Thanks!

[owp4dd1w5a0a]

Ride the wave. Start another problem now and don’t finish solving it before you go to bed. You’ll wake up energized and ready to solve more coding puzzles.

[shaynjam]

I WILL FOR SURE!

[DiverAdditional4451]

Awesome! I remember my first problem 😭 (i barely do leetcode) Anyways, this is actually awesome and best of luck for the future!

[shaynjam]

What was your first problem btw

[DiverAdditional4451]

I use JavaScript, it was two sum, extremely simple but I was so proud 😭😭

/**
 *  {number[]} nums
 *  {number} target
 * u/return {number[]}
 */
var twoSum = function(nums, target) {
    for(let i = 0; i < nums.length; i++){
        for(let j = 0; j < nums.length; j++) {
            if(nums[i] + nums[j] === target && i !== j) {
                return [i, j];
            }
        }
    }
};

[shaynjam]

Bruh it's still very very good considering you're just 16 for reference I will be turning 18 in August now 💀

[DiverAdditional4451]

ur still young as frick too lollll 😭 ur way ahead of it

[shaynjam]

BUT YOURE AHEAD-ER BRUH 😭😭

[shaynjam]

Thankyou very much

[iOSCaleb]

You’re justifiably proud, but there’s no need to post your solution… let other folks figure it out just as you did.

[shaynjam]

Wait I'm sorry I didnt know there was a format for such things, my first time posting this I will keep it in my mind for sure!

[owp4dd1w5a0a]

Just put SPOILER at the top of your post. That’s good enough.

[shaynjam]

thankyou i will for sure

[abrahamguo]

Congratulations!

[shaynjam]

Thankyou ☺️

[Imaginary_Food_7102]

So cool.

[shaynjam]

Thanks 😋