Skip to main content

Top Software Engineer Interview Questions

Review this list of 715 Software Engineer interview questions and answers verified by hiring managers and candidates.
  • Amazon logoAsked at Amazon 
    1 answer

    "CIDR (Classless Inter-Domain Routing) -- also known as supernetting -- is a method of assigning Internet Protocol (IP) addresses that improves the efficiency of address distribution and replaces the previous system based on Class A, Class B and Class C networks."

    Ali H. - "CIDR (Classless Inter-Domain Routing) -- also known as supernetting -- is a method of assigning Internet Protocol (IP) addresses that improves the efficiency of address distribution and replaces the previous system based on Class A, Class B and Class C networks."See full answer

    Software Engineer
    Technical
  • Meta logoAsked at Meta 
    Add answer
    Software Engineer
    Data Structures & Algorithms
    +1 more
  • Apple logoAsked at Apple 
    1 answer

    "public class HashMap { public class Element { T key; V value; Element(T k, V v) { this.key = k; this.value = v; } } private static final int DEFAULT_CAPACITY = 16; private static final float LOAD_FACTOR = 0.75f; private LinkedList[] table = new LinkedList[DEFAULT_CAPACITY]; private int size = 0; private int threshold = (int) (DEFAULTCAPACITY * LOADFACTOR); public void put(T k"

    Md kamrul H. - "public class HashMap { public class Element { T key; V value; Element(T k, V v) { this.key = k; this.value = v; } } private static final int DEFAULT_CAPACITY = 16; private static final float LOAD_FACTOR = 0.75f; private LinkedList[] table = new LinkedList[DEFAULT_CAPACITY]; private int size = 0; private int threshold = (int) (DEFAULTCAPACITY * LOADFACTOR); public void put(T k"See full answer

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

  • Nvidia logoAsked at Nvidia 
    1 answer

    "Clarifying When we say cloud gaming, we refer to a video gaming experience using cloud computing, right? Assumption: Yes. Understanding of cloud computing first. I'll use some analogies: Imagine you are looking to do heavy computing but don't have a powerful CPU and GPU. CPU and GPU are like your big calculators. You can buy a powerful CPU and GPU, but problems: It costs a lot to buy. It costs a lot to run. You don't need it 24-7. You are not a un"

    Darpan D. - "Clarifying When we say cloud gaming, we refer to a video gaming experience using cloud computing, right? Assumption: Yes. Understanding of cloud computing first. I'll use some analogies: Imagine you are looking to do heavy computing but don't have a powerful CPU and GPU. CPU and GPU are like your big calculators. You can buy a powerful CPU and GPU, but problems: It costs a lot to buy. It costs a lot to run. You don't need it 24-7. You are not a un"See full answer

    Software Engineer
    Concept
    +3 more
  • Salesforce logoAsked at Salesforce 
    1 answer

    "String commonStr(String str1, String str2) { int len1 = str1.length(); int len2 = str2.length(); if (len1 == 0 || len2 == 0) return ""; // let dpx reprsent the longest common str of 0...x int dp = new int len1 + 1; int maxLen = 0; int endIndex = 0; for (int i = 1; i <= len1; i++) { for (int j = 1; j <= len2; j++) { if (str1.charAt(i-1) == str2.charAt(j-1)) { dpi = dpi-1 + 1; "

    Anonymous Eel - "String commonStr(String str1, String str2) { int len1 = str1.length(); int len2 = str2.length(); if (len1 == 0 || len2 == 0) return ""; // let dpx reprsent the longest common str of 0...x int dp = new int len1 + 1; int maxLen = 0; int endIndex = 0; for (int i = 1; i <= len1; i++) { for (int j = 1; j <= len2; j++) { if (str1.charAt(i-1) == str2.charAt(j-1)) { dpi = dpi-1 + 1; "See full answer

    Software Engineer
    Data Structures & Algorithms
    +1 more
  • Apple logoAsked at Apple 
    Add answer
    Software Engineer
  • Mastercard logoAsked at Mastercard 
    Add answer
    Software Engineer
  • Accenture logoAsked at Accenture 
    2 answers

    "class Solution: def missingNumber(self, nums: list[int]) -> int: Sorting approach n = len(nums) s = n*(n+1)//2 r = s - sum(nums) return self.r l = [3,0,1] print(missingNumber(l))"

    Rohit B. - "class Solution: def missingNumber(self, nums: list[int]) -> int: Sorting approach n = len(nums) s = n*(n+1)//2 r = s - sum(nums) return self.r l = [3,0,1] print(missingNumber(l))"See full answer

    Software Engineer
    Data Structures & Algorithms
    +1 more
  • Lyft logoAsked at Lyft 
    1 answer
    Software Engineer
    Data Structures & Algorithms
    +1 more
  • Amazon logoAsked at Amazon 
    Add answer
    Software Engineer
    Behavioral
  • Microsoft logoAsked at Microsoft 
    1 answer

    "Interviewer wanted to learn more about architecture and or scalability. But I was not sure what the expected answer was"

    Mridul J. - "Interviewer wanted to learn more about architecture and or scalability. But I was not sure what the expected answer was"See full answer

    Software Engineer
    Behavioral
  • Discord logoAsked at Discord 
    Add answer
    Software Engineer
    Behavioral
    +4 more
  • Accenture logoAsked at Accenture 
    3 answers

    "NA"

    Gaddipati V. - "NA"See full answer

    Software Engineer
    Data Structures & Algorithms
    +1 more
  • Amazon logoAsked at Amazon 
    Add answer
    Software Engineer
    Behavioral
    +2 more
  • Amazon logoAsked at Amazon 
    1 answer

    "Understanding the Basics Choosing Learning Resources Practicing and Applying Knowledge Seeking Help and Staying Updated Leveraging Modern Tools"

    An D. - "Understanding the Basics Choosing Learning Resources Practicing and Applying Knowledge Seeking Help and Staying Updated Leveraging Modern Tools"See full answer

    Software Engineer
    Behavioral
  • New York Times logoAsked at New York Times 
    1 answer

    "input = [ {"topic": 1, "chapter": 1, "section": 1}, {"topic": 2, "chapter": 2, "section": 1}, {"topic": 3, "chapter": 2, "section": 2}, {"topic": 4, "chapter": 1, "section": 1}, {"topic": 5, "chapter": 1, "section": 1}, {"topic": 6, "chapter": 2, "section": 2}, {"topic": 7, "chapter": 2, "section": 2}, {"topic": 8, "chapter": 2, "section": 3}, ] expected_output = [ {'chapter': 1, 'sections': [ {'section': 1, 'topics': [ {'top"

    Anonymous Unicorn - "input = [ {"topic": 1, "chapter": 1, "section": 1}, {"topic": 2, "chapter": 2, "section": 1}, {"topic": 3, "chapter": 2, "section": 2}, {"topic": 4, "chapter": 1, "section": 1}, {"topic": 5, "chapter": 1, "section": 1}, {"topic": 6, "chapter": 2, "section": 2}, {"topic": 7, "chapter": 2, "section": 2}, {"topic": 8, "chapter": 2, "section": 3}, ] expected_output = [ {'chapter': 1, 'sections': [ {'section': 1, 'topics': [ {'top"See full answer

    Software Engineer
    Data Structures & Algorithms
    +1 more
  • Bolt logoAsked at Bolt 
    1 answer

    "import re def naturalsortkey(s): Split the string into a list of text and numbers "item10" -> ["item", 10] return [int(text) if text.isdigit() else text.lower() for text in re.split(r'(\d+)', s)] def natural_sort(arr): return sorted(arr, key=naturalsortkey) \# Example Usage data = ["item10", "item2", "item1", "item20", "2nd item", "1st item"] sorteddata = naturalsort(data) print(f"Standard Sort: {sorted(data)}") print(f"Natural Sort: {sorted_data}") "

    Yitayal B. - "import re def naturalsortkey(s): Split the string into a list of text and numbers "item10" -> ["item", 10] return [int(text) if text.isdigit() else text.lower() for text in re.split(r'(\d+)', s)] def natural_sort(arr): return sorted(arr, key=naturalsortkey) \# Example Usage data = ["item10", "item2", "item1", "item20", "2nd item", "1st item"] sorteddata = naturalsort(data) print(f"Standard Sort: {sorted(data)}") print(f"Natural Sort: {sorted_data}") "See full answer

    Software Engineer
    Data Structures & Algorithms
    +1 more
  • Amazon logoAsked at Amazon 
    1 answer

    "Use a min-heap or sort the array, either method works"

    Kwaku K. - "Use a min-heap or sort the array, either method works"See full answer

    Software Engineer
    Technical
Showing 461-480 of 715
Exponent

Get updates in your inbox with the latest tips, job listings, and more.

Follow Us

Products
Courses
Interview Questions
Interview Experiences
Popular articles
Guides
Coaching
For Partners
Company
Exponent © 2026
Terms of Service | Privacy