Longest (strictly) increasing sub array of ints, then update to allow 1 break (non-strictly increasing int) then update to allow k number of breaks + time complexity of each part
Internship Software Interview Questions
24,822 internship software interview questions shared by candidates
Should the client and server use the same data language for communication? (e.g. XML, JSON)
Data Structures, Algorithms, Problem solving.
How do you handle team conflict?
What do you know about Akamai?
difference between malloc and calloc OOPS concepts
About my prior projects. Questions in C++, linked list and, tree based algorithms, Race conditions in OS.
Given an array of n element which contains elements from 0 to n-1, with any of these numbers appearing any number of times. Return via Boolean, whether a duplicate exists in the list. 2nd Level/Bonus: do this in O(1) space complexity. 3rd level: Is there a better solution if you are allowed to modify the existing data array?
How do you reverse a string?
What is the angle between hour hand and minute hand at 3.15?
Viewing 81 - 90 interview questions
See Interview Questions for Similar Jobs
Summer Internship Software EngineerInternship Software EngineerSoftware Engineer InternshipSummer Software Engineering InternshipSummer Software Engineering InternProgramming InternProgramming InternshipSoftware Development Engineer InternSoftware Development Engineer InternshipSoftware Engineer InternSoftware Development InternSoftware Engineer Summer InternshipSoftware Engineering Co OpSoftware Development InternshipSoftware InternComputer Science Co OpSoftware Developer InternGraduate Software Developer