Write a code for determining the given integer is palindrome in binaries.
Programmer Trainee Interview Questions
712,403 programmer trainee interview questions shared by candidates
Given an array A of n integers, in sorted order, and an integer x. design an O(n)-time complexity algorithm to determine whether there are 2 integers in A whose sum is exactly x.
Find the longest subarray which consists of numbers that can be arranged in a continuous sequence. For ex- {4,5,1,5,7,6,8,4,1} output-{5,7,6,8,4}.Find the longest.
Coding Challenge 2) You will be given N number of points as an array (CPPoint class). CPPoint class will have x and y coordinate. Find the closest k number of points from the origin.
Debugging section consists of basic algorithm and data structures while analytical sections consists of analogy based questions.
how many zeros are there in 100!
Given a binary tree, how would you set the keys/values of all the nodes and their child pointers to null. No language restriction. Do it iteratively in O(N) time with O(1) space complexity where N is the number of nodes in the tree. Other Details: - Tree is just a regular Binary Tree and doesn't have the BST property. - It is not guaranteed to be balanced. - You may do whatever you want to the tree however, you must ensure that all the nodes in the tree and their left/right pointers are set to null.
how to test a toaster?
How to reverse a space-delimited-string word by word
what if company in losses , dividend declaration
Viewing 841 - 850 interview questions
See Interview Questions for Similar Jobs
Entry Level DeveloperEntry Level ProgrammerNew Associate Programmer AnalystProgrammersEntry Level Android DeveloperStudent ProgrammerUniversity SoftwareProgrammer InternshipAnalyst/developerGame Programmer InternshipLead Programmer AnalystFilemaker DeveloperSoftware Engineer TraineeAssociate Web DeveloperSoftware Development ProgrammerSoftware Developer New GradC++ ProgrammerEntry Software