Top Software Engineer Interview Questions

Meenakshi D. - "BETWEEN and HAVING clauses in SQL serve different purposes: 1. BETWEEN Clause Used to filter rows based on a range of values. Works with numeric, date, or text values. Can be used with WHERE or HAVING clauses. The range includes both lower and upper bounds. Example: Filtering employees with salaries between 30,000 and 50,000 `SELECT * FROM Employees WHERE salary BETWEEN 30000 AND 50000;` 2. HAVING Clause Used to filter **groups"See full answer

Nilay B. - "int reverse(int x) { int rev = 0; bool isNegative = false; if(x 0){ int r = x % 10; rev = rev * 10 + r; x = x / 10; } if(isNegative){ return -rev; } return rev; } `"See full answer

Bhavya V. - "we can create 2 sets for rows and columns and store the rows and column having 0 and then just check in a loop if the count of that row is greater than 0 llly for column then put the row and column to zero"See full answer

Louisa C. - "I think AI such as ChatGPT seemed to spit out its answers fast and instinctively, hence proving its efficiency but in the recent versions it seems to have acquired reasoning skills which was revealed 'transparently' to users. This new, reasoning skills introduce a small delay in its response and explains what it does during the delay but I do not really think that it is "thinking" any differently than before, except that it is constrained by some purported rules when asked to summarise certain b"See full answer

Graig - "Do any one know how to build trie using IP address?"See full answer

Roger R. - "Get data from database CDC to Kafka; Write from Kafka to a Bucket; Send the batch file to Visa from time to time;"See full answer

Farhan -. - "Sorting is a technique to arrange data in either increasing order or decreasing order, and, the function that implements this functionality is called sort function"See full answer

Srihitha J. - "my answer: void* memcpy(void* dest, const void* src, size_t n) { unsigned char* uDest = static_cast(dest); const unsigned char* ucSrc = static_cast(src); for(size_t i= 0; i(dest); const unsigned c"See full answer

Sunil S. - "Inheritance means that inherit the some properties of parent class into the child class. And the another hand composition means its acquire some properties as our request is called composition"See full answer

Prashanth A. - "We are asked to calculate Sum(over value) for time in (t - window_size, t) where key in (key criteria). To develop a function to set this up. Let w be the window size. I would have an observer of some kind note the key-value, and for the first w windows just add the value to a temporary variable in memory if the key meets the key criteria. Then it would delete the oldest value and add the new value if the new key meets the criteria. At each step after "w", we would take the sum / w and store"See full answer

Rishabh N. - "I first asked few clarifying questions like the return array may need not contain the list of building in the same order, to which the interviewer agreed. Then I came up with an approach where we iterate the array from right to left and keep a max variable which will keep the value of the current max. When we find an item which is greater than max we update the max and add this element into our solution. The interviewer agreed for the approach. I discussed few corner scenarios with the interview"See full answer

Rama A. - "1. What is an LFU Cache? An LFU (Least Frequently Used) cache is a memory management system with a fixed capacity. It tracks how often items are accessed and evicts the least popular items when it runs out of space. It has one critical rule and one tie-breaker rule: The Core Rule: When the cache is full and you need to add a new item, you must kick out the item with the lowest access frequency. The Tie-Breaker (LRU): If multiple items share that same lowest frequency"See full answer