Juspay Interview Question for Software Developers

Country: India

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

I am not sure how can we do it in O(Log(n)), but with O(n) it should be easy.

1) Keep a map where you store the cells which can be reached by C1.
2) Traverse through the path of C1, keep on storing the path in the map. {c1: 1, c1->exit: i, c1->exit->exit: 1 ....}
3) Do the same traversal for c2, at any time if you find the exit path exist in the above map then that is the meeting point of 2 cells.

In Javascript:

var path               = {},
      meetingPoint = null;
while(c1.exit) {
	var cell = c1.exit;
	path[cell] = 1;
while(c2.exit) {
	if (path[c2.exit] === 1) {
		meetingPoint = c2.exit;

return meetingPoint;

- Piyush Beli September 24, 2016 | Flag Reply

Add a Comment

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


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


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