Write a function to modify a singly linked list, appending copies of the first N-1 elements to the end in reverse order. For example, ['A', 'B', 'C', 'D'] becomes ['A', 'B', 'C', 'D', 'C', 'B', 'A'].
Engineers Interview Questions
840,917 engineers interview questions shared by candidates
There will be a meeting at New York and San Francisco offices. We will have to fly the participants to either one of these two offices. Let's say each office can accommodate half of the participants. Our goal is to assign each participant to an office in a way that the total travel cost for the company is minimized. What is this minimal cost? SF NY A 500 700 B 200 600 C 400 500 D 600 200 Output : 1400 (A:500 + B:200 + C:500 +D: 200)
Find an algorithm to find the largest sum subarray in an array of integers. (Better than O(n^2) ).
Questions were asked to check basic knowledge of OOPS concepts, String manipulation, Data Structures. Not very hard questions but were good enough to check concept.
Count bits in a byte.
PN Diode, Diode Circuits, Amplifiers, Transistors, Zener Diode, Circuit Theory.
If you have a refrigerator in an isolated room (no heat in or out) and left the door to the refrigerator open, what would happen to the temperature to the room? Would it go up, down or say the same?
why r u join this company?
face to face. based on what you say
Python questions: 1. Replace None value with previous value present in a list. 2. Given a ´dictionary, print the key for nth highest value present in the dict. If there are more than 1 record present for nth highest value then sort the key and print the first one. 3. Given two sentences, you have to print the words those are not present in either of the sentences.(If one word is present twice in 1st sentence but not present in 2nd sentence then you have to print that word too) 4. Forgot another question you have to pass all the cases, specially on edge cases. SQL questions: 1. Mostly % calculation, also refer the questions available here in Glassdoor. Next will be my Onsite Interview of 3.30hr. If anyone can help me on that or else I will update later on that interview as well.
Viewing 241 - 250 interview questions