What to Do?

Star 🌟 the repo

Fork the repo

Location
Go to folder Pull Here/LeetCode/PalindromeNumber

File name
Take your GitHub username id like "hrithik339", "hacker-boy", etc or anything which you have.
Then add a programming language extension after this (link for C++ add .cpp and for python add.py)
Only files with the correct file name will be accepted

Problem Statement

Given an integer x, return true if x is palindrome integer.

An integer is a palindrome when it reads the same backward as forward.

For example, 121 is a palindrome while 123 is not.

Example 1:

Input: x = 121
Output: true

Explanation: 121 reads as 121 from left to right and from right to left.

Example 2:

Input: x = -121
Output: false

Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: x = 10
Output: false

Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Constraints:

-231 <= x <= 231 - 1

Follow up: Could you solve it without converting the integer to a string?

Function

class Solution {
public:
    bool isPalindrome(int x) {
        
    }
};

hey
This repository is excluded from hacktoberfest,
So please mention it in your "README"...

What to Do?

Star 🌟 the repo
Fork 🌿 the repo
Location
Go to folder Pull Here/LeetCode/CountingBits

File name
Take your GitHub username id like "hrithik339", "hacker-boy", etc or anything which you have.
Then add a programming language extension after this (link for C++ add .cpp and for python add.py)
Only files with the correct file name will be accepted

Problem Statement

Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.

Example 1:

Input: n = 2
Output: [0,1,1]

Explanation:
0 --> 0
1 --> 1
2 --> 10

Example 2:

Input: n = 5
Output: [0,1,1,2,1,2]

Explanation:
0 --> 0
1 --> 1
2 --> 10
3 --> 11
4 --> 100
5 --> 101

Constraints:

0 <= n <= 105

Follow up:

It is very easy to come up with a solution with a runtime of O(n log n). Can you do it in linear time O(n) and possibly in a single pass?
Can you do it without using any built-in function (i.e., like __builtin_popcount in C++)?

Function

class Solution {
public:
    vector<int> countBits(int n) {
        
    }
};

class Solution:
    def countBits(self, n: int) -> List[int]:

class Solution {
    public int[] countBits(int n) {
        
    }
}

Alice and Bob are playing a game. Alice goes first.

They have a binary circular array A with N elements. In one move, a player can:

Choose a circular continuous segment of the array and perform a left cyclic shift on the chosen segment.

We define the term diff(A as the number of pairs of adjacent elements with different values. Note that we also consider An​ and A1 as adjacent.

A player can make a move only if, for the updated array A′, diff(A′)>diff(A).

The player who is unable to make a move, loses. Find the winner of the game if both players play optimally.

].

Input Format

The first line of input contains a single integer T, the number of test cases. The description of the test cases follows.
Each test cases consists of two lines of input.
    The first line of each test case contains a single integer N, the number of elements.
    The second line of each test case contains N space-separated integers 

Output Format

For each test case, if Alice will win print Alice, otherwise print Bob.

You may print each character in Uppercase or Lowercase. For example: BOB, bob, boB, and Bob are all identical.

What to Do?

Star 🌟 the repo
Fork 🌿 the repo
Location
Go to folder Pull Here/LeetCode/HouseRobber

File name
Take your GitHub username id like "hrithik339", "hacker-boy", etc or anything which you have.
Then add a programming language extension after this (link for C++ add .cpp and for python add.py)
Only files with the correct file name will be accepted

Problem Statement

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Example 1:

Input: nums = [1,2,3,1]
Output: 4

Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
Total amount you can rob = 1 + 3 = 4.

Example 2:

Input: nums = [2,7,9,3,1]
Output: 12

Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
Total amount you can rob = 2 + 9 + 1 = 12.

Constraints:

1 <= nums.length <= 100
0 <= nums[i] <= 400

Function

class Solution {
public:
    int rob(vector<int>& nums) {
        
    }
};

uploaded the file, can merge it with appropriate labels