Was asked to write a program in any programming language to find the largest sub-string with non-repeating characters.

Question

Anonimo · Accepted Answer

I wrote a program in Scala to implement this functionality and was given 30 minutes to write the code. The challenge in itself was not very complex, but the anxious situation of being interviewed and the 30 minute time limit to write the code, made me miss some obvious edge cases. After the phone interview terminated, I stayed online on the coding web-site and I could see the interviewer testing some of the edge cases and the code failing to handle these cases. Within the next hour, I got an email response ending my application to the position.

Mr Virtual Constructor · Answer

string largestSubstring(const string& s)
{
	// thisisalongstring
	// this
	//    si
	//     isalong
	//       alongstri
	//           gstrin
	//            string
	//   
	if (s.length()  used;
	int i = 0;
	while (i  maxSub.length())
			{
				maxSub = sub;
			}

			i = s.find_last_of(s[i], i - 1);
			i++;
			used.clear();
			sub.clear();
			continue;
		}
		sub.push_back(s[i]);
		used.insert(s[i]);
		i++;
	}
	return maxSub.length() > sub.length() ? maxSub: sub;
}

Bloomberg

Domanda di colloquio di Bloomberg

Risposte di colloquio

Aziende seguite

Ricerche di lavoro