find if a bst contains a pair whose sum is x
Softwareentwickler Java Interview Questions
512,884 softwareentwickler java interview questions shared by candidates
If given an infinite amount of memory, whats the fastest way to reverse an array?
2 programming questions that can be solved in any language.
Most of the questions are basic and unpractical. The reviewers prepared a list of questions in front of them and just go through them one by one. There were a couple of writing code scenarios. Some of these questions repeated what you already discussed earlier. The eraser for the white board does not work so the white board looks very messy. Some of these questions were not appropriate for a Senior Developer position at all. There were very few questions about architecture or best practices.
A level-order traversal in a binary tree requires which data structure? Options are: stack, doubly linked list, queue, circular linked list
Standard FizzBuzz, replacing Fizz with Web and Buzz with MD.
Class, object, polymorphism, inheritance, encapsulation, interrupts, multi threading, try-throw-catch concepts, call by value, reference, pointers, semaphore, mutex, SRS, SDLC, stack, linkedlists, trees, OSI stack, TCP/IP, networking protocols. Go through job description and prepare accordingly.
Write a program to count number of occurence of the character in the provided string. Hello h-1 e-1 l-2 o-1
1. highest of array (without using any loop)(recursion bhau :P) 2. searching with time complexity (binery search) 3. most difficult que by that they kick me out :D array given {1,2,3,4,5,6,7,8,9} arrange in matrix of form {{1 3 6}{2 5 8}{4 7 9}} like {{a c f}{b e h}{d g i}} see formations
This question was asked in Round 2 of the process.. Given an unsorted array..find the Nth largest number in a single pass without modifying the array...
Viewing 1561 - 1570 interview questions