Facility location problem. Suppose there are n facilities to open and m customers to serve. We want to make sure each customer has at least one facility open within 4 hours. Formulate the problem to minimize the number of facilities to open, while satisfying the constraints.
Can you summarise the steps to deal with change requests for a model
Write a SQL query to rank scores. If there is a tie between two scores, both should have the same ranking. Note that after a tie, the next ranking number should be the next consecutive integer value. In other words, there should be no "holes" between ranks. +----+-------+ | Id | Score | +----+-------+ | 1 | 3.50 | | 2 | 3.65 | | 3 | 4.00 | | 4 | 3.85 | | 5 | 4.00 | | 6 | 3.65 | +----+-------+ For example, given the above Scores table, your query should generate the following report (order by highest score): +-------+---------+ | score | Rank | +-------+---------+ | 4.00 | 1 | | 4.00 | 1 | | 3.85 | 2 | | 3.65 | 3 | | 3.65 | 3 | | 3.50 | 4 | +-------+---------+
Sorting algorithms and an easy question that I remember was from LeetCode.
How can you create a plan for the periodic menu [list of recipes visible to all the users out of which an order can be placed]?
People first or Goals first?
Für die Präsentation musste ich zwei Fälle mit konkreten Beispielen aus meiner bisherigen Erfahrung vorbereiten.
Tell us about the last book you've read
Name some non-linear optimization methods and explain them.
What is the stopping criteria for branch and bound?
Viewing 241 - 250 interview questions