Skip to main content

Intel Interview Questions

Review this list of 5 Intel interview questions and answers verified by hiring managers and candidates.
  • Intel logoAsked at Intel 
    34 answers
    +28

    "Idea for solution: Reverse the complete char array Reverse the words separated by space. i.e. Find the space characters and the reverse the subarray between two space characters. vector reverseSubarray(vector& arr, int s, int e) { while (s reverseWords(vector& arr ) { int n = arr.size(); reverse(arr, 0, n - 1"

    Rahul M. - "Idea for solution: Reverse the complete char array Reverse the words separated by space. i.e. Find the space characters and the reverse the subarray between two space characters. vector reverseSubarray(vector& arr, int s, int e) { while (s reverseWords(vector& arr ) { int n = arr.size(); reverse(arr, 0, n - 1"See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Intel logoAsked at Intel 
    24 answers
    +21

    " def is_valid(s: str) -> bool: openBracket = set() openBracket.add('{') openBracket.add('(') openBracket.add('[') stack = [] for c in s: if stack and (c == ')' and stack[len(stack)-1] == '(')\ or\ (c == '}' and stack[len(stack)-1] == '{')\ or\ (c == ']' and stack[len(stack)-1] == '['): stack.pop() elif c in openBracket: stack.append(c) else: retu"

    Aikya S. - " def is_valid(s: str) -> bool: openBracket = set() openBracket.add('{') openBracket.add('(') openBracket.add('[') stack = [] for c in s: if stack and (c == ')' and stack[len(stack)-1] == '(')\ or\ (c == '}' and stack[len(stack)-1] == '{')\ or\ (c == ']' and stack[len(stack)-1] == '['): stack.pop() elif c in openBracket: stack.append(c) else: retu"See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Intel logoAsked at Intel 
    53 answers
    +49

    "function twoSum(nums, target) { const n = nums.length const map = new Map() for (let i=0; i<n; i++) { if (map.has(nums[i])) return [map.get(nums[i]), i] const diff = target - nums[i] map.set(diff, i) } return [] } `"

    Maciej Z. - "function twoSum(nums, target) { const n = nums.length const map = new Map() for (let i=0; i<n; i++) { if (map.has(nums[i])) return [map.get(nums[i]), i] const diff = target - nums[i] map.set(diff, i) } return [] } `"See full answer

    Software Engineer
    Data Structures & Algorithms
    +5 more
  • Intel logoAsked at Intel 
    Add answer
    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Intel logoAsked at Intel 
    13 answers
    +10

    "def traprainwater(height: List[int]) -> int: n = len(height) totalwaterlevel = 0 for i in range(n): j = i+1 while j = n: break rows = j - i -1 intrwaterlevel = min(height[j], height[i]) * rows for k in range(i+1, j): intrwaterlevel -= height[k] totalwaterlevel += intrwaterlevel i = j return totalwaterlevel"

    Manoj R. - "def traprainwater(height: List[int]) -> int: n = len(height) totalwaterlevel = 0 for i in range(n): j = i+1 while j = n: break rows = j - i -1 intrwaterlevel = min(height[j], height[i]) * rows for k in range(i+1, j): intrwaterlevel -= height[k] totalwaterlevel += intrwaterlevel i = j return totalwaterlevel"See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
  • 🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.

Showing 1-5 of 5