abc Interview Questions
- 0of 0 votes
AnswersHow to export Exchange 2010 Mailbox to PST
- kritimax4 February 01, 2023 in United States| Report Duplicate | Flag | PURGE
A9 abc - 0of 0 votes
AnswersCall Girls in Aerocity|Call Me 8448073993
- anushkadelhi2 August 09, 2022 in India for anushkadelhi| Report Duplicate | Flag | PURGE
Galatea Associates abc - 0of 2 votes
Answerslogical questions I have two container 2lit and 4lit. i have to fill 3litre with efficiently. how do yu fill it
- sneganarasiman June 12, 2021 in India| Report Duplicate | Flag | PURGE
m abc - 2of 2 votes
AnswersYou have to make a necklace with pearls. Minimum number of pearls that can be used is 1 and maximum is n. Each pearl has a magnificence coefficient and the necklace should be such that the pearls are in ascending order of their magnificence. Find such number of necklaces that can be formed with given condition.?
- shivamdurani220 August 22, 2018 in India| Report Duplicate | Flag | PURGE
PayPal abc - 0of 0 votes
AnswersLanguage : java
- sarunreddy82 April 27, 2018 in United States
Find the length of the non repeated numbers in an array.
Input : 1,2,2,3,4,5,6,2,3| Report Duplicate | Flag | PURGE
xyz abc Arrays - -2of 2 votes
Answerswhat is a router? http://www.foodspotting.com/4682691
- jitendrasingh7258 January 06, 2018 in United States for 0| Report Duplicate | Flag | PURGE
A9 abc - 0of 0 votes
AnswersFind valid bracket from provided string. Only { [ ( are involved as brackets. A valid bracket contains with a enclose companion.
- Sat December 19, 2017 in India
Example: {} is valid, [[] Invalid
Input: {[()]}[]() Result: Valid
Input: {}[]()( Result: Invalid| Report Duplicate | Flag | PURGE
abc Senior Software Development Engineer - 0of 0 votes
Answerswindows technical support number ― 1800-653-1176 ― microsoft windows technical support number ― G/Irux
- contribuor December 19, 2017 in United States| Report Duplicate | Flag | PURGE
Absolute Softech Ltd abc - 0of 0 votes
Answersblack magic specialist baba ji +91 8440828240 kolkata
- kkbaba33 December 07, 2017 in India| Report Duplicate | Flag | PURGE
AMD abc - 0of 0 votes
AnswersHow to annihilate twisted FB issues via Facebook Customer Service 1-877-470-3053?
- devinlllee123 December 05, 2017 in United States| Report Duplicate | Flag | PURGE
xyz abc - 0of 0 votes
AnswersHow To Install FB Messenger On I-Phone? Get Facebook Customer Service?
- devinlllee123 December 05, 2017 in United States| Report Duplicate | Flag | PURGE
monktech.net abc - 0of 0 votes
AnswersHow to Do Business On FB? Grab Facebook Customer Service 1-877-470-3053
- ThomasMargaret654 December 05, 2017 in United States| Report Duplicate | Flag | PURGE
xyz abc - 0of 0 votes
AnswerHow to Edit Temporary Profile Photo? Get Facebook Customer Service 1-877-470-3053
- ThomasMargaret654 December 05, 2017 in United States| Report Duplicate | Flag | PURGE
xyz abc - 0of 0 votes
AnswersHow to use Facebook for promotion via Facebook Customer Service 1-877-470-3053?
- ThomasMargaret654 December 05, 2017 in United States| Report Duplicate | Flag | PURGE
xyz abc - -1of 1 vote
AnswersGet fast and reliable technical support for your any type of issue related to facebook. Facebook is the largest used social platform, many time users got some technical issue that are not solvable from their end. In this situation they need help from technical experts of facebook. By dialing facebook contact number 1 866 324 3042 toll-free, you will get connected with the most reputed team of technical experts.
- martindaniel0309 November 15, 2017 in United States
For more info, visit at http://www.facebookhelp.us| Report Duplicate | Flag | PURGE
Facebook Customer Service abc - 0of 0 votes
AnswersCount number of ways to paint a fence with N posts using K colors, where no FOUR consecutive fences can have the same color.
- Basmati November 09, 2017 in United States| Report Duplicate | Flag | PURGE
Adobe abc Algorithm - 1of 1 vote
AnswersTesting Strings
- pooja.senger86 October 29, 2017 in United States
Mr X and Mr Y, his friend are programmers and testers respectively working in the same company. So, once they faced the following scenario :
Mr X wrote an application that took as input some user data. The data the application took as input was a string in some strange language. That language consisted of
K
K distinct letters. However, due to some issues, the application got corrupted and one particular String among many was lost.
However, Mr X had seen that String once before it got lost. He remembers some info about it. Particu-larly, he remembers the lost String had length equal to
M
M.
Mr Y, being the chief QA person in his company needs to try and figure out the number of possible different possible candidate Strings for the lost String.
Mr X remembers N pieces of info. For each one, he gives you 2 numbers
L
L and
R
R and a number
Z
Z. He remembers for sure that the
Z
t
h
Zth letter of the language of the string did not occur between positions
L
L and
R
R inclusive of the lost String.
Input Format :
The first line contains
3
3 space separated integers
N
N ,
M
M and
K
K.
Each of the next
N
N contains
3
3 space separated integers, denoting
L
L ,
R
R and
Z
Z respectively.
Output Format :
You need to find and print the number of different possible candidate Strings for the lost String based on the info Mr X remembers. As the number of such Strings can be large, print it Modulo
10
6
+
3
106+3
Constraints:
1
≤
N
,
M
,
K
≤
10
5
1≤N,M,K≤105
1
≤
L
≤
R
≤
M
1≤L≤R≤M
1
≤
Z
≤
K
1≤Z≤K
Sample Input
1 2 26
1 2 1
Sample Output
625| Report Duplicate | Flag | PURGE
A9 abc .Net/C Java - 0of 0 votes
AnswerToday Jin has given a task to Shino, Shino has to travel from cell
- pooja.senger86 October 29, 2017 in United States
(
1
,
1
)
(1,1) to cell
(
N
,
M
)
(N,M) in a grid of size
N
∗
M
N∗M. But in order make this task interesting for Shino, Jin has decided to keep some special candies in some
K
K special cells of the grid, where each candy has an amount of happiness associated with it.
Shino can travel only in right & down direction in the grid, as he is too careful & does not want to fall out of grid. Now, we call the value of a path the happiness of all cells lying on the path. All non-special cells have happiness equal to
0
0.
Now, you need to find and print the sum of the values of all paths from
(
1
,
1
)
(1,1) to
(
N
,
M
)
(N,M), traveling only right and down to an adjacent cell.
As Shino is not good at counting help him find the answer.
Input Format
The first Line contains a single integer
T
T denoting number of test cases
The next line contains
3
3 space separated integers,
N
N,
M
M and
K
K where N * M is the size of grid & K denoting number of special cells
The next
K
K lines contains three integers
X
i
,
Y
i
,
H
i
Xi,Yi,Hi where
(
X
i
,
Y
i
)
(Xi,Yi) is cell coordinate &
H
i
Hi is the amount of happiness Shino will get from a candy at cell
(
X
i
,
Y
i
)
(Xi,Yi)
Constraints
1
≤
T
≤
3
1≤T≤3
1
≤
N
,
M
,
K
≤
10
5
1≤N,M,K≤105
1
≤
X
i
≤
N
,
1
≤
Y
i
≤
M
1≤Xi≤N,1≤Yi≤M
1
≤
H
i
≤
10
5
1≤Hi≤105
Output Format
For each test case you will output a single integer denoting the total amount of happiness Shino will get. As the answer can be quiet large you can output answer modulo
10
9
+
7
109+7
Sample Input
1
2 2 2
1 2 4
2 1 7
Sample Output
11| Report Duplicate | Flag | PURGE
A9 abc .Net/C Algorithm Java - 0of 0 votes
AnswersYou have a long string that contains of 0's and 1's, seprated with some delimiter (like "!"). the number of delimeters after each 0 or 1 is between 1 to 3.
- Patrick July 15, 2017 in United States
for example a string such as 0! 1!!! 0!! 1!! 0! 1! 0!!! 1!! 0!! (and so on...)
Take this long string and convert it to a 7 digits number by some porgramming algorythem,
(you can use every lanugage you want)| Report Duplicate | Flag | PURGE
A9 abc Arrays - 0of 0 votes
AnswersWant Facebook Customer Service Number ?
- thedevicesupport June 09, 2017 in United States| Report Duplicate | Flag | PURGE
ADP abc - 1of 1 vote
AnswersCross the street
- pbox February 18, 2017 in United States
ABC Company is involved in the logistics business.
The company has many outlets and stockyards in a city. The city is like an
N
×
M
N×M grid. We consider a single cell of the given grid to be a single block in the city. The stockyard is at the upper-left corner and the outlet is located in the lower right corner. Everyday, one of the employees has to travel from the upper left to the lower right corner for supplies. Each block in the city has a height, where the height of the block located at position (i,j) in the grid is equal to
A
[
i
]
[
j
]
A[i][j]. The company wants to change the heights of some of the blocks, so that the employee can enjoy a high-speed drive from the stockyard to the outlet. But this change comes at a certain cost.
Specifically, if they change a block height from x to y, then they must pay exactly
|
x
−
y
|
|x−y| dollars. Please help them find the minimum cost, such that by spending that specific amount, they can get a path from stockyard to the outlet with all blocks along the path having the same height.
In a single move, the employee can move from a block to any of its adjacent blocks. Note that during this journey, the employee is allowed to move in all four directions, fulfilling the condition that he never goes out of the grid at any point in time.
Input :
First line contains two positive integers N and M - number of rows and columns in the city. Then, N lines follow, each containing M integers, where the
j
t
h
jth integer on the
i
t
h
ith line denotes
A
[
i
]
[
j
]
A[i][j].
Output :
The first and only line of output should contain minimum cost.
Constraints :
1<= N, M <=100
1<= height of blocks <=100
Sample Input
5 5
1 1 1 1 1
9 9 9 9 1
1 3 3 3 1
1 9 9 9 9
1 1 1 1 1
Sample Output
6
Explanation
Optimal path taken by the employee will be : (1,1) -> (1,2) -> (1,3) -> (1,4) -> (1,5) -> (2,5) -> (3,5) -> (3,4) -> (3,3) -> (3,2) -> (3,1) -> (4,1) -> (5,1) -> (5,2) -> (5,3) -> (5,4) -> (5,5) The height of each block along this path can be changed to
1
1, at a total cost of
6
6. There is no way to get a cost less than this.| Report Duplicate | Flag | PURGE
abc Software Engineer Coding - -2of 2 votes
AnswersGmail Technical support number: Maximum personality advocated making smooth communication to save your phone bill. Hence, they are addicted into in built chatting service and incredible Gmail tech support. Even through filling the accurate credential details in the form of the user name and password, establishing the user friendly communication without the error message and prompt is not easy task. If you are getting difficulty to access your account to enjoy all cheered function, then you should have to get assistance of expert through dialing Gmail technical support phone number +44-8000-9039-09. Otherwise, you will have to bear several losses in the Gmail account. Our team is offering support at nominal price value. At the peak of urgency, you should have to dial our toll free number.
- davidsmith85878 February 14, 2017 in uk
for more info visit-http://www.customer-emailsupportnumber.com/gmail-support.html| Report Duplicate | Flag | PURGE
xyz abc Gmail customer care phone number +44-8000-9039-09 - 0of 0 votes
AnswerI
- shaina.verma26 September 28, 2016 in United States for IOT| Report Duplicate | Flag | PURGE
MAGMA abc Python - 0of 0 votes
AnswerWrite code in C to implement 2048 game in c
- bharadwajdaya July 05, 2016 in India
?| Report Duplicate | Flag | PURGE
Pubmatic abc - 0of 0 votes
AnswerWrite a program to detect cycle in loop.
- punapuna86 June 24, 2016 in United States| Report Duplicate | Flag | PURGE
A9 abc Algorithm - 0of 0 votes
AnswersWrite a program to sort an array in nlog(n) complexity
- punapuna86 June 24, 2016 in United States| Report Duplicate | Flag | PURGE
A9 abc Algorithm - 0of 0 votes
AnswerWrite an algorithm to randomize nodes of a Binary Tree without using any data structures
- punapuna86 June 24, 2016 in United States| Report Duplicate | Flag | PURGE
A9 abc Algorithm - 0of 0 votes
Answershow to restrict creation of object inside the function fun
- jkl June 19, 2016 in India
although destructor and constructor is private??
#include <iostream>
class ABC
{
private :
~ABC()
{
}
ABC()
{
std::cout <<"ABC";
}
public:
static void fun()
{
ABC t;
}
};
int main()
{
ABC::fun();
}| Report Duplicate | Flag | PURGE
Microsoft abc - -5of 5 votes
Answerswkhdqwdhqowdh
- saim May 08, 2016 in United States for qwe| Report Duplicate | Flag | PURGE
A9 abc Android - 0of 0 votes
AnswersWrite a java program:
- sarath.chalasani46 April 26, 2016 in India
There is plant species (say P) in a desert that has a specific living pattern. A rectangular
field of the land is divided into squara cell.The land will have R rows and C columns of the
cell.Each cell will be surrounded by up-to eight neighboring cells(note that the cells at the
edge of the field will have fewer then eight nuighboring cells). A cell can either be empty
(having no plant in it) or living(having a plant in it).A particular cell is said to have N
neighbors(1<N<8), if exactly N cells in the neighborhood have living plants.
the plants fallow a certain rules for survival.the rules are as fallows.
1) if a cell with plant s1 to s2 neighbors (1<=s1<=s2<=8), it survives to the next generation.
i.e. the plant dies if it has less than s1 neighbors or more than s2 neighbors.
2) If an empty cell has B1 to B2 neidhbors (1<=B1<=B2<=8), a new plant takes birth in that cell
in the next generation.
Input Specification:
theinput will have two arrays, as fallows
1)An integer array: {R,C,S1,S2,B1,B2,G}
where R and C specify size of the field in row and columns respectively, with 1<=R<=2000 and
1<=C<=2000 s1,s2,B1 and B2 are integers as explained in the survival rules. G is the number of
generations for wich the simulation has to be run.
2)An integer array specifying intial state of the field: size of the array will be R*c
the data will be expressed in the array as fallows:{E11,E12,E1c,E21,....,E2C,ER1,ERC} where Eij
is cell in the field at ith row and jth column. Eij can have value 0 or 1. 0 corresponds to
empty cell and 1 corresponds to living cell.
output specification:
output will be an integer array specifying state of the field at the end of the simulation in
the same manner as in input.
Examples:
Example 1:
input1: {3,4,2,3,3,3,3}
input2: {0,1,0,0,0,1,1,0,1,0,1,0}
output : {0,1,1,1,0,0,0,1,0,0,1,0}
Example 2:
input1: {3,4,2,3,3,3,4}
input2: {0,1,0,0,0,1,1,0,1,0,1,0}
output: {0,0,1,1,0,1,0,1,0,0,0,0}
Method Signature:
public static int[] survivalcells( int[] input1,int input2){
}| Report Duplicate | Flag | PURGE
ADP abc