For the leetcode section: Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.
Developer Intern Interview Questions
12,194 developer intern interview questions shared by candidates
DSA leetcode easy to medium SQL OS BEHAVIORAL
in interview they ask about a question to find doubly array element.
Why did you choose NCR
How would you test a pen?
implement a queue using stacks
What are your career goals?
Asked to build a feature with React.
What are the things that are easy to do in Java compared to other languages
- OOP ( Java ) - Design Patterns - SQL - Some coding problems
Viewing 2411 - 2420 interview questions