Ad
Algorithms

Make a function that looks for a duplicate number in an array.
For example [2,3,4,5,2] returns 2
The Intergers Allowed are [1, 2, 3, 4, 5, 6]

class Kumite
{
  public static function findduplicatenumber(nums:Array<Int>)   
  {
    var turtle = nums[0];
    var rabbit = nums[0];
    while (true)
    {
      turtle = nums[turtle];
      rabbit = nums[nums[rabbit]];
      if (turtle == rabbit)
      {
        break;
      }  
    }  
    var ptr1 = nums[0];
    var ptr2 = turtle;
    while (ptr1 != ptr2)
    {
      ptr1 = nums[ptr1];
      ptr2 = nums[ptr2];
    }  
    return ptr1;
  }
}

Some code that returns the length of an array

class BeginnerKumite
{
  public static function returnlength(A:Array<String>)
  {
    var al = A.length;
    return al;
  }
  
}
Code
Diff
  • class FirstKumite{
      public static function string(n:String) 
      {
         if(n == '')
         {
           n = 'Nothing';
         }    
         return n;
         
        
      }
    }
    • class FirstKumite{
    • public static function helloHaxe(n:String)
    • public static function string(n:String)
    • {
    • if(n == '')
    • {
    • return 'Nothing';
    • }
    • else
    • {
    • return n;
    • }
    • n = 'Nothing';
    • }
    • return n;
    • }
    • }
Code
Diff
  • class FirstKumite{
      public static function helloHaxe(n:String) 
      {
         if(n == '')
         {
           return 'Nothing';
         }  
         else 
         {
           return n;
         }  
      }
    }
    • class FirstKumite{
    • public static function helloHaxe() {return "Hello, World!";}
    • public static function helloHaxe(n:String)
    • {
    • if(n == '')
    • {
    • return 'Nothing';
    • }
    • else
    • {
    • return n;
    • }
    • }
    • }