SDE - 1

Print the following pattern

Pattern for N = 4

The dots represent spaces.

You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.

Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.

You can assume that the value of N will always be greater than 1. So, the answer will always exist.

Ninjas is practicing problems on the linked list. He came across a problem in which he has given a linked list of ‘N’ nodes and two integers, ‘LOW’ and ‘HIGH’. He has to return the linked list ‘HEAD’ after reversing the nodes between ‘LOW’ and ‘HIGH’, including the nodes at positions ‘LOW’ and ‘HIGH’.

You have been given a Binary Tree of 'n' nodes, where the nodes have integer values

Print the left view of the binary tree.

Example :

If the input tree is as depicted in the picture: 

The Left View of the tree will be:  2 35 2 

• Explain your project and its features
• If you are now instructed to make the same project, What are the modifications you will apply to it?

• What are your strengths and weaknesses?
• Where do you see yourself in next five years?
• What is the most or least comfortable topic you can speak about?
• How can you contribute to the company?