Merge branch 'main' into main

Author: AvidCoder101

.github/workflows/check-duplicate-issues.yml

@@ -0,0 +1,8 @@
+## Problem Statement
+
+Implement two classes: `Car` and `Boat` to handle different types of vehicles and return a formatted string describing their maximum speed.
+
+### Input
+- `Car` constructor: Takes two arguments — maximum speed and the unit (either "km/h" or "mph").
+- `Boat` constructor: Takes one argument — maximum speed in knots.
+

Beginner Level 📁/Car and Boat/question.md

@@ -0,0 +1,44 @@
+# Define the Car class
+class Car:
+    def __init__(self, max_speed, speed_unit):
+        self.max_speed = max_speed
+        self.speed_unit = speed_unit
+    
+    def __str__(self):
+        return f"Car with the maximum speed of {self.max_speed} {self.speed_unit}"
+
+# Define the Boat class
+class Boat:
+    def __init__(self, max_speed):
+        self.max_speed = max_speed
+    
+    def __str__(self):
+        return f"Boat with the maximum speed of {self.max_speed} knots"
+
+# Main function to take input and process the queries
+if __name__ == '__main__':
+    q = int(input("Enter the number of queries: "))  # Number of queries
+    for _ in range(q):
+        args = input("Enter the vehicle type and its details: ").split()  # Input query
+        vehicle_type, params = args[0], args[1:]
+        
+        if vehicle_type == "car":
+            max_speed, speed_unit = int(params[0]), params[1]
+            vehicle = Car(max_speed, speed_unit)
+        elif vehicle_type == "boat":
+            max_speed = int(params[0])
+            vehicle = Boat(max_speed)
+        else:
+            raise ValueError("Invalid vehicle type")
+        
+        # Print the string representation of the vehicle
+        print(vehicle)
+
+
+
+#Input example
+#Enter the number of queries: 2
+#Enter the vehicle type and its details: car 120 km/h
+#Car with the maximum speed of 120 km/h
+#Enter the vehicle type and its details: boat 82
+#Boat with the maximum speed of 82 knots

Beginner Level 📁/Car and Boat/solution.py

@@ -0,0 +1,4 @@
+function curcumfrence(r){
+  console.log(Math.PI * r*r)
+}
+curcumfrence(prompt("Please enter a number "))

Beginner Level 📁/Circle/Answer.js

@@ -0,0 +1,22 @@
+# Problem Description
+Aryan is a small kid, and the circle is his favorite shape. Whenever he gets a number, he tries to find the area of a circle whose radius is that given number.
+
+You are given a number `r` as an argument denoting the radius of the circle. You need to implement the function `findAreaOfCircle` which will return a number equal to the area of the circle with radius `r`. Given radius is always greater than 0.
+
+**Hint 1:** The area of a circle is calculated using the formula: `Area = π * r * r` (where `r` is the radius of the circle).
+
+**Hint 2:** Use `Math.PI` to get the value of pi.
+
+
+## Sample Input
+```plaintext
+3
+```
+
+## Sample Output
+```plaintext
+28.274333882308138
+```
+
+**Explanation:**
+Area of the circle = `Math.PI * 3 * 3 = 28.274333882308138`

Beginner Level 📁/Circle/Problem.md

@@ -0,0 +1,21 @@
+import java.util.*;
+
+public class CountBit {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter a number: ");
+        int n = sc.nextInt(); // Input a number
+        int count = 0;// set a counter
+
+        // Loop to count the set bits in the binary representation of the number
+        while (n > 0) {// Execute loop unlit no until num becomes 0
+            count++;
+            // This operation clears the rightmost set bit in n
+            // Example: n = 1010 & 1001 clears the last '1' in binar
+            n = n & (n - 1);
+        }
+        System.out.println("Total set bits: " + count);
+        sc.close();
+    }
+
+}

Beginner Level 📁/Count Set Bit in Number/CountBit.java

@@ -0,0 +1,43 @@
+## Problem Statement
+Write a Java program to count the number of set bits (1s) in the binary representation of a given non-negative integer.
+
+### Input
+- A single integer `n` where `0 <= n <= 10^9`.
+
+### Output
+- The number of set bits (1s) in the binary representation of the integer.
+
+### Example
+
+#### Example 1:
+**Input**:  
+`5`
+
+**Output**:  
+`2`
+
+**Explanation**:  
+Binary representation of 5 is `101`, which has 2 set bits.
+
+#### Example 2:
+**Input**:  
+`10`
+
+**Output**:  
+`2`
+
+**Explanation**:  
+Binary representation of 10 is `1010`, which has 2 set bits.
+
+#### Example 3:
+**Input**:  
+`0`
+
+**Output**:  
+`0`
+
+**Explanation**:  
+Binary representation of 0 is `0`, which has no set bits.
+
+### Constraints
+- `0 <= n <= 10^9`

Beginner Level 📁/Count Set Bit in Number/question.md

@@ -0,0 +1,13 @@
+You are given a 0-indexed array of integers nums, and an integer target.
+Return the length of the longest subsequence of nums that sums up to target. If no such subsequence exists, return -1.
+A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.
+
+Example 1:
+Input: nums = [1,2,3,4,5], target = 9
+Output: 3
+Explanation: There are 3 subsequences with a sum equal to 9: [4,5], [1,3,5], and [2,3,4]. The longest subsequences are [1,3,5], and [2,3,4]. Hence, the answer is 3.
+
+Example 2:
+Input: nums = [4,1,3,2,1,5], target = 7
+Output: 4
+Explanation: There are 5 subsequences with a sum equal to 7: [4,3], [4,1,2], [4,2,1], [1,1,5], and [1,3,2,1]. The longest subsequence is [1,3,2,1]. Hence, the answer is 4.

Beginner Level 📁/Length_of_the_Longest_Subsequence_That_Sums_to_Target/qustion.md

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Solution
+{
+public:
+    int helper(int i, vector<int> &nums, int target, vector<vector<int>> &dp)
+    {
+        if (target < 0)
+            return -1e5;
+        if (target == 0)
+            return 0;
+        if (i == nums.size())
+            return -1e5;
+
+        if (dp[i][target] != -1)
+            return dp[i][target];
+        int take = 1 + helper(i + 1, nums, target - nums[i], dp);
+        int notTake = helper(i + 1, nums, target, dp);
+        return dp[i][target] = max(take, notTake);
+    }
+    int lengthOfLongestSubsequence(vector<int> &nums, int target)
+    {
+        vector<vector<int>> dp(nums.size() + 1, vector<int>(target + 1, -1));
+        int ans = helper(0, nums, target, dp);
+        if (ans >= -1e5 && ans <= -1e4)
+            return -1;
+        return ans;
+    }
+};

Beginner Level 📁/Length_of_the_Longest_Subsequence_That_Sums_to_Target/solution.cpp

@@ -0,0 +1,35 @@
+### Maximal Score After Applying K Operations
+
+You are given a 0-indexed integer array nums and an integer k. You have a starting score of 0.
+In one operation:
+
+    choose an index i such that 0 <= i < nums.length,
+    increase your score by nums[i], and
+    replace nums[i] with ceil(nums[i] / 3).
+
+Return the maximum possible score you can attain after applying exactly k operations.
+The ceiling function ceil(val) is the least integer greater than or equal to val.
+ 
+### Example 1:
+
+Input: nums = [10,10,10,10,10], k = 5
+Output: 50
+Explanation: Apply the operation to each array element exactly once. The final score is 10 + 10 + 10 + 10 + 10 = 50.
+
+### Example 2:
+
+Input: nums = [1,10,3,3,3], k = 3
+Output: 17
+Explanation: You can do the following operations:
+Operation 1: Select i = 1, so nums becomes [1,4,3,3,3]. Your score increases by 10.
+Operation 2: Select i = 1, so nums becomes [1,2,3,3,3]. Your score increases by 4.
+Operation 3: Select i = 2, so nums becomes [1,1,1,3,3]. Your score increases by 3.
+The final score is 10 + 4 + 3 = 17.
+
+ 
+
+# Constraints:
+
+  -   1 <= nums.length, k <= 105
+  -   1 <= nums[i] <= 109
+