Filter interviews by
I applied via campus placement at Indian Institute of Technology (IIT), Chennai
Develop a sustainable energy source for rural areas
Research and develop a low-cost renewable energy solution
Test and refine the solution in a rural area
Partner with local organizations to implement and maintain the solution
Provide training and education to the community on the use and maintenance of the solution
I applied via campus placement at Indian Institute of Technology (IIT), Chennai
I am a research and development professional with expertise in various fields.
I have a PhD in Chemistry and have worked in the pharmaceutical industry for 5 years.
I have experience in developing new products and improving existing ones.
I am skilled in project management and have led teams of up to 10 people.
I am passionate about innovation and finding solutions to complex problems.
I am interested in exploring new technologies and their applications in various fields.
Artificial Intelligence and Machine Learning
Internet of Things
Blockchain Technology
Virtual and Augmented Reality
Robotics and Automation
Top trending discussions
posted on 21 Oct 2024
One coding question from dynamic programming
Binary lifting ancestors problem involves finding the k-th ancestor of a node in a binary tree efficiently.
Binary lifting is a technique used to find ancestors in a binary tree.
It involves precomputing the ancestors of each node using dynamic programming.
The k-th ancestor of a node can be found by repeatedly jumping up the tree in powers of 2.
Example: Given a binary tree with nodes 1, 2, 3, 4, 5, 6, 7, the 2nd ancestor
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Segment tree questions and dp questions
I applied via Naukri.com and was interviewed in Nov 2024. There were 2 interview rounds.
C++ basic and advance level
posted on 21 Oct 2024
One coding question from dynamic programming
Binary lifting ancestors problem involves finding the k-th ancestor of a node in a binary tree efficiently.
Binary lifting is a technique used to find ancestors in a binary tree.
It involves precomputing the ancestors of each node using dynamic programming.
The k-th ancestor of a node can be found by repeatedly jumping up the tree in powers of 2.
Example: Given a binary tree with nodes 1, 2, 3, 4, 5, 6, 7, the 2nd ancestor
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Segment tree questions and dp questions
I applied via Naukri.com and was interviewed in Feb 2023. There was 1 interview round.
I applied via campus placement at Indian Institute of Technology (IIT), Chennai and was interviewed in Jan 2018. There were 5 interview rounds.
Software Technologist 1
199
salaries
| ₹13 L/yr - ₹30 L/yr |
Software Engineer
183
salaries
| ₹6 L/yr - ₹22 L/yr |
Senior Accounting Specialist
180
salaries
| ₹5.6 L/yr - ₹17.7 L/yr |
Software Technologist 2
164
salaries
| ₹16 L/yr - ₹36.5 L/yr |
Deputy Manager
153
salaries
| ₹8.5 L/yr - ₹23 L/yr |
Siemens
GE Healthcare
Honeywell Automation
Bosch