Missing Number
As a Systems Engineer at Tata Consultancy Services, I deliver exceptional software products for mobile and web platforms, using agile methodologies and robust quality maintenance. I am experienced in performance testing, automation testing, API testing, and manual testing, with various tools and technologies such as Jmeter, Azure LoadTest, Selenium, Java, OOPS, Maven, TestNG, and Postman.
I have successfully developed and executed detailed test plans, test cases, and scripts for Android and web applications, ensuring high-quality standards and user satisfaction. I have also demonstrated my proficiency in manual REST API testing with Postman, as well as in end-to-end performance and automation testing using Jmeter and selenium with Java, TestNG and Maven. Additionally, I have utilized Azure DevOps for bug tracking and issue management.
Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
LeetCode Problem: Link | Click Here
class Solution {
public int missingNumber(int[] nums) {
// Create an ArrayList to hold elements from the input array
ArrayList<Integer> al = new ArrayList<>();
// Add all elements from the input array to the ArrayList
for (int e : nums) {
al.add(e);
}
// Sort the input array
Arrays.sort(nums);
// Set the initial value for the missing number to the length of the array
int lastArrayVal = nums.length;
// Iterate through the sorted array
for (int i = 0; i < nums.length; i++) {
// Check if the ArrayList contains the current value from 'lastArrayVal'
if (al.contains(lastArrayVal)) {
lastArrayVal--; // Decrement 'lastArrayVal' if the value is found in the ArrayList
} else {
break; // If there's a missing value, exit the loop
}
}
// Ensure 'lastArrayVal' is not negative and return it as the missing number
return Math.max(lastArrayVal, 0);
}
}
