Improve this piece of code, loop tracing, very basic printing problem
Software Engineer Data Interview Questions
438,278 software engineer data interview questions shared by candidates
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'].
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.
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.
Write some pseudo code to raise a number to a power.
Given a set of n jobs with [start time, end time, cost] find a subset so that no 2 jobs overlap and the cost is maximum ?
You have a 2-D array of friends like [[A,B],[A,C],[B,D],[B,C],[R,M], [S],[P], [A]] Write a function that creates a dictionary of how many friends each person has. People can have 0 to many friends. However, there won't be repeat relationships like [A,B] and [B,A] and neither will there be more than 2 people in a relationship
Viewing 131 - 140 interview questions
See Interview Questions for Similar Jobs
Data Scientist IiiMachine Learning Research EngineerSenior Computer Vision EngineerIntern Data ScientistMachine Learning DeveloperMachine Learning SpecialistMachine Learning EngineerJunior Data ScientistData Scientist, ProductMachine Learning Research ScientistMachine Learning Software EngineerAi Software EngineerSoftware Research EngineerData Scientist TraineeSoftware Engineer Machine LearningData Science EngineerData ScientistsSenior Data Scientist