Member Technical Staff Interview Questions
- -1of 1 vote
AnswersAre you unable to print the document after giving print command from AOL Gold? If your reply is positive then you need to check the connection of cables and internet connectivity of your device. Before checking these make sure you have to download AOL Desktop Gold from official and site have completed the installation process.
- adornasmith73 July 21, 2018 in United States
Read More:- https://www.email-customer-support.com/aol-download/| Report Duplicate | Flag | PURGE
Service Now Member Technical Staff test - 0of 0 votes
AnswerImplement below methods
- kay March 16, 2018 in United States for Tools team
//stores the number in some data structure
void store(n);
//tests whether the given number is present as sum of 2 numbers from the data structure store
boolean test(v);
e.g. store -> 1, 3, 5, 6
tests
4 = true (1 + 3)
5 = false (no sum will result into this)
6 = true (1 + 5)| Report Duplicate | Flag | PURGE
Linkedin Member Technical Staff - 0of 0 votes
Answerswrite a program to list factors of a given number
- kay March 16, 2018 in United States for Tools team
e.g. for input as 12, factors are 1, 2, 3, 4, 6, 12| Report Duplicate | Flag | PURGE
Linkedin Member Technical Staff - 0of 0 votes
AnswersAssume that garbage collector is not there in place or you are implementing a garbage collector for C++. Write the design and sample code for garbage collector implementation
- johnsvakel December 15, 2015 in India for Endpoint Computing
We have 3 classed and Class A, B, C. object of A uses object B and Object of B uses Object of C. How can we track the object existence and clear memory ?
Answer which I suggested : Write a tree (or Graph?)data structure (Garbage collector is a container class holds this data structure) where each node has multiple paths to reach. If any of the node is not having a path to reach then we can clean that memory. This way the garbage collection will work. Please suggest your design as well.| Report Duplicate | Flag | PURGE
VMWare Inc Member Technical Staff Algorithm - 0of 0 votes
AnswersThis question is windows based subsystem design to test the design skills. We are working in a complex system which involves multiple process, DLLs, windows services which will be gets installed on our system with the project. We have to design a logger system for this project where in all the multiple subsystem can use this logger system for their logging activities .
- johnsvakel November 27, 2015 in India for Azure
Design pattern used
Statically linked or Dynamically linked?
How the logger functions are designed (sample signatures)
How we can improve performance while logging (Think of ETL tracing)| Report Duplicate | Flag | PURGE
Microsoft Member Technical Staff design - 0of 0 votes
AnswersSort a set of ip address given either in ascending or descending order
- johnsvakel November 27, 2015 in India for Azure
char** SortIPAsc(char** pIPAddress);
char** SortIPDesc(char** pIPAddress);| Report Duplicate | Flag | PURGE
Microsoft Member Technical Staff Algorithm - 0of 0 votes
Answerswrite a program to parse a prefix expression and calculate it's result. Example: *-6 5 7 = 7.
- Johnybegood November 09, 2015 in United States| Report Duplicate | Flag | PURGE
Qumulo Member Technical Staff Algorithm - 0of 0 votes
AnswersYou're given a maze (that is not necessarily square shaped). The maze is composed of square rooms. In one of these rooms there is a flag. You have a robot that you can control using the following APIs:
- Johnybegood November 09, 2015 in United States
1. void Go() - drives the robot straight.
2. void Turn(int degrees) - turns the robot x degrees to the right (x has to be a multiple of 90).
3. bool IsWall() - returns true if the robot is facing a wall (you can't move from one room to the other).
4. bool IsFlag - returns true if the room has the flag in it.
5. void PutBreadCrumb() - throws a single breadcrumb in the room.
6. bool HasBreadCrumb()- returns true if the room contains a breadcrumb.
Using these Apis only, write a program to navigate the robot through the maze until it finds the flag.| Report Duplicate | Flag | PURGE
Qumulo Member Technical Staff Algorithm - 0of 0 votes
AnswersGiven a linked list which in addition to the 'next' pointer has another valid pointer to a random node in the string, write a function to copy the linked list.
- sln October 01, 2015 in United States| Report Duplicate | Flag | PURGE
Tintri Member Technical Staff Linked Lists - 2of 2 votes
AnswersThere are 10 coin producing machines which produces a coin of weight x grams. Out of those, 2 machines are defective and produces coins of x-1 grams. How to find those two defective machines.
- himanshu September 11, 2015 in India
Then extend this question to a total of n machines and out of those m machines are defective.| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff Puzzle - 1of 1 vote
AnswersGiven a number such as 123 having digits 1,2 and 3.
- trnvshisth March 29, 2015 in India
Now Product of Number and its digits is = 123*1*2*3 = 768. Now 123 is the seed number for 768. You would be given a number and you have to identify whether any seed element exists for that number. for Ex: - 4977 has two such seed numbers 79 and 711. You have to print both.| Report Duplicate | Flag | PURGE
Epic Systems Member Technical Staff - 0of 0 votes
AnswersSuppose you have a huge data of students. This data is in RAM (around 48 GB). Student has following attributes:
- guptasunny158 March 20, 2015 in India
1) RollNo
2) Name
3) Address
Now I need to implement three method:
getStudentByRollNo(int rollno)
getStudentsByName(String name)
getStudentsByAddress(String address)
In what data structure I can keep these students so that these methods can return the results really fast.| Report Duplicate | Flag | PURGE
unknown Member Technical Staff Data Structures - 3of 3 votes
AnswersGiven a staircase that has 'n' step, and you climb the staircase by jumping over the steps. You can cover at max of 'k' steps in a single jump. List all the possible sequence of jumps you could take to climb the staircase.
- NEO December 16, 2014 in India
input:
n=4, k=2
output:
1,1,1,1
1,1,2
1,2,1
2,1,1
2,2| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff Algorithm - 0of 2 votes
AnswersGiven n number of legacy services with user data<userid, info, date>
- next_big_gig December 05, 2014 in United States
Design an API to return user data in a given date range, it should collect data from each service and merge and return the data sorted by date.| Report Duplicate | Flag | PURGE
Google Member Technical Staff System Design - 2of 2 votes
AnswersFind the unique number that is present only once in array while all the others are present three times.
- Rahul Sharma November 03, 2014 in India
Example: 2,3,5,1,2,2,5,3,5,3
Answer : 1 as 2,3,5 are repeated three times
Complexity should be better than O(nlogn)| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff Algorithm - 1of 1 vote
AnswersHow google map implemented ? zoom in , zoom out, moving horizontal and moving vertically.
- surendersinghpawar September 20, 2014 in India
Give data Structure and algorithm.
Given all the data from satellite which revolve around earth in spiral way.| Report Duplicate | Flag | PURGE
Amazon Member Technical Staff Algorithm Application / UI Design Data Structures - 0of 0 votes
AnswersWrite a pattern matching function using wild char
- Kavita July 07, 2014 in India
? Matches any char exactly one instance
* Matches one or more instances of previous char
Ex text = "abcd" pattern = "ab?d" True
Ex text = "abccdddef" pattern = "ab?*f" True
Ex text = "abccd" pattern = "ab?*ccd" false
if u need more sample input ask me| Report Duplicate | Flag | PURGE
Amazon Member Technical Staff - -1of 1 vote
AnswersWrite a longest palindrome substring in a given string using recursion..
- Kavita July 04, 2014 in India
int LPS(char* str, int n)| Report Duplicate | Flag | PURGE
Amazon Member Technical Staff - -2of 2 votes
AnswersWrite a longest common string function using recursion
- Kavita July 04, 2014 in India
int LCS(char* str1, int m, char* str2, int n)
interviewer was not interested in iterative approach
function prototype should be same| Report Duplicate | Flag | PURGE
Amazon Member Technical Staff - 0of 0 votes
AnswersThere are at most eight servers in a data center. Each server has got a capacity/memory limit. There can be at most 8 tasks that need to be scheduled on those servers. Each task requires certain capacity/memory to run, and each server can handle multiple tasks as long as the capacity limit is not hit. Write a program to see if all of the given tasks can be scheduled or not on the servers?
- chaitu308 April 12, 2014 in United States
Ex:
Servers capacity limits: 8, 16, 8, 32
Tasks capacity needs: 18, 4, 8, 4, 6, 6, 8, 8
For this example, the program should say 'true'.
Ex2:
Server capacity limits: 1, 3
Task capacity needs: 4
For this example, program should return false.
Got some idea that this needs to be solved using dynamic programming concept, but could not figure out exact solution.| Report Duplicate | Flag | PURGE
VMWare Inc Member Technical Staff Algorithm - 0of 0 votes
AnswersDevelop a Dictionary supporting one implementation.
- JobSeeker April 09, 2014 in United States
This implementation can only use List interface.
A Dictionary maps a String term to a String definition; duplicate terms are allowed but
must be in stored/displayed in alphabetical order.
Dictionary must have printTermsInLexOrder(), among other methods. This method displays the term -> definition; this mapping is displayed in alphabetical order.
List interface only -> you can't use other Collections classes.| Report Duplicate | Flag | PURGE
Ebay Member Technical Staff - 2of 2 votes
AnswersGenerate all numbers in ascending order which are having factors as 2,3 and 5. Discuss various approaches.
- Rahul Sharma March 21, 2014 in India| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff Algorithm - 1of 3 votes
AnswersGiven two extremely large numbers - each number is stored in a Singly Linked list, with the MSB at the head. You are not allowed to reverse the Linked lists. Write a program to multiply them in optimum space and time.
- arjunsharmacool1 March 17, 2014 in United States for Infrastructure| Report Duplicate | Flag | PURGE
Facebook Member Technical Staff - 1of 1 vote
AnswersIn Amazon's interview, Round 2 they asked question:
Write a program to print inorder traversal of two trees.
Both values must be printed alternatively.
e.g. if inorder traversal of tree 1 is 10, 15, 20 and tree 2 is 100, 150, 200 then it should print
10, 100, 15, 150, 20, 200.
I tried printing it recursively by calling 2 functions recursively (f1 calls f2, then f2 calls f1 and so on).
I don't know where my approach is going wrong? I know there are other ways to do it as well but in this approach what is the mistake?
- tihor February 22, 2014 in Indiapublic class HelloWorld{ //this is the Node used in the tree static class Node{ private int data; private Node left; private Node right; public Node(int data){ this.data = data; left = null; right = null; } public void setLeft(Node left){ this.left = left; } public void setRight(Node right){ this.right = right; } public Node getLeft(){ return this.left; } public Node getRight(){ return this.right; } public int getData(){ return this.data; } public boolean equals(Node n){ if(this.data ==(int) n.getData()) return true; else return false; } } public static void main(String[] args){ HelloWorld bts = new HelloWorld(); bts.run(); } //execute the test case public void run(){ Node root = new Node(10); insert(root,new Node(20)); insert(root,new Node(50)); insert(root,new Node(40)); insert(root,new Node(15)); Node node2 = new Node(100); insert(node2,new Node(200)); insert(node2,new Node(500)); insert(node2,new Node(400)); insert(node2,new Node(150)); //inOrderTraverse(node2); inOrderTraverse1(root, node2); } // insert a node to the binary search tree public void insert(Node root, Node n){ if(root == null|| n == null) return; if(root.getData() > n.getData()){ if(root.getLeft() == null){ root.setLeft(n); }else{ insert(root.getLeft(),n); } }else if(root.getData() < n.getData()){ if(root.getRight() == null){ root.setRight(n); }else{ insert(root.getRight(),n); } } } public void inOrderTraverse(Node node){ if(node != null){ if(node.getLeft() != null) inOrderTraverse(node.getLeft()); System.out.print(" "+node.getData()); if(node.getRight() != null) inOrderTraverse(node.getRight()); } } //in-order Traversal public void inOrderTraverse1(Node node1, Node node2){ if(node2 != null){ inOrderTraverse2(node1, node2.getLeft()); System.out.println(" "+node2.getData()); inOrderTraverse2(node1, node2.getRight()); } } public void inOrderTraverse2(Node node1, Node node2){ if(node1 != null ){ inOrderTraverse1(node1.getLeft(), node2); System.out.println(" "+node1.getData()); inOrderTraverse1(node1.getRight(), node2); } }
| Report Duplicate | Flag | PURGE
Amazon Member Technical Staff Coding - 0of 0 votes
AnswersDesign a dialpad for a cellphone in a language which does not have conditional statements.
- anonymous February 18, 2014 in India| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff - 0of 0 votes
AnswersDesign a dialpad for a cellphone in a language which does not have conditional statements.
- anonymous February 18, 2014 in India| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff - 0of 0 votes
AnswersDesign a dialpad for a cellphone in a language which does not have conditional statements.
- anonymous February 18, 2014 in India| Report Duplicate | Flag | PURGE
Adobe Member Technical Staff