## Akamai Interview Questions

- 0of 0 votes

AnswerWrite an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum.

- Nits January 30, 2020 in United States| Report Duplicate | Flag | PURGE

Akamai Research Scientist - 0of 0 votes

AnswersDesign a portal for registration for a dog show

- interviewquestionsseeker September 07, 2018 in United States| Report Duplicate | Flag | PURGE

Akamai Software Engineer - 0of 0 votes

AnswersFind 2nd duplicate in an array

- interviewquestionsseeker September 07, 2018 in United States| Report Duplicate | Flag | PURGE

Akamai Software Engineer Algorithm - 0of 0 votes

AnswersGiven 2 sets of words. Find the words in 2nd set that begin with any word in the 1st set.

- interviewquestionsseeker September 07, 2018 in United States| Report Duplicate | Flag | PURGE

Akamai Software Engineer Algorithm - 0of 0 votes

AnswerLargest Sum Contiguous Subarray

- interviewquestionsseeker September 07, 2018 in United States| Report Duplicate | Flag | PURGE

Akamai Software Engineer Algorithm - 1of 1 vote

Answersjava program to interchage continous vowels in a string

- kancharlaratna July 10, 2017 in United States

ex:vowels

becomes vewols

continuous becomes cintonouuus| Report Duplicate | Flag | PURGE

Akamai Software Developer - 1of 1 vote

Answerswrite a java program to solve sum of first three numbers is equal to sum of last three numbers.

- kancharlaratna July 10, 2017 in United States

String str="123" 1+2+3 and 3+2+1

String str="678786"

String str="1b8" not equal.| Report Duplicate | Flag | PURGE

Akamai Java Developer - 0of 0 votes

AnswersA college student's record contains the following:

- Maddy May 02, 2017 in India

1. Name

2. Age

3. Subject(s)

4. Marks

5. ID

The student can choose from English, Mathematics and History as subjects. A student can choose one, two or all of the subjects.

The requirement is to search for students who have scored marks more than X in a certain subject. Which Data Structure would you use and how would you solve this problem in an optimal manner?| Report Duplicate | Flag | PURGE

Akamai Coding - 1of 1 vote

AnswersGiven infinite supply of coins of denominations 25, 10, 5 and 1, find the distinct number of ways to use the coins to sum up to the given value

- mikewhity October 10, 2016 in United States

Find the best algorithm with the best time complexity| Report Duplicate | Flag | PURGE

Akamai Software Developer - 0of 0 votes

AnswersI have one output as bellow:

- Ghosh August 21, 2015 in India

NAME MAJ:MIN RM SIZE RO TYPE MOUNTPOINT

abc 202:0 0 7.9G 0 disk

`-xvda1 202:1 0 7.6G 0 part /

efg 202:16 0 54.2G 0 disk /mnt/

ijk 202:32 0 75.2G 0 disk

Now I want to get only those name which does not have any mount point. i.e., I want output as bellow:

abc

ijk

How can i achieve this using bash script?| Report Duplicate | Flag | PURGE

Akamai shell scripting - 0of 0 votes

AnswerGiven N natural numbers A1, A2, A3 . . . AN, you have process Q queries of following two types:

- sunilkanaujia.manit August 14, 2015 in India

1 i j: Perform the operation Ai = j.

2 L R: Print the LCM of the elements AL, AL+1, AL+2 . . . AR.

Here LCM stands for lowest common multiple. Please help Shil to open the lock.

Input

First line will contain integer N.

Second line will contain N natural numbers denoting array A.

Third line will contain number of queries Q.

Then next Q lines will contain either query of Type 1 or 2.

Output

For each query of Type 2 output the required answer. Since LCM can be very large output it modulus 109+7.| Report Duplicate | Flag | PURGE

Akamai Computer Scientist - 0of 0 votes

AnswersHow would you implement virtual functions in C?

- iwanna September 24, 2014 in United States| Report Duplicate | Flag | PURGE

Akamai Software Engineer / Developer C - 0of 0 votes

AnswerThere are two string pattern P and searching Expression Ex.. Ex is regular expression contains only # which stand for any character latest one length..

- yogi.rulzz September 17, 2014 in India

P:- ABABABA Ex:- A#B#A P and Ex are similar so its true.

example2. P: ABACBCB Ex:- A#B result:- true

Example:- P: ABCABCCE Ex:-A#C# result:- true, as P contains the expression as Ex

P: ABCABCCE Ex:-A#C false: P is doesnot contains the express like A#C

# --- means at least one or more character. In java language you have write the algorthim| Report Duplicate | Flag | PURGE

Akamai Development Support Engineer Algorithm - 0of 0 votes

AnswersThere are two string pattern P and searching Expression Ex..

- yogi.rulzz September 17, 2014 in India

Ex is regular expression contains only # which stand for any character latest one length..

P:- ABABABA

Ex:- A#B#A

P and Ex are similar so its true.

example2.

P: ABACBCB

Ex:- A#B

result:- true

Example:-

P: ABCABCCE

Ex:-A#C#

result:- true, as P contains the expression as Ex

P: ABCABCCE

Ex:-A#C

false: P is doesnot contains the express like A#C

#--- means at least one or more character.| Report Duplicate | Flag | PURGE

Akamai Development Support Engineer Algorithm - 0of 0 votes

AnswersThere are two string pattern P and searching Expression Ex..

- yogi.rulzz September 17, 2014 in India

Ex is regular expression contains only # which stand for any character latest one length..

P:- ABABABA

Ex:- A#B#A

P and Ex are similar so its true.

example2.

P: ABACBCB

Ex:- A#B

result:- true

Example:-

P: ABCABCCE

Ex:-A#C

false: P is doesnot contains the express like A#C

#--- means at least one or more character.| Report Duplicate | Flag | PURGE

Akamai Development Support Engineer Algorithm - 0of 0 votes

AnswersMost efficient way to check whether a number is Prime or not.

- gdg July 23, 2014 in United States| Report Duplicate | Flag | PURGE

Akamai - 0of 0 votes

Answers`struct node { int data; struct node* left; struct node* right; }; void Postorder(struct node* root,struct node** leaf) { if (root == NULL) return; if(root->data%2==0) *leaf->left=root; //WHY I'M GETTING PROBLEM IN THIS LINE //[Error] request for member 'left' in '* leaf', which is of non-class type 'node*' Postorder(root->left,leaf); Postorder(root->right,leaf); } int main() { struct node *root = newNode(1); root->left = newNode(2); root->right = newNode(3); struct node* leaf=root; Postorder(root,&leaf); getchar(); return 0;`

}

- gdg July 23, 2014 in United States| Report Duplicate | Flag | PURGE

Akamai - 0of 0 votes

Answersgiven a binary tree, assign a new next pointer to each node, such that next pointer points to any node which is right side of the node(ie it may point to its sibling right node , or a left node of next subtree).

if no node on right or if the node itself if right most, the next points to null`6`

`/ \`

`7-------->2`

`/ \ / \`

- talktomenow July 14, 2014 in United States`1 - ->5-->4 ->13`

| Report Duplicate | Flag | PURGE

Akamai Software Engineer / Developer Algorithm - 0of 0 votes

AnswersLook at the following pseudo-code, which computes the n-th Fibonacci number:

- Eliana December 12, 2013 in United States for games developing

int fibonacci(int n)

{

if (n == 0)

{

print(0)

return 0

}

if (n == 1)

{

print(1)

return 1

}

return fibonacci(n - 1) + fibonacci(n - 2)

}

If one calls fibonacci(3), then the following will happen:

* fibonacci(3) calls fibonacci(2) and fibonacci(1) (the first call).

* fibonacci(2) calls fibonacci(1) (the second call) and fibonacci(0).

* The second call of fibonacci(1) prints 1 and returns 1.

* fibonacci(0) prints 0 and returns 0.

* fibonacci(2) gets the results of fibonacci(1) and fibonacci(0) and returns 1.

* The first call of fibonacci(1) prints 1 and returns 1.

* fibonacci(3) gets the results of fibonacci(2) and fibonacci(1) and returns 2.

In total, 1 will be printed twice and 0 will be printed once.

We want to know how many times 0 and 1 will be printed for a given integer N.

INPUT

The first line contains an integer T, denoting the number of test cases.

The next T lines contain an integer N.

OUTPUT

For each test case, print one line of output which contains 2 integers separated by a space. The first integer is the number of times 0 is printed. The second integer is the number of times 1 is printed.

CONSTRAINTS

1 <= T <= 50

0 <= N <= 40

SAMPLE INPUT

2

0

3

SMAPLEOUTPUT

1 0

1 2| Report Duplicate | Flag | PURGE

Akamai Computer Scientist C++ - 0of 0 votes

AnswersIf you look at the following pseudo-code, which computes the n-th Fibonacci number:

- Eliana December 12, 2013 in United States for games developing

int fibonacci(int n)

{

if (n == 0)

{

print(0)

return 0

}

if (n == 1)

{

print(1)

return 1

}

return fibonacci(n - 1) + fibonacci(n - 2)

}

If one calls fibonacci(3), then the following will happen:

* fibonacci(3) calls fibonacci(2) and fibonacci(1) (the first call).

* fibonacci(2) calls fibonacci(1) (the second call) and fibonacci(0).

* The second call of fibonacci(1) prints 1 and returns 1.

* fibonacci(0) prints 0 and returns 0.

* fibonacci(2) gets the results of fibonacci(1) and fibonacci(0) and returns 1.

* The first call of fibonacci(1) prints 1 and returns 1.

* fibonacci(3) gets the results of fibonacci(2) and fibonacci(1) and returns 2.

In total, 1 will be printed twice and 0 will be printed once.

We want to know how many times 0 and 1 will be printed for a given integer N.

INPUT

The first line contains an integer T, denoting the number of test cases.

The next T lines contain an integer N.

OUTPUT

For each test case, print one line of output which contains 2 integers separated by a space. The first integer is the number of times 0 is printed. The second integer is the number of times 1 is printed.

CONSTRAINTS

1 <= T <= 50

0 <= N <= 40

SAMPLE INPUT

2

0

3

SMAPLEOUTPUT

1 0

1 2| Report Duplicate | Flag | PURGE

Akamai Computer Scientist C++ - 1of 1 vote

AnswersThe way a Knight

- Eliana December 12, 2013 in United States for games developing

Given a chessboard, consisting of n×n cells, several of them are cut. Find the path of minimum length for a Knight from one cell to another. The Knight can’t go through cut cells.

Specifications

Input

The first row is set to the number n (2 ≤ n ≤ 50). Each of the next n lines contains n symbols. The symbol # denotes the cut cell, the point - not cut cell, the symbol @ denotes the initial and final cell of the Knight's path (the chessboard contains two such characters).

Output If the path can not be constructed, print "Impossible". Otherwise display the same map as the input, but check all Knight intermediate positions with symbol @.

Example

Example input

5

.....

.@@..

.....

.....

.....

5

@..@.

..##.

.....

.....

.....

5

@....

..#..

.#...

.....

....@

Example output

Sample 1

...@.

.@@..

....@

.....

.....

Sample 2

@..@.

..##.

.@..@

..@..

@....

Sample 3

Impossible| Report Duplicate | Flag | PURGE

Akamai Computer Scientist C - 0of 2 votes

AnswersThere is an sorted array suppose 10 20 30 40 50 60 70 80 90. If we rotate it n times(suppose n = 3 in my case). The array will be 70 80 90 10 20 30 40 50 60. The total no of values which are not in right position 3(in this case which are 70 80 90) so we have to make a generalized solution. I was able to answer this in O(n) but he wants something which is lesser than O(n).

- tarunverma August 23, 2013 in India| Report Duplicate | Flag | PURGE

Akamai Java Developer Arrays - 0of 0 votes

AnswersWhich one you prefer and why?

- yogi.rulzz July 23, 2013 in India

Vector of pointer,reference and object. which one you will prefer.| Report Duplicate | Flag | PURGE

Akamai SDE-2 C++ - 0of 0 votes

Answersyou have given a post-fix of a binary try in which either you have 0 child(leaf node) or 2 child(internal node).

- yogi.rulzz July 23, 2013 in India

one more condition that all internal node are denoted via "i" and leaf node via "l".

we have to create this binary tree with this posfix.| Report Duplicate | Flag | PURGE

Akamai SDE-2 Algorithm - 1of 1 vote

AnswersHow can I store objects of differing types in a C++ container?

- crat July 04, 2013 in India| Report Duplicate | Flag | PURGE

Akamai Applications Developer - 1of 1 vote

AnswerFor each subject topic(like Maths,Physics,Java,Sql), I have some urls.

- Anonymous December 15, 2012 in India

In each url,I have a list of questions.

Now on each click(lets say Physics),I shall hit all urls(which could be in thousands) and then parse through them to get all the questions and persist them to DB.

Please tell me what can be the high levl and low level design for this in Java(Explain patterns that cn be used,Threads etc...)| Report Duplicate | Flag | PURGE

Akamai Java Developer Algorithm - 0of 0 votes

AnswersWrite an algorithm to scan all anagrams in a word doc.

- Anonymous December 15, 2012 in India

This should be done in minimum time possible.| Report Duplicate | Flag | PURGE

Akamai Java Developer Algorithm - 0of 0 votes

AnswersWrite a program to find the (n-3)rd element in a singly linked list of unknown length in a single pass...

- live September 04, 2012 in India| Report Duplicate | Flag | PURGE

Akamai Quality Assurance Engineer Data Structures - 0of 0 votes

AnswersWrite a program to find the middle element in a singly linked list of unknown length in a single pass...

- live September 04, 2012 in India| Report Duplicate | Flag | PURGE

Akamai Quality Assurance Engineer Data Structures

**CareerCup**is the world's biggest and best source for software engineering interview preparation. See all our resources.

Open Chat in New Window