CareerCup

  • Questions
  • Forum
  • Resume Tips
  • RSS
  • Sign In

Adobe Interview Question for Data Scientists


Country: United States



Comment hidden because of low score. Click to expand.
0
of 0 vote

The travelling salesman problem belong to the NP-Hard problems set and the decision version of the problem belongs to the NP-Complete problems set.

The best algorithm I can think of to solve the problem can be Branch and Bound, which can be O(N^2) at the worst case.

If there is a better approach please do post here.
I remember reading about a Stanford-McGill team achieving a better approach in 2013.
But havent seen the actual paper.

- Vasanth November 08, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

The Travelling Salesman Problem belongs to the NP-Hard problems set and the decision version of the problem belongs to the NP-Complete problems set.

One probable approach I can think of is Branch and Bound, which can perform O(N^2) at the worst case.

I have read about a Stanford-McGill team which figured out the most optimal Solution for the TSM problem in 2013. But have not seen the paper.

If anyone knows of a better approach, please post it here.

- Anonymous November 08, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

The Travelling Salesman Problem belongs to the NP-Hard problems set and the decision version of the problem belongs to the NP-Complete problems set.

One probable approach I can think of is Branch and Bound, which can perform O(N^2) at the worst case.

I have read about a Stanford-McGill team which figured out the most optimal Solution for the TSM problem in 2013. But have not seen the paper.

If anyone knows of a better approach, please post it here.

- thisisvasanths November 08, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

(* Excuse the multiple comment, Browser screwed up :D )

- thisisvasanths November 08, 2015 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More