Please have a look

.github/FUNDING.yml

@@ -0,0 +1,4 @@
+# These are supported funding model platforms
+
+github: # [@kasakvaish]
+patreon: # @kasakvaish

.github/workflows/codeql.yml

@@ -0,0 +1,74 @@
+# For most projects, this workflow file will not need changing; you simply need
+# to commit it to your repository.
+#
+# You may wish to alter this file to override the set of languages analyzed,
+# or to provide custom queries or build logic.
+#
+# ******** NOTE ********
+# We have attempted to detect the languages in your repository. Please check
+# the `language` matrix defined below to confirm you have the correct set of
+# supported CodeQL languages.
+#
+name: "CodeQL"
+
+on:
+  push:
+    branches: [ "main" ]
+  pull_request:
+    # The branches below must be a subset of the branches above
+    branches: [ "main" ]
+  schedule:
+    - cron: '36 9 * * 6'
+
+jobs:
+  analyze:
+    name: Analyze
+    runs-on: ubuntu-latest
+    permissions:
+      actions: read
+      contents: read
+      security-events: write
+
+    strategy:
+      fail-fast: false
+      matrix:
+        language: [ 'cpp', 'java', 'python' ]
+        # CodeQL supports [ 'cpp', 'csharp', 'go', 'java', 'javascript', 'python', 'ruby' ]
+        # Learn more about CodeQL language support at https://aka.ms/codeql-docs/language-support
+
+    steps:
+    - name: Checkout repository
+      uses: actions/checkout@v3
+
+    # Initializes the CodeQL tools for scanning.
+    - name: Initialize CodeQL
+      uses: github/codeql-action/init@v2
+      with:
+        languages: ${{ matrix.language }}
+        # If you wish to specify custom queries, you can do so here or in a config file.
+        # By default, queries listed here will override any specified in a config file.
+        # Prefix the list here with "+" to use these queries and those in the config file.
+
+        # Details on CodeQL's query packs refer to : https://docs.github.com/en/code-security/code-scanning/automatically-scanning-your-code-for-vulnerabilities-and-errors/configuring-code-scanning#using-queries-in-ql-packs
+        # queries: security-extended,security-and-quality
+
+
+    # Autobuild attempts to build any compiled languages  (C/C++, C#, or Java).
+    # If this step fails, then you should remove it and run the build manually (see below)
+    - name: Autobuild
+      uses: github/codeql-action/autobuild@v2
+
+    # ℹ️ Command-line programs to run using the OS shell.
+    # 📚 See https://docs.github.com/en/actions/using-workflows/workflow-syntax-for-github-actions#jobsjob_idstepsrun
+
+    #   If the Autobuild fails above, remove it and uncomment the following three lines. 
+    #   modify them (or add more) to build your code if your project, please refer to the EXAMPLE below for guidance.
+
+    # - run: |
+    #   echo "Run, Build Application using script"
+    #   ./location_of_script_within_repo/buildscript.sh
+
+    - name: Perform CodeQL Analysis
+      uses: github/codeql-action/analyze@v2
+      with:
+        category: "/language:${{matrix.language}}"

.github/workflows/greetings.yml

@@ -0,0 +1,16 @@
+name: Greetings
+
+on: [pull_request_target, issues]
+
+jobs:
+  greeting:
+    runs-on: ubuntu-latest
+    permissions:
+      issues: write
+      pull-requests: write
+    steps:
+    - uses: actions/first-interaction@v1
+      with:
+        repo-token: ${{ secrets.GITHUB_TOKEN }}
+        issue-message: "Message that will be displayed on users' first issue"
+        pr-message: "Message that will be displayed on users' first pull request"

.gitignore

@@ -1044,4 +1044,7 @@ dkms.conf
 # Raspberry Pi Pico disassembler file
 *.dis
 
-*:tests
+*:tests
+*.out
+
+Dockerfile

0072-edit-distance.cpp

@@ -0,0 +1,36 @@
+class Solution {
+public:
+
+    int f(string word1, string word2,int i,int j,vector<vector<int>>&dp){
+        if(i<0) return j+1;
+        if(j<0) return i+1;
+        if(dp[i][j]!=-1) return dp[i][j];
+        if(word1[i]==word2[j]){
+            return dp[i][j] = 0 + f(word1,word2,i-1,j-1,dp); 
+        }
+        return dp[i][j] = 1 + min(f(word1,word2,i-1,j,dp),min(f(word1,word2,i-1,j-1,dp),f(word1,word2,i,j-1,dp)));
+    }
+
+
+    int minDistance(string word1, string word2) {
+        int n= word1.size();
+        int m = word2.size();
+        vector<vector<int>>dp(word1.size()+1,vector<int>(word2.size()+1,-1));
+        for(int i=0;i<=n;i++){
+            dp[i][0]=i;
+        }
+        for(int j=0;j<=m;j++){
+            dp[0][j]=j;
+        }
+        for(int i=1;i<=n;i++){
+            for(int j=1;j<=m;j++){
+              if(word1[i-1]==word2[j-1]){
+                dp[i][j] = 0 + dp[i-1][j-1]; 
+        }
+        else
+        dp[i][j] = 1 + min(dp[i-1][j],min(dp[i-1][j-1],dp[i][j-1]));  
+            }
+        }
+        return dp[n][m];
+    }
+};

0202-happy-number.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    bool isHappy(int n) {
+        if(n == 1)
+            return true;
+        if(n > 1 && n <= 4)
+            return false;
+
+        int sum = 0;
+        while(n > 0) {    
+            int m = n % 10;    
+            sum = sum + (m * m);    
+            n = n / 10;
+        }
+
+        return isHappy(sum);
+    }
+};

1-two-sums.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        vector<int>result;
+        for(int i =0;i<nums.size();i++){
+            for(int j =i+1;j<nums.size();j++){
+                if(nums[i]+nums[j]==target){
+                    result.push_back(i);
+                    result.push_back(j);
+                }
+            }
+        }
+        return result;
+    }
+};

108_Convert_Sorted_Array_to_Binary_Search_Tree.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <bits/stdc++.h>
+#include <cmath>
+
+using namespace std;
+
+class Solution
+{
+public:
+    TreeNode *sortedArrayToBST(vector<int> &nums)
+    {
+        return helper(nums, 0, nums.size() - 1);
+    }
+
+    TreeNode *helper(vector<int> &nums, int left, int right)
+    {
+
+        // base case
+        // If the left pointer crosses right return null;
+        if (left > right)
+        {
+            return NULL;
+        }
+
+        // as middle of the array will be the root node
+        int mid = (left + right) / 2;
+        TreeNode *temp = new TreeNode(nums[mid]);
+
+        // left part from middle will be left subtree
+        temp->left = helper(nums, left, mid - 1);
+
+        // right part of array will be right subtree
+        temp->right = helper(nums, mid + 1, right);
+        return temp;
+    }
+};

1207_Unique_Number_Of_Occurrences.cpp

@@ -0,0 +1,24 @@
+// https://leetcode.com/problems/unique-number-of-occurrences/
+
+class Solution {
+public:
+    bool uniqueOccurrences(vector<int>& arr) {
+        bool flag{true};
+        map<int,int> m;
+        for(int i{0}; i<arr.size(); ++i){
+            m[arr.at(i)]++;
+        }
+        vector<int> count;
+        for(auto val : m){
+            count.push_back(val.second);
+        }
+        sort(count.begin(),count.end());
+        for(int i{0}; i<count.size()-1; ++i){
+            if(count.at(i) == count.at(i+1)){
+                flag = false;
+                break;
+            }
+        }
+        return flag;
+    }
+};

1232. Check If It Is a Straight Line.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    bool checkStraightLine(vector<vector<int>>& a) {
+        int i, n, val, x, y;
+        n = a.size();
+        x = a[1][0] - a[0][0];
+        y = a[1][1] - a[0][1];
+        for(i=0; i<n; i++) {
+            if((a[i][1] - a[0][1]) * x != (a[i][0] - a[0][0]) * y) return 0;
+        }
+        return 1;
+    }
+};