Developer Program Engineer Interview Questions
- 0of 0 votes
AnswersWhat is a dynamically typed language?
- mrabgh2014 June 23, 2022 in United States for giltoys.ir| Report Duplicate | Flag | PURGE
xyz Developer Program Engineer Python - 0of 0 votes
AnswersWhat are the different data types present in javascript?
- mrabgh2014 June 23, 2022 in United States for giltoys.ir| Report Duplicate | Flag | PURGE
xyz Developer Program Engineer JavaScript - 0of 0 votes
AnswerWhat is serialization?
- mrabgh2014 June 23, 2022 in United States for giltoys.ir| Report Duplicate | Flag | PURGE
xyz Developer Program Engineer .Net/C - 0of 0 votes
AnswersA smart-set is a set of distinct numbers in which all the elements have the same number of 1s in their binary form. The set of all smallest elements from each smart-set
- muvvaremo April 05, 2019 in United States
that can be formed from a given array of distinct positive numbers is known as the smartest-set.
So given an array of distinct numbers, outline the elements of the smartest-set in ascending sorted order.
Example
Let the array be {6 , 2 , 11 , 1 , 9 , 14 , 13 , 4 , 18}.
In binary form the set is {110, 010, 1011, 0001, 1001, 1110, 1101, 0100, 10010}.
The smart-sets are {1, 2, 4}, {6, 9, 18}, {11, 13, 14}.
The smartest-set is {1,6,11} as each element is the smallest element from each smart-set.
Input Format
The first line of input consists of an integer t. This is the number of test cases. For each test case,
the first line of input contains an integer n. Here n is the number of elements in the array. The next line contains n space separated distinct integers which are the elements
of the array.
Output Format
The output will space separated integer elements of the smartest-set in ascending order.
Constraints
0 < t < 1000 (This is the number of test cases
2 < n < 10000 (This is the number of integer elements of the array)
1 < Xi < 100000 (This is the size of each element of the array)
Sample input :
3
9
6 2 11 1 9 14 13 4 18
3
7 3 1
3
1 2 4
Sample Output :
1 6 11
1 3 7
1 please send me javascript code| Report Duplicate | Flag | PURGE
A9 Developer Program Engineer JavaScript - 0of 0 votes
AnswerBonus question -5: Build all permutations of a char array
- amitaiweil December 09, 2018 in Isreal| Report Duplicate | Flag | PURGE
Brossh Developer Program Engineer - 0of 0 votes
Answers4. Find an algorithm for finding the longest ascending order sub-sequence in an unsorted array of integers.
- amitaiweil December 09, 2018 in Isreal
Example: { 16, 4, 8, 22, 33, 7, 71} == > { 16, 22, 33, 71 }| Report Duplicate | Flag | PURGE
Brossh Developer Program Engineer C - 0of 0 votes
Answers3. Implement a descending and ascending sort by building a binary tree and traversing it.
- amitaiweil December 09, 2018 in Isreal| Report Duplicate | Flag | PURGE
Brossh Developer Program Engineer C - 0of 0 votes
Answers2. Implement a double linked list
- amitaiweil December 09, 2018 in Isreal| Report Duplicate | Flag | PURGE
Brossh Developer Program Engineer C - 0of 0 votes
AnswersC test – 3 hours (see also other questions: 1 to 5
- amitaiweil December 09, 2018 in Isreal
1. Write a function which compares two strings –
Int strcmp (char* S1, char* S2)| Report Duplicate | Flag | PURGE
Brossh Developer Program Engineer C# - 0of 0 votes
AnswersGiven the N*N matrix, find the given number in the matrix. All rows are sorted. And each row first element is less than the previous row last index.
- sarunreddy82 March 05, 2018 in United States
input :
[1,3,5,7,9]
[11,13,15,16,20]
[21,22,23,24,25]
[30,32,35,40,45]
Given Num : 23
What is the best Optimal solution ? I have used BST but the interviewer asked to use any other which could do better in the above scenario.| Report Duplicate | Flag | PURGE
xyz Developer Program Engineer Matrix - 0of 0 votes
Answersgiven an array of integers suppose 1234, print all groups of integer array possible of length upto n where n can be any number greater than zero
- mohapatrasandeep60 March 05, 2018 in India
example for n=5
1,11,111,1111,11111,12341,22222,2222,222,22,2 etc
for n=3
1,11,123 etc| Report Duplicate | Flag | PURGE
Samsung Developer Program Engineer - 0of 0 votes
AnswersFind the maximum sum of subset of size K in an array
- ajay.raj December 16, 2017 in United States| Report Duplicate | Flag | PURGE
Facebook Developer Program Engineer - 4of 4 votes
AnswersYou have given height array of array. Generate the original array.
- sandeepmnit35 November 20, 2017 in India
Input: [6,3,0,2,2,0,0]
Output : [ 1,5,7,3,2,6,4]
A[i] value in input array is the number of greater element on right side.| Report Duplicate | Flag | PURGE
Goldman Sachs Developer Program Engineer Algorithm - 0of 0 votes
AnswersHow to print nested array ?
- sandeepmnit35 November 20, 2017 in India
Input : [1, 5, 8, [9, 10, 24, 20, [39, 48], 89], 105, 99]
Output : 1, 5, 8, 9, 10, 24, 20, 39, 48, 89, 105, 99.
Which data structure you will use to store the values?| Report Duplicate | Flag | PURGE
Goldman Sachs Developer Program Engineer Algorithm - 0of 0 votes
AnswersHow you register one process with other process?
- karthikeyy April 18, 2017 in India
Eg: In c++ main is one process it has to create one process and then it forks other three process and each forked information should be registered with first forked process?| Report Duplicate | Flag | PURGE
Bosch Developer Program Engineer - 0of 0 votes
AnswersHow to pass c++ objects from one process to other process ?
- karthikeyy April 18, 2017 in India
Eg: one process constructs C++ object with some data other process should receive this c++ object and display the data in it.| Report Duplicate | Flag | PURGE
Bosch Developer Program Engineer Threads - -5of 5 votes
AnswersFill the arrray with elements from 0 to 9.
- algoLearner March 21, 2017 in India
based on thier frequency.
a[1]=3 means, 1 is repeated for 3 times(1 must present 3 times in that array)
a[2]=4 means 2 is repeated for 4 times.(2 must present twice in that array)| Report Duplicate | Flag | PURGE
Amazon Developer Program Engineer Arrays - 0of 0 votes
Answersarista-networks-interview-questions
- John4jobs March 17, 2017 in United States
0
of 0 votes
0
Answers
Write findMin, findNext of BST tree node has parent and write PrintBST using above two
arista-networks-interview-questions
0
of 0 votes
0
Answers
Write findMin, findNext of BST tree node has parent pointer also.
void printBST(TreeNodep root) {
TreeNodep temp , next;
temp = findMin(root);
while (1) {
printf("%d",temp->value);
next = findNext(temp);
if (!next)
return;
printf("%d",next->value);
temp = next;
}
}| Report Duplicate | Flag | PURGE
Arista Networks Developer Program Engineer - 0of 0 votes
AnswerWrite findMin, findNext of BST tree node has parent pointer also. http://www.geeksforgeeks.org/find-the-minimum-element-in-a-binary-search-tree/
- John4jobs March 17, 2017 in United States
http://www.geeksforgeeks.org/inorder-successor-in-binary-search-tree/| Report Duplicate | Flag | PURGE
Arista Networks Developer Program Engineer Data Structures - 0of 0 votes
AnswersGiven a array of integers {-6,-3,-1,2,4,5} which are sorted .Sort square of the numbers .Output {1,4,9,16,25,36}
- John4jobs March 08, 2017 in United States| Report Duplicate | Flag | PURGE
Fungible Developer Program Engineer Arrays - 0of 0 votes
AnswersA string has multiple spaces like "Fung ible is" .When ever there a space keep one space and remove all other spaces. output "Fung ible is"
- John4jobs March 08, 2017 in United States| Report Duplicate | Flag | PURGE
Fungible Developer Program Engineer C - 0of 0 votes
AnswersReverse Linked List
- John4jobs March 08, 2017 in United States| Report Duplicate | Flag | PURGE
Fungible Developer Program Engineer C - 0of 0 votes
AnswersWe have 52 week price list for a stock S. Suppose that during this period, we want to buy 100 stocks of S and sell all of them at a later day (within the 52 week window). We want to know when should we have bought and sold in order to make maximum profit. (If there is no profit making scenario, then it should be reported).
- sunny.1rn12cs113 February 22, 2017 in India
Example, for a small 4 week window: P1 = 14, P2 = 6, P3 = 7, P4 = 11 Then the output should be "Buy on 2 and sell on 4". Short selling is not allowed.
How can you best classify the type of the algorithm? (Greedy or Divide & Conquer or Dynamic Programming, etc..)| Report Duplicate | Flag | PURGE
Hewlett Packard Developer Program Engineer - 0of 0 votes
AnswersGiven a list of stocks with their respective market capitalizations. The stock’s market cap are updated every minute based on its trading in the market. I have a strategy that wants a list of top 10 highest capped stocks in the market. This query can happen multiple times during the day.
- sunny.1rn12cs113 February 22, 2017 in India
Question: What would be the most appropriate data structure that can be used to efficiently implement the list of stocks? Discuss pros/cons of various data structures. Please briefly explain your answer.| Report Duplicate | Flag | PURGE
Hewlett Packard Developer Program Engineer - 1of 1 vote
AnswersRemove 3 consecutive duplicates from string.
- neerdis January 17, 2017 in India
INPUT:aabbbaccddddc
OUTPUT:cdc| Report Duplicate | Flag | PURGE
Amazon Developer Program Engineer Java - 1of 1 vote
AnswersWe define an undirected graph g,such that: The total number of nodes in the graph is g_nodes. The nodes are numbered sequentially as 1,2,3….g_nodes. The total number og edges in the graph is g_edges. Each edge connect two distinct nodes(i.e no edge connect a node to itself). The weight of the edge connecting nodes g_to[i] and g_from[i] is g_weight[i]. We define the weight of the path from some start node to some end node to the sum of all edges traversed on the path. Input formate: The first line contain two space-seperated integer describing the respective value of g_node and g_edge. Each line I of the g_edge subsequent lines contain three space –seperated integer describing the respective value of g_to[i],g_from[i] and g_weight[i]. The next line contain an integer denoting start The next line contain an integer denoting end. The next line contain an integer denoting w_extra. input 1:
- zila.techy October 21, 2016 in India
4 4
1 2 2
2 3 1
2 4 2
3 4 3
1
4
5
Output:4
input2:
5 5
1 2 2
1 4 4
2 3 1
3 4 3
4 5 1
1
4
2
output:3
Int mincost(int g_nodes,int g_edged,int* g_from,int* g_to,int* weight,int start,int end,int w_extra)
{
}| Report Duplicate | Flag | PURGE
Amazon Developer Program Engineer C - 0of 0 votes
Answerwhat would be the best way to reduce the size of image in E-commerce website having billions of images ?
- namrata.rohit22 September 13, 2016 in United States| Report Duplicate | Flag | PURGE
Developer Program Engineer Software Design - 0of 0 votes
AnswerI have a list with new obejcts added in it. How can I make sure that no one is able to modifiy my list?
- singhrahul3108 September 03, 2016 in India| Report Duplicate | Flag | PURGE
Synechron Developer Program Engineer - 0of 0 votes
AnswersWe have a file which contains only strings with spaces and the size of the file is approx 10 gb. WAP in java to find the word and the count of word repeated most no of times
- singhrahul3108 September 03, 2016 in India| Report Duplicate | Flag | PURGE
Synechron Developer Program Engineer