Morgan Stanley Interview Questions – Set 1
Recently I have appeared for Java developer interview at the Morgan Stanley, Mumbai. It was a Video conference interview. Here are the set of questions asked to me : Tell me about your current project and your roles and responsibility. Write a java function to reverse a string using recursion Write a java program […]
N Queen Problem Using Recursive Backtracking
N Queen Problem is the problem of placing N chess queens on an NxN chessboard so that no two queens attack each other, for which solutions exist for all natural numbers n except n=2 and n=3. A solution requires that no two queens share the same row, column, or diagonal. It is more general form of inital Eight queens problem, where we need to […]
Sudoku Solver using Recursive Backtracking
Sudoku is a logic-based combinatorial number-placement puzzle. Given a partially filled 9×9 2D array grid[9][9], the goal is to assign digits (from 1 to 9) to the empty cells so that every row, column, and subgrid of size 3×3 contains exactly one instance of the digits from 1 to 9. For Detailed understanding about Sudoku, […]
