abc Interview Questions
 0of 0 votes
Psychic healer  Spiritual Rats  amagundane  money spells  Sangoma +27634299958 Baba Messe
Sangoma in Cape town charge R.5000 as an upfront fee.“
Am called Sangoma baba Messe and i specialize mainly in amagundwane/spiritual rats together with my great fathers and i perform the ritual which is a mixture of magic and muthi and we send rats steal money.“A person must state how much he wants. You can state R.500,000 to R.10 millions – the rats will deliver it for you wherever you are! No one sees them because it’s magic,”
I Baba Messe from Gauteng i can assure you that this is the only legit way rats can make you rich.
“The person who requests the money is allowed to spend it on anything he or she wants for the rest of their life. But he or she can go back again and request for another ritual its fine. If you're not completely satisfied, we'll refund your money, period, no questions asked,” My Potential money Spells Can Help You Attract Cash & Strike it Rich. Get the Wealth You Deserve!
If you're not completely satisfied, we'll refund your money, period, no questions asked,”
Baba Messe;
spiritualratsandmoneyspell@gmail.com
https://spiritualrats.wordpress.com/
https://www.youtube.com/watch?v=2_cnbcIp_u4
https://www.youtube.com/watch?v=3kfDMKwevro
https://www.youtube.com/watch?v=BuvsNSQXQWA
https://www.youtube.com/watch?v=NGQAMsGiDo
https://twitter.com/amagudwane
https://za.pinterest.com/babamesse/
http://spiritualrats.altervista.org
 0of 0 votes
Language : java
Find the length of the non repeated numbers in an array.
Input : 1,2,2,3,4,5,6,2,3
 2of 2 votes
what is a router? http://www.foodspotting.com/4682691
 0of 0 votes
Find valid bracket from provided string. Only { [ ( are involved as brackets. A valid bracket contains with a enclose companion.
Example: {} is valid, [[] Invalid
Input: {[()]}[]() Result: Valid
Input: {}[]()( Result: Invalid
 0of 0 votes
windows technical support number ― 18006531176 ― microsoft windows technical support number ― G/Irux
 0of 0 votes
black magic specialist baba ji +91 8440828240 kolkata
 0of 0 votes
How to annihilate twisted FB issues via Facebook Customer Service 18774703053?
 0of 0 votes
How To Install FB Messenger On IPhone? Get Facebook Customer Service?
 0of 0 votes
How to Do Business On FB? Grab Facebook Customer Service 18774703053
 0of 0 votes
How to Edit Temporary Profile Photo? Get Facebook Customer Service 18774703053
 0of 0 votes
How to use Facebook for promotion via Facebook Customer Service 18774703053?
 1of 1 vote
Get 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 tollfree, you will get connected with the most reputed team of technical experts.
For more info, visit at http://www.facebookhelp.us
 0of 0 votes
Count number of ways to paint a fence with N posts using K colors, where no FOUR consecutive fences can have the same color.
 0of 0 votes
Testing Strings
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. Particularly, 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
 0of 0 votes
Today Jin has given a task to Shino, Shino has to travel from cell
(
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 nonspecial 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
 0of 0 votes
You 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.
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)
 6of 6 votes
DELL is a very well known leader in manufacturing computers worldwide. Company has already given its best to manufacture a user friendly computer. But sometimes due to improper use and incorrect configuration, a technical issue arises and make the user upset. So, In this situation, a user can directly connect to professional technicians by just dialing DELL customer support phone number +18005822826. User will get the instant solution here.http://www.customersupporthelp.com/dell
 0of 0 votes
Want Facebook Customer Service Number ?
 1of 1 vote
Cross the street
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 upperleft 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 highspeed 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.
 2of 2 votes
Gmail 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 +448000903909. 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.
for more info visithttp://www.customeremailsupportnumber.com/gmailsupport.html
 0of 0 votes
I
 0of 0 votes
Write code in C to implement 2048 game in c
?
 0of 0 votes
Write a program to detect cycle in loop.
 0of 0 votes
Write a program to sort an array in nlog(n) complexity
 0of 0 votes
Write an algorithm to randomize nodes of a Binary Tree without using any data structures
 0of 0 votes
how to restrict creation of object inside the function fun
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();
}
 5of 5 votes
wkhdqwdhqowdh
 0of 0 votes
Write a java program:
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 upto 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){
}
 0of 0 votes
you are given an MxN matric.Every cell of the matrix has a cost associated. initially you are at(0,0) and you have to reach (M1,N1). Question is to find the minimum cost path from (0,0) to (M1,N1) and also the minimum cost. From a cell you can only make a move to right cell or down cell or diagonally lower cell.
Input Specification:
Input1: A string array containing rows of the cost matrix as element.
input2: An integer having number of rows in the cost matrix.
For above example, the matrix would be {5#7#2#4,1#8#1#3,6#2#9#5,1#6#2#8} and number of rows would be 4.
output Specification:
The output will be a string containing minimum cost and the path chosen separated by the comma.
For Example , Given the cost matrix
5 7 2 4
1 8 1 3
6 2 9 5
1 6 2 8
1) minimum cost value is 5+1+2+2+8=18
2) minimum cost path from (0,0,) to (M1,N1) is BDDR
B for down move
D Diagonal Move
R Right move
NA No solution
Hence your output will be 18,BDDR
method signature:
public static String minimumCost(String[] input1, int input2) {
}
 0of 0 votes
There are N friends sitting in a circle, they are numbered clockwise 1 to N. Game starts with
player 1 receiving the ball. A player needs to pass the ball to other player based on some
conditions.
1. if he is receiving ball for pth time,he passes that ball to persion L places to left if P is even
or L places right if P is odd.
2. if any player receives the ball M times then game is over.
Eample :
Input 1(N):5
Input 1(M):3
Input 1(L):2
Output: 10
Explanation:
First player 1 gets tha ball. since he has held the ball 1 time , he passes the ball to player 4,
who is two places to his right. this is player 4 first time holding the ball, so he gives it to
player 2, who passes it to player 5. player 5 then passes the ball to player3. who passes it
back to player 1.since player 1 has now held the ball 2 times, hepasses it to player 3, who
passes it to player 5, who then passes the ball to player 2. finally, player 2 passes the ball to
player 4, who then passes it to player 1. player 1 has now held the ball 3 times, and the game
ends.