Given a Binary Tree, The task is to connect all the adjacent nodes at the same level starting from the left-most node of that level, and ending at the right-most node using nextRight pointer by setting these pointers to point the next right for each node.
Engineer 1 Interview Questions
3,934 engineer 1 interview questions shared by candidates
What are the principles of Python?
Reverse Linked List in k group
OPPS concepts Difference with python and java My project was on AI/ML ,they asked few questions on my project.
1st Round - DSA + Questions around Django, Python Basics, Code Fundamentals, SQL, AWS, Azure etc( based on what all you have worked too) 2nd Round - Caching basics, LRU Cache implementation, Tree Discussion, LLD Discussion on classes 3rd Round - Past Company's projects to and fro questions, and 2 DSA Questions(very less likely in some cases)
Java, selenium,manual testing,coding ,selenium code
Normal dsa questions, system design
Parenthesis question and linked list question
What is auto scaling in Kubernetes?
Tell me about an experience you have building a team
Viewing 2081 - 2090 interview questions