IBM Interview Questions

Salome L. - "SELECT MIN(id) AS id, TRIM(LOWER(email)) AS cleaned_email FROM users GROUP BY cleaned_email ORDER BY id `"See full answer

Mohammedsiraj A. - " Here is the breakdown of the information in those images: \\1. The Amharic Letter (Financial Request)\** This is a formal letter from the \Dawa Zone Muslim Affairs Council\\ addressed to the \\Commercial Bank of Ethiopia (CBE)\. \Date:\\ 30/6/2018 (Ethiopian Calendar) \\Subject:\\ Opening a savings account. \\Purpose:\\ The letter requests the opening of a savings account for \\Nuur Mosque\**, located in Bale Zone, Dawa City. \Authorized Signatories:\\"See full answer

Gaston B. - "Use a representative of each, e.g. sort the string and add it to the value of a hashmap> where we put all the words that belong to the same anagram together."See full answer

Kofi N. - "const mergeIntervals = (intervals) => { const compare = (a, b) => { if(a[0] b[0]) return 1 else if(a[0] === b[0]) { return a[1] - b[1] } } let current = [] const result = [] const sorted = intervals.sort(compare) for(let i = 0; i = b[0]) current[1] = b[1] els"See full answer

Avon T. - "Initialize left pointer: Set a left pointer left to 0. Iterate through the array: Iterate through the array from left to right. If the current element is not 0, swap it with the element at the left pointer and increment left. Time complexity: O(n). The loop iterates through the entire array once, making it linear time. Space complexity: O(1). The algorithm operates in-place, modifying the input array directly without using additional data structures. "See full answer

Gundala tarun,cse2020 V. - "#include // Naive method to find a pair in an array with a given sum void findPair(int nums[], int n, int target) { // consider each element except the last for (int i = 0; i < n - 1; i++) { // start from the i'th element until the last element for (int j = i + 1; j < n; j++) { // if the desired sum is found, print it if (nums[i] + nums[j] == target) { printf("Pair found (%d, %d)\n", nums[i], nums[j]); return; } } } // we reach here if the pair is not found printf("Pair not found"); } "See full answer

Alessandra L. - "My answer followed the framework: Users -> Goals -> Main Tasks -> Requirements -> Design -> Implementation -> Launch"See full answer