return true if array of size n contains a permutation of [1,n]
Software Engineer At Interview Questions
665,112 software engineer at interview questions shared by candidates
1. The police have managed to capture three suspects in a local bank robbery case. After intensive questioning, the three suspects have spoken. If we know that one of them always lies, and the other two always tell the truth. Who is guilty. 1. Sam - ‘I am innocent’ 2. Will - ‘I am innocent’ 3. Jenny - ‘Will is guilty’
What is a setter/ what is a getter? What is their purpose?
The programming test was quite difficult Math problem, it had to be solved precisely and every case must be handled carefully to ensure correct program outcome.
Implemented the basic data structure. And followed up with several small questions.
Given a list of words, right a function to return a list of pairs of palindromes
Online median.
Consider a queue between the two processes indicated below. N is the capacity (maximum length) of the queue; e, f, and b are semaphores. "P" refers to the operation of acquiring (decrementing) a semaphore, and "V" refers to the operation of releasing (incrementing) a semaphore. init() { e = N; f = 0; b = 1; queue = EMPTY; } process1() { for(;;) { P(e); P(b); queue.enqueue(...); V(b); V(f); } } process2() { for(;;) { P(f); P(b); ... = queue.dequeue(); V(b); V(e); } } Which of the following statements is (are) true? (Zero or more may be correct.) a. The purpose of semaphore f is to ensure that dequeue is not executed on an empty queue. b. The purpose of semaphore e is to ensure that deadlock does not occur. c. The purpose of semaphore b is to provide mutual exclusion for queue operations. d. None of the above.
1. To add an HTTP request to the search engine, then log a result depending on the# of pages and requirements. 2. Use DP to implement a Knapsack-like problem. Restrictions on time complexity. 3. Implement a to-do list's delete method on website.
Given the pre-order and in-order traversing result of a binary tree, write a function to rebuild the tree.
Viewing 551 - 560 interview questions