/C#/Automatic time complexity Calculator

Automatic time complexity Calculator

package NewPackage;

import java.util.HashMap;

public class AppleCodingQues {
    public boolean isAnagram(String str1,String str2)
    {
      str1= toLowerCase(str1);
      str2 = toLowerCase(str2);
      return countCheck(str1).equals(countCheck(str2));

    }
     public HashMap<Character,Integer> countCheck(String str)
    {
        HashMap<Character,Integer> hs = new HashMap<>();
        char[] arr = str.toCharArray();
        for(int i=0;i<str.length();i++)
        {
            if(hs.containsKey(str.charAt(i))){
               int a= hs.get(str.charAt(i));
               hs.put(str.charAt(i),a+1);
            }
            else{
                hs.put(str.charAt(i),1);
            }
        }
        return hs;
    }

    public String toLowerCase(String str)
    {
        int len = str.length();
        char[] arr = str.toCharArray();
        for(int i=0;i<len;i++)
        {
            if((int)arr[i]<97)
            {
                arr[i]=(char)((int)arr[i]+26+6);

            }
        }
        return String.valueOf(arr);

    }

    public static void main(String args[])
    {
        AppleCodingQues ap = new AppleCodingQues();
        System.out.println(ap.isAnagram("trtt","trt"));

    }
}

Automatic time complexity Calculator

void function(int n){
int i=1, s=1;
while(s<=n){
i++;
s+=i;
cout << "*"
}
}

Automatic time complexity Calculator

s=0;
for (i = 0; i < n; i++)
  for (j = 0; j < i; j++)
    s++;

Automatic time complexity Calculator

int i=1, s=1;
while(s<=n){
i++;
s+=i;
cout << "*"
}

Automatic time complexity Calculator

  public static void sort012(int a[], int n)
    {
        // code here 
        int z=0,o=0,t=0;

            if(a[i]==0) z++;
            if(a[i]==1) o++;
            if(a[i]==2) t++;
        }
        int k=z+o+t;
        int i=0;
        for(;i<z;i++){
            a[i]=0;
        }
         for(int j=0;j<o;j++){
            a[i++]=1;
        }
         for(int m=0;m<t;m++){
            a[i++]=2;
        }

Time complexity calculator online

pip install big-O-calculator

-1

Source: pypi.org

Similar codes

0 vote347 views1 answer
How to truncate a decimal without rounding
C#
0 vote326 views1 answer
Open API support for ASP.NET Core Minimal API
C#
4 votes323 views1 answer
Instantiate list C#
C#
130 votes554 views6 answers
Generate random number c#
C#
0 vote331 views1 answer
Force asp.net https
C#
0 vote308 views1 answer
Largest prime factor of a number
C#
1 vote327 views1 answer
Wpf numeric only textbox
C#
0 vote316 views4 answers
How to get c# code of aspx page
C#
0 vote293 views3 answers
C# code examples
C#
1 vote316 views1 answer
C# read lines number 3 from string
C#