CareerCup

+2347044586306#SECRET #OCCULTIt’s encourageable to see an individual trying to join us in pursuit of happiness and luxury, But you must also put things into consideration thereby knowing it’s takes a fortune to achieve entrance into the Grand sacred Temple of PARICIANA BROTHERHOOD OCCULT.————– +2347044586306 —————-We believe everyone has the potential to become whatever they chooses but often times 70% of Humanity have failed in the race of life thereby not been able to achieve anything here on earth, maybe because of FEAR & ANXIETY.We don’t force anyone to become a member here but of what benefit are you living a poor life, without hope for better opportunities, without hope of making your family proud, without making your children proud, without making yourself proud as an individual.The 7 Occult SECRETS will make you to understand that there are no rituals without danger and effects but at the same time anything that has danger and effect will definitely have Guidelines and caution, So when the guidelines and caution is given then you are now left with your school of thought which permits you to commemorate on the caution and Guidelines.————– –+2347044586306—————Though the days of human rituals has been condemned and abolished but it’s also known that ritual without sophisticated materials and mantles can never Pierce the heart of the spiritual world and it then becomes useless thereby causing harm and social disorder which might possibly ones Life.Here in PARICIANA Brotherhood occult we don’t settle for less, every ritual items & mantles required for ritual is been purchased no matter how much it takes.So when you think about becoming a member of this Occult have it in mind that it takes a great sacrifice to Pierce the heart of the spiritual world in order for an individual to acquire spiritual wealth and luxury, Call now for enquiries +2347044586306Many atimes has been defrauded in their pursuit for spiritual wealth thereby going back to the dust where they started from, why will an individual attempt joining Illuminati, Freemasons confraternity, odd-fellow. All this above mentioned confraternities they belong to different monopolies of Life which never grants you the ability to join unless you’re rich and famous for them to get more glory.So anyone telling you to come join this above mentioned confraternities will only defraud you and make you toodle in darkness, and make you an object of mediocrity in the society.Before you can be accepted as a member here you must pass through spiritual confirmation to know if your DESTINY will match the secret heart of this occult because only those their destiny matches the secret heart of this occult can be accepted to become a member here.Membership into the sacred heart of this brotherhood is free but you’re taking responsibility of every ritual items and mantles required for your initiation rituals, Call now for enquiries +2347044586306A certified member of this brotherhood is not allowed to introduce a new member in order for the “7 OCCULT SECRETS” of this brotherhood to be safe and not mentioned to a mediocre.That’s why we’re here online for your searching eg.I_WANT_TO_JOIN_OCCULT_FOR_MINEY_RITUALHOW_TO_JOIN_OCCULT_FOR_MONEY_RITUALI WANT TO JOIN OCCULT ILLUMINATII WANT TO JOIN REAL OCCULT TO BE RICHWHERE TO JOIN OCCULT FOR MONEY RITUALI WANT TO BE RICHI WANT TO BE FAMOUSWE ARE NOW HERE FOR YOU, TO GUIDE YOU THROUGH THE ULTIMATE PART OF WEALTH POWER PROTECTION AND EVERYTHING LUXURY CAN BRING HERE ON EARTH JOIN US TODAY TO GIVE YOUR LIFE A MEANING.CONTACT SPIRITUAL GRANDMASTER FOR ENQUIRIES +2347044586306——————-TEMPLE-MEDIA—————+2347044586306 JOIN PARICIANA OCCULT FOR MONEY RITUAL IN NIGERIA WORLDWIDE.CONTACT SPIRITUAL GRANDMASTER FOR ENQUIRES +2347044586306+2347044586306 OFTEN MANY HAS VENTURED INTO SPIRITUAL MEANS OF ACQUIRING LUXURY BUT ONLY FEW GET TO THE PEAK WHEN IT COMES TO SPIRITUAL WEALTH & LUXURY NOT BECAUSE THEY ARE SPIRITUALLY INFECTED OR UNWORHTY BUT IT’S ON CLEARER VIEW TO THE HUMAN WORLD NOW TO ACTUALLY KNOW THAT IT TAKES A GREAT SACRIFICE AND OFFERING TO PIERCE THE HEART OF THE SPIRITUAL WORLD IN ORDER TO MAKE A RFEQUEST NOT JUST TO MAKE A REQUEST BUT TO GET ANSWERS AND POSITIVE POSITIVE RESPONSE FOR THE SPIRITUAL GUARDIANS OF AGE.WE THE INITIATE MEMBERS OF PARICIANA BROTHERHOOD HAVE BEEN ABLE TO GAIN A SPIRITUAL CLOSE GUARDED SECRET OF ACQUIRING WEALTH POWER &PROTECTION FOR THE GUARDIANS OF AGE THROUGH THE ORDERS OF THE TEMPLE GRANDMASTER AND OTHER SPIRITUAL LEADERS OF THE GRAND LODGE TEMPLE.WE KNOW VERY WELL THAT EVERYONE THINKS THEY HAVE ALL IT TAKES TO BE RICH AND FAMOUS NOT MINDING THE FACT THAT ONLY FEW HAS THE ABILITY AND GRACE TO BE WEALTHY, BECAUSE IF MAKING WEALTH WAS THAT EASY EVERYONE SHOULD HAVE BEEN WEALTHY BY NOW. MAKING ENQUIRIES TO JOIN US HERE MIGHT BE OPEN FOR EVERYONE BUT NOT EVERYONE IS ACCEPTED AT THE END OF THE DAY.+2347044586306 OCCULT IS NOT FOR THE RICH OR POOR BUT FOR THE “DESTINED TO BE RICH” IT DOESN’T MATTER WHERE YOU ARE COMING FROM OR WHO YOU THINK YOU’RE, ONCE YOUR DESTINY MATCHES THE SPIRITUAL HEART OF THIS OCCULT YOU’RE CERTAIN TO BE ACCEPTED AND TRANSDFORMED FROM POOR TO RICH OR RICH TO RICHER & POWERFUL .ALL PARICIANA OCCULT INITIATE MEMBERS.PARICIANA BROTHERHOOD knows that everyone has great potential but often many have lost their self-esteem and their desire for a better life.All of us know that we can be better than we are. We are not living up to our potential. Yet we have this fear to take chances, to venture into unfamiliar enterprises and territories. Contact spiritual Grandmaster now for your enquiries +2347044586306

+2347044586306// #how to join occult for money ritual without human sacrifice

You have an integer array. Starting from arr[startIndex], follow each element to the index it points to. You continue to do this until you find a cycle. Return the length of the cycle. If no cycle is found return -1

forexample {1, 0}, 0) => 2
{1, 2, 0}, 0) => 3

Given a queue of songs(array of size `n`). A random value `k` is passed which can be less than or equal to `n`. You need to play(print) song at `kth` position, remove it and add it at the end of the queue.

**Example**:

Song Queue(Array): `[A, B, C, D, E, F, G, H, I, J]`

**1**. k = 3

Song at 3rd position, `C` played(Print) then added at the end of the Queue. Queue becomes

`[A, B, D, E, F, G, H, I, J, C]`

**2**. k = 5

`F` played. Queue becomes

`[A, B, D, E, G, H, I, J, C, F]`

**3**. k = 2

`B` played. Queue becomes

`[A, D, E, G, H, I, J, C, F, B]`

**4**. k = 8

`C` played. Queue becomes

`[A, D, E, G, H, I, J, F, B, C]`

**5**. k = 10

`C` played. Queue becomes

`[A, D, E, G, H, I, J, F, B, C]`

**Time Expectations**:
O(1) when selecting a song
O(1) when removing a song from the queue.
O(1) when adding a song back to end of the queue.

Top Facebook System Design Interview Questions
1. Design Facebook News Feed
2. Design Facebook Status Search
3. Design Live Commenting
4. Design Facebook Messenger or WhatsApp
5. Design Instagram

As we all know that poker cards have four suites: Spades, Hearts, Clubs and Diamonds with figures from 1 to 13.
Now you are given a set of poker cards, you can pick any one card as the first card. And except for the first card, you can only pick the card that has the same suit or figure with the previous one.
Return the max number of cards you can.
For example: [(H, 3), (H, 4), (S, 4), (D, 5), (D, 1)], it returns 3 as follows: (H,3)-->(H,4)-->(S,4)

Hey anyone got the 90 minutes online assessment test from Amazon for MBA interns? I would like to know what type of questions they ask in the assessment. I need an example if any one of you attended it.

Find the first non-repeated character in a string of characters. For example, 'c' for "abcbae".

Your input is a double array, and you can use *, +, -, and () parenthesis anywhere to create and output the maximum possible value.

Ex:
input is {3,4,5,1} --> output: 72
input is {1,1,1,5} --> output: 15

Follow up, if there are numbers <0


Already posted question ( 3yrs back)
my doubt is can we solve this using multiplication only ( special case 0 and 1 we need to use addition for these alone

ie. if ar[i]==1
max(result*ar[i-1]+1,result*ar[i+1]+1)
)

Adding an integer to a container or removing an integer from it. Providing an algorithm/method to find the largest integer in the container. (thinking of a larger set of data) (I believe that this question misses a conduction to have a reasonable solution)

Now given any number of balls, you have to tell how many times you have to weigh at minimum to find which ball is the heavier one?

What are the steps of the algorithm with order O(m log (mn)) for finding k-th smallest element (or median) of 2D array [1..M] [1..N] where each row of this matrix is sorted and independent from all other rows (ascending order, distinct elements)?

there are 3 tables :
Movie = {movie_id, .....}
Actor = {actor_id, gender, .....}
Movie_Actor = {movie_id, actor_id,....}
Find the pair of movie actor ( male) and actress ( female) who appeared in most movies together.

Tablea Order = {order_id, order_timestamp, total_sale_amount, ....}
Note => Trimmed Mean = remove top and bottom 5 percentile data to remove outliers. Take the average of middle 90% of the data.
you can use function percentile(Col_name, 0.95)
output should look like => {Date, raw_average, trimmed_average}

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

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