using System;

using Xunit;

using System.Collections.Generic;

using FluentAssertions;

​

/*

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have EXACTLY ONE SOLUTION, and you may not use the same element twice.

You can return the answer in any order.

​

For example,

Input: nums = [2, 7, 11, 15], target = 9

Output: [0, 1]

Reason: nums[0] + nums[1] == 9

*/

public class Program

{

    public static void Main()

    {

        // Test cases

        TwoSums(new []{2, 7, 11, 15}, 9).Should().ContainInOrder(new []{0, 1});

        TwoSums(new []{3, 2, 4}, 6).Should().ContainInOrder(new []{1, 2});

    }

    public static int[] TwoSums(int[] nums, int target)

    {

        // Add your solution here

        return null;

    }

}