What to Do?

Star 🌟 this repo

Fork the repo

Location
Go to folder Pull Here/LeetCode/3SUM

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 array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.

Notice that the solution set must not contain duplicate triplets.

Example 1:

Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]

Explanation:
nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0.
nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0.
nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0.
The distinct triplets are [-1,0,1] and [-1,-1,2].
Notice that the order of the output and the order of the triplets does not matter.

Example 2:

Input: nums = [0,1,1]
Output: []

Explanation: The only possible triplet does not sum up to 0.

Example 3:

Input: nums = [0,0,0]
Output: [[0,0,0]]

Explanation: The only possible triplet sums up to 0.

Constraints:

• 3 <= nums.length <= 3000
• -105 <= nums[i] <= 105

Complete the following function

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

What to Do?

Star 🌟 the repo

Fork the repo

Location
Go to folder
Solve 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) {
        
    }
};