Move History

Fork Selected
  • Code
    int findMissingNumber(int arr[], int n)
    {
      int exp = (n + 2) * (n + 1) / 2, act = 0;
      for (int i = 0; i < n; i++) act += arr[i];    
      return exp - act;
    }
    Test Cases
    #include <criterion/criterion.h>
    
    // Function to find the missing number in an array of integers
    int findMissingNumber(int arr[], int n);
    
    Test(findMissingNumber, should_return_5_for_given_array)
    {
      int arr[] = {1, 2, 3, 4, 6, 7, 8, 9, 10};
      int n = sizeof(arr) / sizeof(arr[0]);
      cr_assert_eq(findMissingNumber(arr, n), 5);
    }
    
    Test(findMissingNumber, should_return_2_for_given_array)
    {
      int arr[] = {1, 3, 4, 5};
      int n = sizeof(arr) / sizeof(arr[0]);
      cr_assert_eq(findMissingNumber(arr, n), 2);
    }
  • Code
    • class Solution {
    • public:
    • int missingNumber(vector<int>& nums) {
    • }
    • };
    • int findMissingNumber(int arr[], int n)
    • {
    • int exp = (n + 2) * (n + 1) / 2, act = 0;
    • for (int i = 0; i < n; i++) act += arr[i];
    • return exp - act;
    • }
    Test Cases
    • #include <criterion/criterion.h>
    • // Function to find the missing number in an array of integers
    • int findMissingNumber(int arr[], int n) {
    • // Code to find the missing number
    • }
    • int findMissingNumber(int arr[], int n);
    • Test(findMissingNumber, should_return_5_for_given_array) {
    • int arr[] = {1, 2, 3, 4, 6, 7, 8, 9, 10};
    • int n = sizeof(arr) / sizeof(arr[0]);
    • cr_assert_eq(findMissingNumber(arr, n), 5);
    • Test(findMissingNumber, should_return_5_for_given_array)
    • {
    • int arr[] = {1, 2, 3, 4, 6, 7, 8, 9, 10};
    • int n = sizeof(arr) / sizeof(arr[0]);
    • cr_assert_eq(findMissingNumber(arr, n), 5);
    • }
    • Test(findMissingNumber, should_return_2_for_given_array) {
    • int arr[] = {1, 3, 4, 5};
    • int n = sizeof(arr) / sizeof(arr[0]);
    • cr_assert_eq(findMissingNumber(arr, n), 2);
    • Test(findMissingNumber, should_return_2_for_given_array)
    • {
    • int arr[] = {1, 3, 4, 5};
    • int n = sizeof(arr) / sizeof(arr[0]);
    • cr_assert_eq(findMissingNumber(arr, n), 2);
    • }