Contains Duplicate

                        
                        
public class Solution {
    public bool hasDuplicate(int[] nums) {

        Array.Sort(nums);

        for (int i = 1; i < nums.Length; i++)
            if (nums[i] == nums[i-1])
                return true;
        return false;


    }
}                    
                    
                
                    

Valid Anagram

                    
                
public class Solution {
    public int[] TwoSum(int[] nums, int target) {

        int[] sum_indices = new int[2];

        for (int i = 0; i < nums.Length - 1; i++)
        {
            for (int j = i+1; j < nums.Length ; j++)
            {
                if ((nums[i] + nums[j]) == target)
                {
                    sum_indices[0] = i;
                    sum_indices[1] = j;
                    return sum_indices;
                }
            }
        }
        int[] def = {-1,-1};
        return def;
    }
}
                                                                   
            
        
            

Two Sum

                    
                
public class Solution {
    public bool IsAnagram(string s, string t) {
        if (s.Length != t.Length)
            return false;
                    
        char[] s_letters = new char[t.Length];
        char[] t_letters = new char[t.Length];
        for (int i = 0; i < t.Length; i++)
        {
            s_letters[i] = s[i];
            t_letters[i] = t[i];
            Console.WriteLine(s_letters[i]);
        }
        Array.Sort(s_letters);
        Array.Sort(t_letters);
                    
        for (int i = 0; i < t.Length; i++)
            if (s_letters[i] != t_letters[i])
            return false;
        return true;
    }
}