Filter interviews by
I applied via Recruitment Consultant and was interviewed in May 2021. There were 3 interview rounds.
The process by which the President of India is elected is known as the Presidential Election.
The President of India is elected by an Electoral College consisting of elected members of both houses of Parliament and of the Legislative Assemblies of the States.
The election is conducted by the Election Commission of India.
The candidate who secures a majority of the votes cast is declared elected as the President of India.
I...
The head of the government in India is the Prime Minister.
The current Prime Minister of India is Narendra Modi.
The Prime Minister is the leader of the ruling party or coalition in the Lok Sabha.
The Prime Minister is responsible for appointing other ministers and running the government.
The President of India is the head of state, but holds a largely ceremonial role.
The 'dagh' system was started by the Mughal Emperor Akbar in the 16th century.
The 'dagh' system was a branding system used to mark horses and other animals in the Mughal Empire.
It was started by Akbar in order to prevent theft and fraud in the animal trade.
The system involved branding the animal with a hot iron, which left a permanent mark.
The mark included information about the animal's breed, age, and owner.
The 'dagh...
Alexander of Macedonia was the student of Aristotle.
Aristotle was a Greek philosopher and Alexander was his student for three years.
Aristotle taught Alexander about philosophy, politics, and ethics.
Alexander's father, King Philip II of Macedon, hired Aristotle to be his son's tutor.
Thomas Hobbes wrote the book 'Leviathan'.
Thomas Hobbes is the author of 'Leviathan'.
The book 'Leviathan' was written by Thomas Hobbes.
Thomas Hobbes, an English philosopher, wrote 'Leviathan'.
Top trending discussions
Find sum of all numbers formed from root to leaf path in a binary tree
Traverse the binary tree using DFS
At each leaf node, add the number formed from root to leaf path to a sum variable
Return the sum variable
Time complexity: O(n)
Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25
Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.
Use recursion to generate all possible combinations of spaces
For each recursive call, either add a space or don't add a space between the current character and the next character
Base case is when there are no more characters left to add spaces between
Time complexity is O(2^n) where n is the length of the string
Preorder traversal without recursion
Use a stack to keep track of nodes
Push right child first and then left child onto stack
Pop top of stack and print value
Repeat until stack is empty
Find longest continuous patch on a 12 km road with updates in patches
Maintain a variable to keep track of current patch length
Update the variable whenever a new patch is added
Maintain a variable to keep track of longest patch so far
Compare current patch length with longest patch length and update if necessary
Use a sorted data structure like a binary search tree to store the patches for efficient search
Time complexity: ...
Find median of an unsorted array.
Sort the array and find the middle element
Use quickselect algorithm to find the median in O(n) time
If the array is small, use brute force to find the median
Find 'k' elements closest to a given number from a stream of characters.
Use a priority queue to keep track of closest elements.
Update the queue as new characters come in.
Return the 'k' closest elements from the queue.
Design a data structure with O(1) insert, remove, find-max, and delete-max operations.
Use a doubly linked list to maintain the elements in sorted order.
Use a hash table to store the pointers to the nodes in the linked list.
Maintain a pointer to the maximum element in the hash table.
Update the pointers in the hash table when inserting or removing elements.
Update the maximum pointer when deleting or inserting the maximum
Check if a given linked list is a palindrome.
Traverse the linked list and store the values in an array.
Compare the first and last elements of the array, then move towards the center.
If all elements match, the linked list is a palindrome.
Alternatively, use two pointers to find the middle of the linked list and reverse the second half.
Compare the first half with the reversed second half to check for a palindrome.
based on 5 reviews
Rating in categories
Teacher
4
salaries
| ₹0.5 L/yr - ₹1.8 L/yr |
Junior Teacher
4
salaries
| ₹0.5 L/yr - ₹0.5 L/yr |
Social Science Teacher
3
salaries
| ₹2 L/yr - ₹2 L/yr |
Delhi Public School Ghaziabad Society
Podar International School
Eurokids
Kangaroo Kids Education