We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 27: Testing
  5. Discussions

Day 27: Testing

Sort by

recency

|

222 Discussions

|

  • jaykipkerich
     + 0 comments

    python

        class TestDataEmptyArray:
            def get_array():
                    return []

class TestDataUniqueValues:
        def get_array():
                return [9, 1]

        def get_expected_result():
                return 1

class TestDataExactlyTwoDifferentMinimums():
        def get_array():
                return[1,1,2]

        def get_expected_result():
                return 0

  • jakepomg94
     + 0 comments

    JAVA 8

    static Random rand = new Random();

public static class TestDataEmptyArray
{
    public static int[] get_array()
    {
        return new int[0];
    }

}

public static class TestDataUniqueValues
{
    static int[] arr;

    public static int[] get_array()
    {
        int bound = rand.nextInt(100) + 2;
        arr = new int[bound];
        Set<Integer> set = new HashSet<>();

        while (set.size() < bound)
        {
            set.add(rand.nextInt(100000));
        }

        arr = set.stream().mapToInt(Integer::intValue).toArray();

        return arr;
    }

    public static int get_expected_result()
    {
        int min_index = 0;

        for (int i = 1; i < arr.length; i++)
        {
            if (arr[i] < arr[min_index])
            {
                min_index = i;
            }
        }

        return min_index;
    }
}

public static class TestDataExactlyTwoDifferentMinimums
{
    static int[] arr;

    public static int[] get_array()
    {
        int bound = rand.nextInt(100) + 2;
        arr = new int[bound];
        Set<Integer> set = new HashSet<>();

        while (set.size() < bound - 1)
        {
            set.add(rand.nextInt(100000));
        }

        arr = set.stream().mapToInt(Integer::intValue).toArray();

        Arrays.sort(arr);
        arr[arr.length - 1] = arr[0];

        return arr;
    }

    public static int get_expected_result()
    {
        int min_index = 0;

        for (int i = 1; i < arr.length; i++)
        {
            if (arr[i] < arr[min_index])
            {
                min_index = i;
            }
        }

    I wanted to go off track and use abstract classes, but everything ended up being more straightforward than I expected, haha.

            return min_index;
    }
}

  • jakepomg94
     + 0 comments

    Where is C# for this problem?

  • dhankov93
     + 0 comments

    Looking for the latest NEET results and top-notch exam resources? Check out NEET coaching Institute in Maduravoyal for all the updates you need!

  • n4m774r_d
     + 0 comments
    from random import randint

class TestDataEmptyArray():
    @staticmethod
    def get_array():
        return []

class TestDataUniqueValues():
    _seq = []
    @staticmethod
    def get_array():
        random = randint(3,11)
        TestDataUniqueValues._seq = [i for i in range(0,random)]
        return TestDataUniqueValues._seq

    @staticmethod
    def get_expected_result():
         return TestDataUniqueValues._seq.index(min(TestDataUniqueValues._seq))
### had to shorten next class name cause of spam blocker###

class TestDataExactlyTwoDiffMin():
    _seq = []
    @staticmethod
    def get_array():
        random = randint(3,11)
        TestDataExactlyTwoDiffMin._seq = [i for i in range(0,random)]
        TestDataExactlyTwoDiffMin._seq.insert(0,TestDataExactlyTwoDiffMin._seq[0])
        return TestDataExactlyTwoDiffMin._seq
    @staticmethod
    def get_expected_result():
        diff2 = TestDataExactlyTwoDiffMin._seq
        return diff2.index(min(diff2))
``