SDE - 1

You are given 'N' jobs with their start time 'Start', end time 'End' and profit 'Profit'. You need to tell the maximum profit you can obtain by performing these jobs such that no two jobs overlap.

Note:

The start time of one job can be equal to the end time of another.

Ninja has to implement a binary tree class from scratch. The Ninja can perform three types of queries on this binary tree.

• ‘I’ ‘VAL’: In this query, Ninja has to insert a Node with the value ‘VAL’ in the binary tree.
• ‘D’ ‘VAL’: In this query, Ninja has to delete a Node with the value ‘VAL’ from the binary tree.
• ‘R’: In this query, Ninja has to print a random node from the tree.

All the Node values in the binary tree are different. All nodes are equally likely to be chosen.

For example:

What is virtual memory. What are its uses. Different OS related problems, Indexing

What is javascript, its uses, server client problems.

Compiler design related questions, differences between Python and C in very depth.

Low level vs High level language, kernel related questions