Fragen in Vorstellungsgesprächen für Softwareentwickler

public int minWindow(char[] str, char[] chars, int startIndx, int i, int j) { if (j == chars.length) { // found the solution // check the minimum if ((i - startIndx) 0) { return minWin; } return -1; }

static int minWin = Integer.MAX_VALUE; public static int minWindow(char[] str, char[] chars, int startIndx, int i, int j) { if (j == chars.length) { // found the solution // check the minimum if ((i - startIndx) 0) { return minWin; } return -1; }

Mohd

Nicht unbedingt erforderlich, da die Interviewer die Tätigkeiten und Produkte vorgestellt haben.

Try to relax

Calls and SMS.

All (or most) of the answers can be found in C++ FAQs.

TSP is a problem described in graph theory: the cities are defined as nodes in a graph, and edges is a road from one city to another. Traveling salesman wants to visit all the cities, but use the shortest path for that. The solution exists is graph is connected (meaning that each city is connected by the road with each other, not necessarily direct road, but might be from other cities), and graph follows triangle rule, which means that the direct road between 2 cities is always shorter that going transit through some other city.

On wiki page you can find whole list to answer this questions. I named bubble sort. Complexity is n^2. Best (smallest) known complexity is n*Log n.