Filter interviews by
Be the first one to contribute and help others!
Improving quality of education in India
Investing in teacher training and development
Increasing access to technology and digital resources
Encouraging parental involvement in education
Promoting vocational education and skill development
Addressing the issue of inadequate infrastructure and resources
I have the necessary skills, experience, and passion to excel in this role.
I have relevant experience in the field
I possess the required skills and qualifications
I am a quick learner and adaptable to new situations
I am passionate about the industry and eager to contribute
I am a team player and work well with others
Yes, social media can be used for educational purposes.
Social media provides a platform for sharing educational content and resources.
It allows for collaboration and communication among students and teachers.
Social media can enhance learning through interactive discussions and real-time feedback.
It can also help in reaching a wider audience and promoting educational initiatives.
Examples include educational YouTube chan...
I am a highly motivated and experienced project engineer with a strong background in managing complex engineering projects.
I have a Bachelor's degree in Engineering and have been working as a project engineer for the past 5 years.
I have successfully managed multiple projects from conception to completion, ensuring they are delivered on time and within budget.
I have a proven track record of effectively coordinating with...
The present CEO is John Smith.
John Smith is the current CEO of the company.
He has been in this position since 2015.
Under his leadership, the company has experienced significant growth and expansion.
John Smith has a strong background in engineering and project management.
He is known for his strategic vision and ability to drive innovation.
Reverse all the words in a given string
Split the string into an array of words
Loop through the array and reverse each word
Join the reversed words back into a string
Explaining how to handle 'n' in a string during swapping process
Identify the positions of 'n' in the string
Exclude those positions from the swapping process
Use a temporary variable to swap the characters
Ensure the swapped characters are not 'n'
Return the modified string
We can use any sorting algorithm like quicksort, mergesort, heapsort, etc.
Choose the appropriate sorting algorithm based on the size of the file and the range of numbers
Implement the chosen algorithm in the programming language of choice
Read the numbers from the file into an array or list
Apply the sorting algorithm to the array or list
Write the sorted numbers back to the file
Word suggestions in Eclipse can be implemented using algorithms like Trie or N-gram models.
Use Trie data structure to store the dictionary of words
Implement auto-complete feature using Trie
Use N-gram models to suggest words based on context
Train the N-gram model on a large corpus of text data
Combine both approaches for better accuracy
Consider user's typing speed and frequency of words for better suggestions
To check if a number k lies in a sequence formed by adding previous 2 elements, start with a=0 and b=1 and iterate until k is found or exceeded.
Start with a=0 and b=1
Iterate through the sequence until k is found or exceeded
If k is found, return true. If exceeded, return false
Check if a Binary Tree is a Binary Search Tree (BST)
A BST has the property that all nodes in the left subtree of a node have values less than the node's value, and all nodes in the right subtree have values greater than the node's value
We can traverse the tree in-order and check if the resulting sequence is sorted
Alternatively, we can recursively check if each node satisfies the BST property
Keep track of kth largest number in a stream of numbers.
Use a min-heap of size k to keep track of kth largest number.
For each incoming number, compare it with the root of the heap.
If it is larger than the root, replace the root with the new number and heapify.
The root of the heap will always be the kth largest number.
Infix expression can be evaluated using the concept of operator precedence and associativity.
Convert the infix expression to postfix expression using stack data structure
Evaluate the postfix expression using stack data structure
Use operator precedence and associativity rules to determine the order of evaluation
Parentheses can be used to override the default order of evaluation
based on 1 review
Rating in categories
TCS
Accenture
Wipro
Cognizant