Jr. Software Engineer Interview Questions
- 0of 0 votes
AnswerGuys,
- zuhaibaliraja November 23, 2018 in United States
I have an interview in Google exactly after 2 weeks for software engineer position. I recently have done my MS in Information Science and I applied in google. They shortlisted my profile and sent me sample code exam which I have passed. Now it's my technical interview and I am very beginner into programming. Can please anyone help me what type of questions do they ask and how to tackle those questions. I am not good in data structures and algorithm. I self-taught programming online classes. I am so scared to face the interview. Please suggest me something| Report Duplicate | Flag | PURGE
xyz Jr. Software Engineer .Net/C - 0of 0 votes
AnswersWe woild like to encourage passegers to experience the joy of travel using our transit system, therefore we would like to determine the longest path available to advertise the public. Specifically we would like to determine the longest possible trip on the transit sytem that will involve TWO tickets. The destinations must be connected, and all destinations must be unique.
- NoobieCoder3 November 10, 2018 in United States for Python development
You will be provided input in the format of CHI:NYC:719 where CHI is one location, NYC is a connected locatoion and 719 is the distance between the locations.
one line of output should be provided per line of input in the format of 3167:CHI:NYC:LA where 3167 is the distance of the trip, CHI is the starting, NYC is the intermediary location and LA is the final location.
sequence-------input---------------------------output
1------------------CHI:NYC:719----------------NONE
2------------------NYC:LA:2414----------------3133:CHI:NYC:LA
3------------------NYC:SEATTLE:2448------4862:LA:NYC:SEATTLE
4------------------NYC:HAWAII:4924---------7372:HAWAII:NYC:SEATTLE
Note: the start and end cities are lexicographical sorted.| Report Duplicate | Flag | PURGE
Jr. Software Engineer Python - 0of 0 votes
Answerhow can i apend two array in C# like this
- lalityad2012 October 30, 2018 in India
a1 = [1, 2, 3, 4];
a2 = ["a", "b", "c"];
result a3 = [a1, b2, c3, d4];| Report Duplicate | Flag | PURGE
Jr. Software Engineer .Net/C# - 1of 1 vote
AnswersGiven a n-nary tree, check whether it is a mirror of itself (ie, symmetric around its center).
- ajay.raj January 26, 2018 in United States
class TreeNode {
int val;
List<TreeNode> children;
TreeNode(int val) {
this.val = val;
children = new ArrayList<>();
}
}| Report Duplicate | Flag | PURGE
Google Jr. Software Engineer - 8of 8 votes
Answerswrite a program that take l and r as input and display the number of prime numbers that lie between l and r(l and r inclusive) and can be represented as sum of two consecutive prime numbers +1
- angomarjundas1994 October 08, 2017 in India| Report Duplicate | Flag | PURGE
Juspay Jr. Software Engineer C - 0of 0 votes
AnswersGiven a BST tree, we have to break the tree depending on the input(N), into two subtrees, where subtree1 consists of all the nodes, which are less than or equal to N and subtree2 consists of all the nodes which are greater than N.
- amrendersingh1995 May 03, 2017 in India
50
/ \
40 60
/ \ /
30 45 55
\
58
output:
50
/
40
/ \
30 45
60
/
55
\
58| Report Duplicate | Flag | PURGE
Josh Jr. Software Engineer - -1of 1 vote
AnswerHow many cars travel across a bridge each day?
- tomdickinson1977 June 13, 2016 in United Kingdom| Report Duplicate | Flag | PURGE
Jr. Software Engineer General Questions and Comments - -12of 12 votes
Answers-
- J@sper January 17, 2016 in United States| Report Duplicate | Flag | PURGE
Google Jr. Software Engineer C - -3of 3 votes
Answersdsgfd
- Niki92 January 16, 2016 in United States| Report Duplicate | Flag | PURGE
X Jr. Software Engineer Algorithm - 0of 0 votes
AnswersWrite a method that takes in a positive integer, return the number of 2s between 0 and the input number.
- J@sper November 26, 2015 in United States
If the input value given is 13, it should return 2 as the number 2 and 12 are between 0 and 13.
If the input value given is 21, it should return 3 as the number 2,12 and 20 are between 0 and 21.| Report Duplicate | Flag | PURGE
Amazon Jr. Software Engineer Java - 0of 0 votes
AnswersImplement an algorithm that takes a adjacency list and produces a topological sort of the vertices.
- J@sper November 26, 2015 in United States
INPUT:
1 2
1 3
1 4
3 5
2 5
4 5
Returns:
1 2 3 4 5| Report Duplicate | Flag | PURGE
Google Jr. Software Engineer Sorting - 0of 0 votes
AnswersConsider a setup where a program is continuously receiving floats as inputs (a stream of numbers). Write a method that at any given time returns a moving average. That is the average of the last K numbers received. If the method is called before the program has received K numbers, simply return the average of however many numbers have been received thus far.
- Ray November 15, 2015| Report Duplicate | Flag | PURGE
Google Jr. Software Engineer Algorithm - -2of 2 votes
AnswerYou have two dictionary in python.
- Ilan.Shtrak July 13, 2015
You should compere two dictionary
1. when key same you should compare values
2. when key different you should compare key and value and output should be how much have different keys and values .
Code in python| Report Duplicate | Flag | PURGE
Amazon Jr. Software Engineer - -1of 3 votes
AnswersIn the game of Jack Straws, a number of plastic or wooden "straws" are dumped on the table and players trn.
- ErakankshaIT May 29, 2015 in United States| Report Duplicate | Flag | PURGE
Microsoft Jr. Software Engineer Algorithm - 1of 1 vote
AnswersIn the game of Jack Straws, a number of plastic or wooden "straws" are dumped on the table and players try to remove them one-by-one without disturbing the other straws. In the question here, we are concerned with the following, related problem: First n straws are dumped on the table. Next, for every pair of straws, we want to determine if the straws are connected by a path of touching straws. In other words, given a list of the endpoints for n > 1 straws (as if they were dumped on a large piece of graph paper), determine all the pairs of straws that are connected. Note that touching is connecting, but also two straws can be connected indirectly via other connected straws. Give an algorithm to compute all the pairs of straws that are connected.
- ErakankshaIT May 29, 2015 in United States
Here is some additional information that you can use:
As a basic step you need to determine whether two straws directly touch (intersect), i.e., whether straw ab with end points a and b intersects with straw cd (with end points c and d).
To get full credit also explain how the elementary step i) can be done. If you cannot find an algorithm for this step, assume an O(n 2 ) algorithm and explain how to find all pairs of straws that are connected.
Analyse and explain the worst-case computational complexity of your algorithm in terms of n.| Report Duplicate | Flag | PURGE
Microsoft Jr. Software Engineer Algorithm - 0of 0 votes
AnswersWe are speaking about a web page of Todo tasks.
- noam.nta May 06, 2015 in United States
I want the option to add task, edit task or delete task, and mark task as completed (or vice versa).
I also want the ability to filter the tasks by completion status (pending, completed, all).
Please accomplish one of the requirement using directive.
You should write this code in Java Angular| Report Duplicate | Flag | PURGE
Apple Jr. Software Engineer - 0of 0 votes
AnswersInsert a value into a sorted linked list.
- zsalloum May 01, 2015 in United States
Using C/C++ write a small function (around 5 lines in the body) to insert a value in a sorted linked list. Take into consideration that the list might be empty at first, and the function should cover the cases of insertion at the head and tail...
PS what the interviewer is looking for is the ability to write a small C/C++ code that solves the question and not the algorithm per se which is trivial| Report Duplicate | Flag | PURGE
Microsoft Jr. Software Engineer C C# C++ Linked Lists - 0of 0 votes
AnswersThere is a data structure called mySruct and it contains a, b , c all three of type int . Which means that any data structure takes up 12 bytes . Then in the main define an array of 3 myStructs (ie taking up 36 bytes .. ) . Then define char * and make him an assignment to array( with casting ) . Then do
- Stella April 15, 2015 in United States
16 = + c * . That is, come to b in second myStruct. Then do c = 10 , and ask what 's going on?
So the answer is that arr [0] -> b becomes 10| Report Duplicate | Flag | PURGE
Amazon Jr. Software Engineer - 0of 0 votes
Answersclass a{
- emcho.coh April 12, 2015 in United States
public int x=7;
public int y=9;
void f1(){x=24;}
void static f2(){y=35;}
}
what problem in the code?
what is need to change in the code for compaling?| Report Duplicate | Flag | PURGE
Amazon Jr. Software Engineer - 1of 1 vote
AnswersYou need to generate all possible permutations of phone numbers of a certain length, except
- apil.tamang.backup April 02, 2015 in United States
a) two digits can not be next to each other,
b) cannot contain digits from a given list of exclusion
c) if number contains 4, must start with 4 as well.| Report Duplicate | Flag | PURGE
Epic Systems Jr. Software Engineer - 0of 0 votes
AnswersAs part of our recruitment process for developers, we give our candidates the following programming exercise to
- emcho.coh March 05, 2015 in United States
allow us to asses coding style and design. The exercise is to write a minimalistic game in a programming language of
your choice (from a given list) according to the description below.
Please note that we do not intend that you will invest a lot of time in the implementation and make something that
looks like a real game. What we mainly care about is good design and coding style.
In our game there is a carousel with 8 seats in the center of the screen. On the left side of the carousel, there is an
additional seat labeled ‘Start’ and to its right, a seat labeled ‘Finish’. There are 4 kids on the carousel at random
seats. You have an avatar who is initially found in the ‘Start’ seat
Your goal is to move your avatar to the ‘Finish’ seat. You move your avatar using the ‘Jump’ button. When clicking
the button the nearest seat to the current seat of your avatar is considered: if this seat is vacant, your avatar will
move to this vacant seat and you get 10 points, if the seat is taken you lose a life point.
The challenge is that the carousel is constantly rotating clockwise. To be clear, the carousel rotation is smooth (not in
steps of a seat).
If your lives go to 0, the game ends. When you reach the ‘Finish’ seat, you get 50 points and the carousel increase its
rotation speed, now your goal is to go back to the ‘Start’ seat, and on it goes.
Tips & comments:
• The tricky part of the exercise is the spinning carousel. Of course the seat and people that are on the
carousel are moving in circles. There are two ways that you can implement this:
1. By thinking of the table as standing still and the seats as moving in circles.
2. Using affine transforms.
We suggest that you use the first approach as it will be simpler. The second approach has some advantages,
but use it only if you are familiar with it.| Report Duplicate | Flag | PURGE
Jr. Software Engineer - 0of 0 votes
AnswersHow long it will take to download a file containing all words of English dictionary on to the RAM
- printfNum September 16, 2014 in United States| Report Duplicate | Flag | PURGE
Jr. Software Engineer