Advanced Application Engineer

This time, Ninja was sent on a mission to hide ‘N’ mysterious gems on the ground with a condition to place all of them in a straight line. Ninja prepared a list of coordinates during the mission, ‘POINTS’, where he hides the gems. Your task is to return true if Ninja successfully hides all the gems in a straight line, otherwise return false.

For example:

Given POINTS = {{0, 0}, {1, 1}, {2, 2}}. Gems placed at coordinates (0, 0), (1, 1) and (2, 2) will lie in a straight line. Therefore, Ninja is successful in his mission.

Note:

POINTS[ i ] = {X, Y}, where ‘X’ and ‘Y’ represent the X and Y coordinates of a point, respectively, in a 2 - D plane.

You are given a N x M matrix of integers, return the spiral path of the matrix

Example Of Spiral Path

Tell me about yourself. What are your hobbies and aspirations? Tell me something about your current Final year project. Some follow-up questions like is your project is single or teamwork? Why did you choose this project? Is your mentor or teammates assisting you in the project? Have you ever faced any kind of Challenge or problem or pressure faced, if yes how did you deal with it? Which language do you prefer in coding? Which are some of the subjects that you disliked the most in your curriculum? Do you have any questions for me?

You are given a positive integer ‘NUM’ consisting only of digits ‘6’ and ‘9’. You can change at most one digit (i.e ‘6’ to ‘9’, or ‘9’ to ‘6’). Your task is to find and return the maximum number you can obtain.