Given an array with each array elements containing a random cost (i.e {10, 5, 2, 200, 5, 1}). You can either step through element 1 by 1 or skip by 1 element (i.e array[0] > array[2] > array[3] > array[5]). Find the lowest cost from element 0 to N.
Software Engineer Entry Interview Questions
2,582 software engineer entry interview questions shared by candidates
What is an abstract class and why would you use it?
When was a time when you had a different opinion from another team member and how did you resolve this conflict?
They had me write code for a microcontroller. It was a basic sorting algorithm. The difficult part was the space constraint. If you weren't careful, you would run out of space if you used too much space in memory or if the project size was too large.
What is a stack? What is cloud computing? Two "coding" types of explanation like permutations of string
1. Populate an array of numbers from 1 to N (inclusive). Given two numbers, p and q , if a number in the array is divisible by p print OUT if a number is divisible by q print THINK. If the number is divisible by both p and q, print OUTTHINK. Otherwise, print the number.
What is polymorphism? What is the highlights on your resume?
An algorithmic question that I could not answer.
Algorithm runtime analysis: What's the complexity of computing the fibonacci numbers?
Can you explain Software Development LifeCycle?
Viewing 31 - 40 interview questions