CareerCup

Phone number for Malwarebytes premium support

Power list has the following conditions
first element should b1
Next L2 element should be 2
Next L3 element should be 3
Next L4 element should be 4
Next L5 element should be 5
Next L6 element should be 6
Next L7 element should be 7
Next L6 element should be 6
...
Next L1 should be 1

e.g.,
1 2 3 4 5 6 6 7 6 5 4 3 2 1 -- power list
1 2 3 4 5 6 7 6 5 4 3 2 11 - not a power list since last two elements are 1 .

Wrte a code to find out whether arr [] represents a power list or not.

in Cracking the coding interview book 6th edition page 42 says that O(5 * 2^n + 1000 * N^100) = O(2^n)... I tried a sample code and got n^100 is greater than 2^n...

Can we write a Fixed LOD inside a Fixed LOD.

There is Tableu dashboard on Production server and you dont have access to it. You have this dashboard with staging data(not production data). This dashboard has performance issue. How will you fix this problem.

Employee Salary Department
A 1000 IT
B 2000 IT
C 3000 IT
D 4000 HR
E 2000 HR
F 1500 IT
G 7000 HR
Write a query to get results like below -
Employee Salary Next highest salary(in same department) Department
A 1000 2000 IT
B 2000 3000 IT
.
.
E 2000 4000 HR

House No Members
1100 John, mary, kim, ash
1101 Dan, Roger, kee
Write a query to get in below format-
House No Person
1100 john
1100 mary
1100 kim
1100 ash
1101 Dan
1101 roger
1101 kee

If ( a = True){
If (b = True){
Approve credit card;
}
Else {
Disapprove credit card;
}
}
Else {
If(C=False){
IF(D=True){
Approve Credit card;
}
else {
Diapprove credit card;
}
}
}
Simplify above written code.

While designing a Table in database, how will you determine its performance?

Given n number of persons in a park. One of them is having a virus. But we don't know whom. Also, the position of all persons is given. A contaminated person can spread it up to d distance. When the best case (Spread is minimum) and the worst case(Spread is maximum) would occur?e.g.
N=5
Position=[1, 3, 5, 9, 14]
d=5

our services… Guaranteed 100%we sell SSD Chemical Solution used to clean all type of black and any color currency, stain and defaced bank notes with any others equipment being bad. Our technicians are highly qualified and are always ready to handle the cleaning perfectly. Our Chemical is 100% pure. We clean all currencies like the Euro, USD, GBP and many other currencies. Anti-freezing Preparations and Prepared De-icing Fluids, SSD Solution. Vectrol paste, Tebi-Manetic solution, Defaced currency, Cleaning chemical. Darkened currency, Black coated notes, Cleaning black money,vectrol paste, SSD solution, super automatic solution,anti-breeze bank notes, black marked currency, black coated notes, cleaning Black money. We work on commission and we also offer machines to do the large cleaning and delivery of products to buyers destinations.for more information please do contact us back we are ready and willing to sell you our product in any quantity as demanded.
Whats App : +27833928661

100% SSD cleaning chemical solutions for sale +27833928661 in SOUTH AFRICA SASOLBURG SEBOKENG MAYTON- alberton ,Nairobi,
East London Tembisa , Cape Town Durban Johannesburg Soweto Pretoria Port Elizabeth Pietermaritzburg Benoni Vereeniging Bloemfontein Boksburg Welkom Newcastle Krugersdorp Diepsloot Botshabelo Brakpan Witbank Richards Bay Vanderbijlpark Centurion Uitenhage Roodepoort Paarl Springs Carletonville Klerksdorp Midrand Westonaria Middelburg Vryheid Orkney Kimberley eMbalenhle Nigel Mpumalanga Bhisho Randfontein
AUTOMATIC SSD CLEANING CHEMICAL SOLUTION FOR SALE
NORMAL SSD CLEANING CHEMICAL SOLUTION FOR SALE

Super Automatic SSD Solution Call On +27833928661 in Africa-Asia-Europe-South Africa-Ghana-Zambia

Given a binary tree, find the maximum product path.
In other words, find the path inside the binary tree which has maximum product.

Sum of series (n/1) + (n/2) + (n/3) + (n/4) +…….+ (n/n). 1 <= n <= 10^12

You are driving a bus along a highway, full of rowdy, hyper, thirsty students and a soda fountain machine. Each minute that a student is on your bus, that student drinks one ounce of soda. Your goal is to drop the students off quickly, so that the total amount of soda consumed by all students is as small as possible.You know how many students will get off of the bus at each exit. Your bus begins somewhere along the highway (probably not at either end) and moves at a constant speed of 37.4 miles per hour. You must drive the bus along the highway; however, you may drive forward to one exit then backward to an exit in the opposite direction, switching as often as you like. (You can stop the bus, drop off students, and turn around instantaneously.)Describe an efficient algorithm to drop the students off so that they drink as little soda as possible. Your input consists of the bus route (a list of the exits, together with the travel time between successive exits), the number of students you will drop off at each exit, and the current location of your bus (which you may assume is an exit). How would you approach this problem

Write test Case for Amazon search plugin with a drop-down, search text box and submit button

Amazon website was working fine till yesterday.
//However in last 24 hours, the order processing(Delivery Estimates) has been taking longer than usual.

Write Test data for the program which finds the distance between 2 given character of a sentence.
// SAMPLE INPUT: findDistance("Ajay is here", A, h) => 10

Question 2) You have given a 2D binary matrix of size M[N-1][N-1]. Consider 1's as a
path and 0's as a deadend. The person starts from M[0][0] and needs to reach at point
M[N-1][N-1]. He can either move forward and down. You need to calculate the path to
reach the destination.

M[N][N] = 1 0 0 0
1 1 0 0
0 1 1 0
1 1 1 1

Tips to learn German Language

A Fibonacci sequence is defined recursively by:

F0 = 0
F1 = 1
Fn = Fn − 1 + Fn − 2, for integer n > 1.

One way of generalizing the Fibonacci sequence is by starting with any pair of numbers and extending to negative values of n.

Given two terms of a generalized Fibonacci sequence Fp and Fq, their positions p and q respectively and a position r, find Fr.

Input Format
The first line of the input contains an integer t denoting the number of test cases.

Each test case contains three lines.

    First line of each test case contains two space separated integers p and Fp
    Second line contains two space separated integers q and Fq
    Third line contains an integer r

Output Format

For each test case, print Fr which is the term of the sequence at position r.

If Fr is not an integer, represent it as an irreducible fraction in the form a/b where b > 0.
Sample Input


0 1
6 13
10
3 65
6 315
-10
0 11
1 -6
2
9 36
15 646
-5
11 72
20 5473
6

Sample Output

89
4620
5
-1/4
13/2

Create a table EMP with the following structure.


Name Type

EMPNO NUMBER(6)

ENAME VARCHAR2(20)

JOB VARCHAR2(10)

MGR NUMBER(4)

DEPTNO NUMBER(3)

SAL NUMBER(7,2)

Implement an algorithm that takes in a string containing a parenthesized expression and prints it out with all sibling expressions at the same indent level, each on its own line.

Definitions:
A parenthesized expression consist of an opening parenthesis, one or more expressions separated by one or more spaces, and a closing parenthesis.
An expression is either a word or a parenthesized expression.

Reinstall AOL Desktop Gold to avoid hitches

Examples:
(((abc))) --> abc
(ab(c)) --> ab(c)
(abc09%(c)) --> abc09%(c)
ab(c) --> ab(c)
(ab)c --> (ab)c
abc(c)) → INVALID
(abc)(def) --> (abc)(def)
(abc)typ(def) --> (abc)typ(def)
((abc)(def)) --> (abc)(def)

You are in charge of designing a small, in-memory social network, with the basic functionality of adding friendship
between two people via an AddFriendship function, and a GetSuggestedFriends function for a particular user in the
network. The criteria is to pick someone with whom the given user has the most number of friends in common.

Start by discussing the most suitable data structure, and implement all the objects and functions.

Write all possible scenarios for youtube app on your TV

Program to find the frequency of each element in the array OR write a program to count the occurrence of each number in a given string

text = 'ABCDEFGHIJ'
output = '"A""