Skip to content

here is my copy. #11

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
KrisLamontagne wants to merge 1 commit into
base: master
Choose a base branch
from
Open

here is my copy. #11

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
90 changes: 81 additions & 9 deletions problem-solving/Program.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,7 @@
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;


namespace problem_solving
{
Expand All @@ -17,56 +18,127 @@ public static long SumArray(IEnumerable<int> arr)
{
// return the sum of all the values in the array
// TODO
return 0;
long sum = 0;
//return arr.Sum();
for (int i = 0; i <= arr.Count() - 1; i++ )
{
sum += arr.ElementAt(i);
}

return sum;
}

public static long SumArrayOddValues(IEnumerable<int> arr)
{
// return the sum of all the values in the array that are odd
// TODO
return 0;

int oddSum = 0;

for (int i = 0; i <= arr.Count() - 1; i++ )
{
if (arr.ElementAt(i) % 2 != 0)
oddSum += arr.ElementAt(i);
}
return oddSum;
}

public static long SumArrayEverySecondValue(IEnumerable<int> arr)
{
// return the sum of every second value in the array. i.e. the 2nd value + the 4th value + the 6th value ...
// TODO
return 0;
int secondValueSum = 0;
int[] intArray = new int[(arr.Count())];

intArray = arr.ToArray();

for (int arrayIndex = 1; arrayIndex <= arr.Count() - 1; arrayIndex += 2)
{
secondValueSum += intArray[arrayIndex];
}
return secondValueSum;
}

public static IEnumerable<int> GetUniqueValues(IEnumerable<int> arr)
{
// return an array that contains only unique values from the passed in array
// TODO
return null;

return arr.Distinct();
}

public static IEnumerable<int> GetArrayIntersect(IEnumerable<int> arrA, IEnumerable<int> arrB)
{
// return an array that contains all the values that are in array A and array B
// TODO
return null;

return Enumerable.Intersect(arrA,arrB);
}

public static IEnumerable<int> GetArrayNotIntersect(IEnumerable<int> arrA, IEnumerable<int> arrB)
{
// return an array that contains all the values that are in array A or array B but not in both array A and array B
// TODO
return null;
return arrA.Except(arrB).Union(arrB.Except(arrA));
}

public static Boolean HasSum(IEnumerable<int> arr, long target)
public static Boolean? HasSum(IEnumerable<int> arr, long target)
{
// return true if any 2 values in the array have a sum equal to the target value
// TODO
return false;

bool? isNull = null;

if (arr == null)
{
throw new NullReferenceException();
}
else
{
int[] intArray = new int[(arr.Count())];

intArray = arr.ToArray();

for (int outerIndex = 0; outerIndex <= arr.Count() - 1; outerIndex++)
{
for (int innerIndex = outerIndex + 1; innerIndex <= arr.Count() - 1; innerIndex++)
{
if (intArray[outerIndex] + intArray[innerIndex] == target)
{
return true;
}
}
}
return false;
}
}

public static long LoneSum(IEnumerable<int> arr)
{
// Given an array of int values, return their sum.
// However, if any of the values is the same as another of the values, it does not count towards the sum.
return 0;

//IEnumerable<int> newArrayToExclude = new IEnumerable<int>[(arr.Count())];
//int excludeIndex = 0;

//intArray = arr.Distinct().ToArray();

//for (int outerIndex = 0; outerIndex <= arr.Count() - 1; outerIndex++)
//{
// for (int innerIndex = outerIndex + 1; innerIndex <= arr.Count() - 1; innerIndex++)
// {
// if (arr.ElementAt(outerIndex) == arr.ElementAt(innerIndex))
// {
// newArrayToExclude[excludeIndex] = intArray[outerIndex];
// excludeIndex++;
// }
// }
//}

//arr = GetArrayNotIntersect(intArray, newArrayToExclude);

//return arr.Sum();

}

public static String DoubleString(String s)
Expand Down