Skip to main content

Intel Coding Interview Questions

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

    "#inplace reversal without inbuilt functions def reverseString(s): chars = list(s) l, r = 0, len(s)-1 while l < r: chars[l],chars[r] = chars[r],chars[l] l += 1 r -= 1 reversed = "".join(chars) return reversed "

    Anonymous Possum - "#inplace reversal without inbuilt functions def reverseString(s): chars = list(s) l, r = 0, len(s)-1 while l < r: chars[l],chars[r] = chars[r],chars[l] l += 1 r -= 1 reversed = "".join(chars) return reversed "See full answer

    Software Engineer
    Coding
    +4 more
  • Intel logoAsked at Intel 
    +20

    " 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
    Coding
    +4 more
  • Intel logoAsked at Intel 
    +47

    "from typing import List def two_sum(nums: List[int], target: int) -> List[int]: prevMap = {} for i, n in enumerate(nums): diff = target - n if diff in prevMap: return [prevMap[diff], i] else: prevMap[n] = i return [] debug your code below print(two_sum([2, 7, 11, 15], 9)) `"

    Anonymous Roadrunner - "from typing import List def two_sum(nums: List[int], target: int) -> List[int]: prevMap = {} for i, n in enumerate(nums): diff = target - n if diff in prevMap: return [prevMap[diff], i] else: prevMap[n] = i return [] debug your code below print(two_sum([2, 7, 11, 15], 9)) `"See full answer

    Software Engineer
    Coding
    +5 more
  • Intel logoAsked at Intel 
    Software Engineer
    Coding
    +4 more
  • Intel logoAsked at Intel 
    +9

    "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
    Coding
    +4 more
  • 🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.

Showing 1-5 of 5