Answer: Story -
In 1951, John H. Johnson was selected as Young Man of the Year by the United States Chamber of Commerce. He was the first African-American to receive such honor. In 1966, he received Spingarn Medal by the National Association for the Advancement of Colored People for his contributions in the area of race relations.
Born -
January 19, 1918, Arkansas City, AR
Died -
August 8, 2005, Chicago, IL
Spouse -
Eunice W. Johnson
(married at 1941–2005)
Children -
Linda Johnson Rice, John Harold Johnson
Explanation:
Answer:
The specific type of tools that can assist teams by identifying attacks and indicators of compromise by collecting, aggregating, and correlating log and alert data from routers, firewalls, IDS/IPS, endpoint logs, Web filtering devices, and other security issues are:
1. Arachni
2. Grabber
3. Iron wasp
4. Nogotofail
5. SonarQube
6. SQLMap
7. W3af
8. Wapiti
9. Wfuzz
10. ZedAttack Proxy Zap
Explanation:
The testing tool is capable of uncovering a number of vulnerabilities, to scan small web applications, to uncover over 25 types of web application vulnerabilities, to detect TLS/SSL vulnerabilities and misconfigurations, to measure the source code quality of a web application, to detect and utilize SQL injection vulnerability in a website’s database, to find over 200 types of security issues in web applications, to check web applications for security vulnerabilities.
The security testing tool supports command-line access for advanced users can also be used to intercept a proxy for manually testing a webpage.
Answer:
You can simplify the problem down by recognizing that you just need to keep track of the integers you've seen in array that your given. You also need to account for edge cases for when the array is empty or the value you get would be greater than your max allowed value. Finally, you need to ensure O(n) complexity, you can't keep looping for every value you come across. This is where the boolean array comes in handy. See below -
public static int solution(int[] A)
{
int min = 1;
int max = 100000;
boolean[] vals = new boolean[max+1];
if(A.length == 0)
return min;
//mark the vals array with the integers we have seen in the A[]
for(int i = 0; i < A.length; i++)
{
if(A[i] < max + 1)
vals[A[i]] = true;
}
//start at our min val and loop until we come across a value we have not seen in A[]
for (int i = 1; i < max; i++)
{
if(vals[i] && min == i)
min++;
else if(!vals[i])
break;
}
if(min > max)
return max;
return min;
}
Answer:
The correct answer is A.
Explanation:
I put D from the answer above and got it wrong and it said A was the correct answer. haha :)
