Gegeven reeks van niet-negatieve hele getallen, terugkerend eerste unieke nummer in deze reeks (dat gebeurt slechts één keer). Voorbeeld: [1,1,2,3,56,4,7,4,3,2,56,1000] // Verwacht resultaat: 7
Software Interview Questions
550,133 software interview questions shared by candidates
Given an array of length N containing numbers bounded between 1 and N with exactly one duplicate, determine what the duplicate number is in O(n) time without using more than constant memory (no making new arrays of N length).
Call a function F in a loop. F returns a string of 140 chars. Write to the output 1 when F returns a string with the same letters (basically a permutation) of a string previously returned. (the question was not this well formed)
Implementing a dictionary of quick searching words
given two linked lists with a digit in each node, add the two linked lists together. the result must be a linked list with one digit in each node. use only one iteration of the two input lists.
1. Calculate the factorial of an array of integers. 2. How to improve the factorial algorithm?
Are two words palindrome of each other?
If you had to change permissions to read/write all recursively in the unix terminal, how would you do it?
Waar mogen we je 's nachts voor wakker maken?
Why u chose IT? Why do want to join syntel?
Viewing 561 - 570 interview questions
See Interview Questions for Similar Jobs
Major Account ExecutiveTest AnalystErp Implementation ConsultantAccount Executive Mid MarketSenior SalesProgrammer AnalystQa ManagerManual TesterTechnical Support AssociateChannel Sales ManagerConfiguration ManagerFull Stack EngineerEntry Level Digital Signal Processing EngineerJava DeveloperEntry EngineerEngineer DeveloperIos DeveloperEntry DeveloperIt Head