Tip 1 : Must do Previously asked Interviews as well as Online Test Questions.
Tip 2 : Must have good knowledge of DSA
Tip 3 : Do at least 2 good projects and you must know every bit of them.
Tip 1 : Have at least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects, and experiences more.
The First round was a pymetrics test, which basically is a sort of personality test. No real preparation is required, it’s a bunch of games based on common sense.
Test Window was open for 2 Days.
This consisted of four sections:
Aptitude test
AI/ML test(optional section)
Technical MCQ based on DBMS, OS, C++, Java
2 coding questions in your preferred language. (1 SQL, 1 Coding). I remember only 1.
This was basic two-loop problem
Step 1: For rows of rectangle ran the outer loop from 1 to rows.
Step 2: For column of rectangle run the inner loop from 1 to columns.
Step 3: Print star for first or last row or for first or last column, otherwise print blank space.
Step 4: After printing all columns of a row, print new line after inner loop.
There was no restriction of language on this question
This round involved coding questions, questions on Projects from your Resume and was conducted on MS TEAMS
Input: Consider the following Binary Tree:
Output:
Following is the level-order traversal of the given Binary Tree: [1, 2, 3, 5, 6, 4]
We can use a queue just like we used in Level Order Traversal. But in this case, we can also maintain a flag variable which keeps track of alternate level to reverse the order of the corresponding level traversal.flag==true implies we have to insert from left to right and flag==false means we have to insert element from right to left our answer arraylist.
1. Constructor:
It initializes the data members(queues) as required.
2. push(data) :
This function should take one argument of type integer. It pushes the element into the stack and returns nothing.
3. pop() :
It pops the element from the top of the stack and, in turn, returns the element being popped or deleted. In case the stack is empty, it returns -1.
4. top :
It returns the element being kept at the top of the stack. In case the stack is empty, it returns -1.
5. size() :
It returns the size of the stack at any given instance of time.
6. isEmpty() :
It returns a boolean value indicating whether the stack is empty or not.
Query-1(Denoted by an integer 1): Pushes an integer data to the stack. (push function)
Query-2(Denoted by an integer 2): Pops the data kept at the top of the stack and returns it to the caller. (pop function)
Query-3(Denoted by an integer 3): Fetches and returns the data being kept at the top of the stack but doesn't remove it, unlike the pop function. (top function)
Query-4(Denoted by an integer 4): Returns the current size of the stack. (size function)
Query-5(Denoted by an integer 5): Returns a boolean value denoting whether the stack is empty or not. (isEmpty function)
Operations:
1 5
1 10
2
3
4
Enqueue operation 1 5: We insert 5 at the back of the queue.
Queue: [5]
Enqueue operation 1 10: We insert 10 at the back of the queue.
Queue: [5, 10]
Dequeue operation 2: We remove the element from the front of the queue, which is 5, and print it.
Output: 5
Queue: [10]
Peek operation 3: We return the element present at the front of the queue, which is 10, without removing it.
Output: 10
Queue: [10]
IsEmpty operation 4: We check if the queue is empty.
Output: False
Queue: [10]
The idea behind this approach is to make one queue and push the first element in it.
After the first element, we push the next element and then push the first element again and finally pop the first element.
So, according to the FIFO rule of the queue, the second element that was inserted will be at the front and then the first element as it was pushed again later and its first copy was popped out.
So, this acts as a stack and we do this at every step i.e. from the initial element to the second last element, and the last element will be the one which we are inserting and since we will be pushing the initial elements after pushing the last element, our last element becomes the first element.
Questions were personality and behavior oriented
1) Why do you want to Join IHS Markit?
2)Express your thoughts on the statement “Data is the new oil”.
3)Describe the time when your Leadership skills made an impact.
4)What do you plan on learning from our company during your internship tenure?
Tip 1 : Be confident
Tip 2 : Read what the Company is working on and it's products
Tip 3 : Prepare Standard Hr questions
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the index number of the last element of an array with 9 elements?