Jobs
Interviews

Cloudera

At Cloudera, we believe that data can make what is impossible today, possible tomorrow. We empower people to transform complex data into clear and actionable insights. Cloudera delivers an enterprise data cloud for any data, anywhere, from the Edge to AI. Powered by the relentless innovation of the open source community, Cloudera advances digital transformation for the world's largest enterprises. Learn more at Cloudera.com. --------------------------------------------------------------------------------- Recruitment Fraud Alert It has come to our attention that job seekers have been contacted about fake job opportunities with Cloudera from individuals fraudulently posing as Cloudera employees. These recruiting fraud schemes often include requests for personal information and payments. Be aware that Cloudera will never request a payment as part of its recruitment process. Additionally, Cloudera will never make a job offer without conducting an interview process. Any information submitted to Cloudera in relation to a job application should only be through our official career portal (https://www.cloudera.com/careers.html). Email communications from Cloudera will come from an email address ending in @cloudera.com. If you are the target of a recruiting scam, consider filing a report with law enforcement authorities. Cloudera is not responsible for fraudulent job offers and/or any claims, damages, expenses, or other inconvenience connected to recruiting scams.

Interview Questions for Cloudera

1. Maximum Subarray Sum Problem Statement Given an array 'ARR' of integers with length 'N', the task is to determine the sum of the subarray (including an empty subarray) that yields the maximum sum among all possible subarrays. Explanation: A subarray is a contiguous segment of an array. In other words, it can be created by removing zero or more elements from the beginning and zero or more elements from the end of the array. Input: NARR[0] ARR[1] ... ARR[N-1] Output: Maximum subarray sum Example: If given: N = 5ARR = [-2, 1, -3, 4, -1] Output would be: 4 As the subarray [4] produces the maximum sum of 4. Constraints: 1 <= N <= 10^6 -10^6 <= A[i] <= 10^6, where A[i] denotes the elements of the array. Note: The sum of an empty subarray is considered to be 0.

2. Tell me about your experience with error and exception handling.

3. Design a cache.

4. On-page SEO optimization

5. Tell me about your experience with Hadoop.