Top Software Engineer Interview Questions

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

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

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

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

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

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

Gaddipati V. - "NA"See full answer

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

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

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

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