Design a data structure that calculates a moving average of time-varying price input.
Junior C Developer Interview Questions
158 junior c developer interview questions shared by candidates
Several APIs are given. You're asked to write two functions to compute round-trip time between two clients in a network.
Complete two functions inside of a C++ Class based on the description
To describe what SQL Left join is
Describe good c++ code
Fibonacci numbers C program to test basic understanding
How many hours would you say you need per week to be ready for university
Shortest path in graph: /// /// graph is a function that accepts the node name, and int*. It returns the /// neighbors of the node and the length of the neighbors in the int* /// /// Name of start node /// Name of goal node /// /// The shortest path with format start->...->goal char *shortestPath(Inner *(*graph)(const char *, int *), const char *start, const char *goal) { // int neighborsLength; // Inner *neighbors = graph(start, &neighborsLength); // std::cout << "name: " << neighbors[0].name << neighbors[0].cost << " // length: " << neighborsLength << std::endl; std::cout << "name: " << // neighbors[1].name << neighbors[1].cost << " length: " << neighborsLength // << std::endl; // neighbors = graph(neighbors[0].name.c_str(), &neighborsLength); // std::cout << "name: " << neighbors[0].name << neighbors[0].cost << " // length: " << neighborsLength << std::endl; std::cout << "name: " << // neighbors[1].name << neighbors[1].cost << " length: " << neighborsLength // << std::endl;
What was your Bachelor's thesis about? If I gave you 9 numbers, from 1 to 10 and no repeated, how would you find which number is missing checking each number only once and without keeping track of which numbers you have already seen?
Entity Framework, oop, Dependency injection..
Viewing 101 - 110 interview questions