Two SQL tables, student and advisor. Find all students without an advisor. Print all students full name and full name of their advisor.
Development Engineer Interview Questions
37,130 development engineer interview questions shared by candidates
Using any language write a basic calculator with four basic operations(+,-,*,/). Create an API, consume the API, Unit tests, create a website, validate all inputs, prevent divide by zero...
When will you join in the project
What was your gearset accomplishment? what is your dream company? Do you have industry preference????
Find the Evil Monsters Problem Description Given an array A of N elements representing the monsters and an array B of Q elements representing the heroes. The i-th type of monster is represented by A[i][0], A[i][1] and A[i][2] which means a monster of the i-th type is present at each integer co-ordinate from A[i][0] to A[i][1] and having a strength of A[i][2]. The i-th type of her is represented by B[i][0] and B[i][1] which means a hero of strength B[i][1] will appear at the integer point B[i][0] after i seconds. When the i-th her appears it will destroy each and every monster present at B[1][0] and having a strength less than B[i][1]. For each i you have to determine the number of monsters left after the i-th hero has completed their task. Problem Constraints 1 <= N <= 105 1 <= Q <= 105 1 <= A[i][0] <= A[i][1] <= 105 1 <= B[i][0] <= 105 1 <= A[i][2] <= 105 1 <= B[i][1] <= 105 Input Format The first argument is an array A. The second argument is an array B. Output Format Return a list of integers
Technical questions were focused on mostly
Converging maze, max node problem
Tell us about your self
longest palindromic substring easy leetcode
Find repeating elements in an array
Viewing 1061 - 1070 interview questions