CareerCup

Given k, and a binary string, determine if this contains all permutations of length k.
For example, 11001 contains all possible binary sequences with k=2 (00,01,10,11)

Write a C program to print 'n' prime numbers in reverse order?

Write a program to print Fibonacci sequence in reverse order?

Genuine ssd solution Powder chemical for cleaning black notes EMAIL: infoephedrine@gmail.com Watapps: +27815723063 ssd,black dollar,black dollar cleaning,ssd chemical,ssd solution,activation powder, vectrol paste,anti breeze,tebi-manetic solution,super automatic solution, black currency cleaning chemical,black currency notes,black money,chemical industry, ssd solution formula,black currency cleaning,ssd automatic solution,cleaning agents, ssd solution chemical formula,anti breeze,how to make black money,anti breeze chemical, anti breeze notes,anti breeze currency cleaning chemical, currency cleaning chemical, ssd solution cleaning black notes,cleaning chemical We Clean Black Dollar on % basis we? using SSD Solutions Chemicals?? Avanced Notes Cleaning Chemicals? We send Technician to your Country?? http://germanembalmingpowder.co.za/

+27815723063 Liquid Silver Mercury
South Africa
Min Order Quantity: 50 Kilogram
Delivery Time: 5 Days
Supplying Ability: 1000 Kilogram / Day
Payment Type: L/C,T/TProduct SpecificationsBrand Name :
EAS
Product Description
Liquid Silver Mercury
Specifications

We are most renowned and efficient supplier of Liquid Silver Mercury in well protected steel Flasks.
We supply Liquid silver mercury in very large quantities and also ensure safe and prompt delivery of goods to your destination.
- virgin mercury purity = 99.99% by wt min.
- free from heavy metals
- packing iron cylinder ( 34.5)kg net weight or 1kg flask
- physical state: liquid

EPHEDRINE PURE CRYSTAL POWDER FOR SALE IN SOUTH AFRICA, JOHANNESBURG +27815723063
Ephedrine Bp powder. Ephedrine for sale, Ephedrine HCL vs. Ephedrine Alkaloids: +27 815723063 (South Africa) We are one of the world most reputable and trusted retailers of pseudo-ephedrine and pseudo-ephedrine HCL freebase. We built our superb reputation by offering our customers with excellent quality/ purity products pseudo-ephedrine and pseudo ephedrine HCL freebase, pleasant & professional shopping experience with 100% FREE discreet delivery and friendly customer support. When you buy pseudo-ephedrine and pseudo-ephedrine HCL freebase from us you are guaranteed of the highest quality available on the market with excellent purity, secure payment, very discreet, fast and discreet international delivery. Email: infoephedrine@gmail.com Mobile: +27 815723063 Name of seller: Dr Sabra.

Do you have black currency in form of Dollars, Pounds or Euros or any other currency? +27815723063 I have the most powerful and Universal cleaning chemical you are looking for. I sell SSD automatic solution, Vetrol paste 0.2A and so many others. I also have a variety of Powders needed when doing the large cleanings such as Activation powder. We specialize in cleaning all types of defaced notes, black notes, anti-breeze bank notes, stamp coated and stained currency. We melt and re-activate frozen chemicals and offer 100% cleaning for bills like dollar, euro, pounds,RANDS and transferring of colors from used note to new white bills.
We offer machines for large cleaning and also deliver products to any location desired by buyers. Laboratory staff are available to demonstrate to clients how the work is done.
Are you looking for:- call +27815723063 http://germanembalmingpowder.co.za/
SSD Chemical Solution Chemical Solution for Cleaning Black Money
SSD Chemical Company SSD Chemical Solution for Cleaning Black Money
SSD Preserving Company SSD Chemical Solution for Cleaning Black Money
Activation Powder S.S.D. Chemical Solution for Cleaning Black
notes

Get married to the love of your life.
Do you want to bind your family/relationship forever?
Are you in love with someone but can not get them? Do you still love your ex? My powerful love spells are the solution to your problem, they work immediately and real fast. If you have been looking for your soul mate for several years, if you only have short-lived dates, if your partners leave you without reason, do not remain in this situation. you are most certainly the victim of a block, and that's why things never go well for you. You only experience failure and that prevents you from building your love life. An occult work is necessary, it will be individualized according to your specific situation. contact Mama Anina immediately on +27603051423
Love is something so special, a feeling that gives us great joy, fulfillment and happiness. It is something that we want to last forever, keeping us in a blissful state. However sometimes it goes horribly wrong causing us great pain. Those are times when we feel the whole weight of the world on our shoulders, your life falling apart. contact Mama Anina on +27603051423 or email infotraditionalhealer@gmail.com and my powerful love spells will end your heartbreak and suffering, all the help you need with love and relationships is here. with my powerful magic love spells, i can bring back your lost lover or ex in just 24 hours, email or call me for help http://bringbacklostlove.co.za/

Do you want to boost your business?
Do you want a magic ring or magic wallet?
Do you have love problems / issues that you need sorted out? I have a variety of love spells that will change your life forever. Have you lost a loved one? Are you in love with someone who doesn't seem to care about you? Is your loved one in love with someone else? Call me NOW and I will summon all my powers to make your dreams come true. http://www.bringbacklostlove.co.za/
I use strong holy black magic spells and various mixtures of herbal remedies with the powerful ancestral spirits to heal and solve most of problems and terrible sicknesses. i have healed many people all over the world and according to testimonies show that i am mainly the world's best award winning healer. http://www.bringbacklostlove.co.za/
Do you suffer for long time with illnesses, Stress, Poverty, Financial difficulties, Bad debts, Court cases, Body & skin sicknesses, Evil witchcraft, Bad dreams, Lost lover& family, broken relationships, excessive drinking and smoking problems, unemployment’s, Failing deals, Lost businesses, bedroom weakness, jealousy people, un promoted at job, need a child? Lose weight, Sugar diabetes, Blood pressure, Overweight, Robberies, Broken relationship and so much more.... Remember; I welcome any challenges and questions about any human life.
call Mama Anina on +27603051423

How to bring my lost love back+27603051423 Bring back by love spells
Many people still question whether love spells work or not, permanent or effective? This can be based from past experiences where they tried some spell casters but not fully satisfied with their results or the love spells worked for just a short period and sometimes even never saw any results. To avoid such situations you have to be careful with spell casters you approach, some are limited with certain Spiritual powers to cast good love spells to help people in their relationships or marriages. Many good love spell casters are out there in the world (Africa, Asia and so on) Yes, love spells really work, whether you are in a situation where you want to bring back your lost lover (lost lover spell),you want to get married to someone in a relationship(marriage spells),to increase love in your relationship(love affection spells) and many other related love spells, you will get help. It does not matter where you are or where your partner is, you don't have to be unhappy of a situation you can solve, it is all about finding a good love spell to change your love life. Mama Anina is a celebrated love spell caster whose works have won her friendship all over the world from the people she met. To know more about spells and her wonderful works call for a free reading world wide! .N.B if u are in south Africa, she has private houses all over Gauteng for your privacy
Email; infotraditionalhealer@gmail.com
Website; http://bringbacklostlove.co.za/
Contact; call/watsapp +27603051423

Design the Goodreads recommendation model.

Goodreads is a "social networking book" website that allows individuals to freely search its database of books.

- Any given user has a List of friends.
- User can add books to his/her shelve
- When a user logs in, we need to show the top 10 books owned by his friends

Example:
User1 has u2, u3, u4, u5 as friends

u2 owns b1, b2, …b10
u3 own b1, b2, b11…b20
u4 owns b1, b2, b11…b20
u5 owns b1, b33, b35, etc

topmost book is b1, second topmost book is b2 and so on.

If you maintain a cache of top 10 books in the user object for each of the users. How often will you update the cache ?

There are hierarchy of class like super class and sub class. Yo have to make sure only one object can be create for any class using new keyword. How you implement the class.

Airbnb: Design webbrowser back button

Your web browser supports will support three actions: back, forward and open. The init webpage is “about:blank”.
Given a sequence of commands. Return the result page.

You have been given a generator string ab from which any number of strings can be generated recursively by inserting ‘ab’ at any location. You have been given an input string to check if that given string is valid or not.(i.e. generated by given with given string.)

eg.
Input: aabbab
Output: valid
Input: abbaab
Output: Invalid

I could not come up with a algorithm less than O(N*N)

find the sum of bit wise OR of minimum and Maximum element of all the subsets whose length is greater than 2 of the given of set.

for ex:-

{1,2,3} is set
then possible subsets of length is{ 1,2},{1,3},{2,3}{1,2,3} answer 1|2 +1|3 +2|3 +1|3=12

Given a singly linked list, write code to find the most frequent element value in the list and its occurrence.

In case of duplicate number of occurrences, return the element value closest to the head.

A solution of time complexity O(N) average is preferred.



Sample Input: 1 2 3 4 2 3 2

Sample Output: Element 2 occurs 3 time(s)



Sample Input: 4 3 5 3 4 5

Sample Output: Element 4 occurs 2 time(s)

The wildcard regex can include the characters * and + .

‘+’ – matches any single character or empty character!

‘*’ – Matches any sequence of characters (including the empty sequence) For example,

Text = "baaabab":

regex = "ba*a++", output : true

regex = "ba*a+", output : true

regex = "a*ab", output : false

//empty string

Text=""

Regex= "+" , output : true

Calculate smallest number of letters removed to make remaining word lexicographical?


I am looking for a solution to the following problem from a coding test.

> write a program in Java to Calculate the smallest number of letters that must be removed in order for the letters of the remaining word to be sorted in lexicographical order (abcde…wxyz).
>

e.g. For example given “banana” the function should return 3 because we can remove three letters (the first 3rd and 6th) to get the word “aan” which is sorted. Please note that it is not possible to be remove fewer than three letters

But I'm supposed to find the answer in o(n). Also my answer is failing for the input string "iardiaaznaai"


public int getSmallestNoletters(String[] args) {
String longestSubString = "s";
for (int i = 0; i < str.length(); i++) {
StringBuilder sbuStr = new StringBuilder();
sbuStr.append(str.charAt(i));
for (int j = i + 1; j < str.length(); j++) {
System.out.println("1: " + sbuStr);
if (sbuStr.charAt(sbuStr.length() - 1) <= str.charAt(j)) {
sbuStr.append(str.charAt(j));
System.out.println(sbuStr);
} else if (sbuStr.length() > 1 && sbuStr.charAt(sbuStr.length() - 2) <= str.charAt(j)) {
sbuStr.deleteCharAt(sbuStr.length() - 1);
sbuStr.append(str.charAt(j));
}
}
if (sbuStr.length() > longestSubString.length())
longestSubString = sbuStr.toString();
}
int ans = str.length() - longestSubString.length();
System.out.println("Ans: " + ans);
return ans;
}

Given a multiple tree, and multiple nodes that need to be deleted,
It is required to return a list of nodes so that the children of these nodes can be found after the nodes have been deleted.

Gives you an int m, and a set of char (0,1,2,3,4,5,6,7,8,9)
Lets you implement a function that generates a id based on the characters in the set. Each time you return a string, it must be unique. satisfying the same character can not appear consecutively more than m times, such as m = 3, "1000" is valid,
"0000" is not valid.
The smaller the string, the better.

Let’s say you have two input arrays with sorted elements. Find the union.

a[] = {2, 10, 14, 19, 51, 71}
b[] = {2, 9, 19, 40, 51}

Union = {2, 9, 10, 14, 19, 40, 51}

why we have a such long number value for object's hashcode in java.can we not have any small numbers or why java is giving that much large number for any object hash code ?

A group of friends are tracking the miles per gallon for each of their cars. Each time one of them fills up their gas tank, they record the following in a file: His or her name The type of car they drove How many miles driven since they last filled up How many gallons purchased at this fill up Date of the fill Their data is formatted as a comma separate value (csv) file with the following format for each row:(#person,carName,milesDriven,gallonsFilled,fillupDate) Miles are recorded as floating-point numbers and gallons as integers. Please create a program that allows members of this group to determine the miles per gallon (MPG) of each of their cars during a specific time range. Note: person may have more than one so a time range query might need to output data for one or more cars. A skeleton class will be provided; your job will be to complete the program. The principal function for querying MPG is of the form (the exact name, data types, etc., can be learned by inspecting the "solution" class in the skeleton code): GetRangeMPG(PersonName, StartDate, EndDate) Returns list of objects containing (CarName, MPG) MPG is calculated as (total miles traveled during time period)/ (total gallons filled during time period. The dates you receive in the query should be treated inclusively.

To push dominoes, find out how many dominoes are standing in the end

For example, the input is ".R...RL..R..L..", which means pushing the 2nd, 6th, and 12th dominoes to the right and pushing the 8th and 15th dominoes to the left. This example returns 4th. 1,7,16,17 blocks are standing

The question is that there are a lot of vm, what is the total vm consumption max. For example, (2,4,8), (3,5,3) this input,
This means that 2 to 4 seconds have a memory usage of 8 and 3 to 5 seconds of 3, so the answer is 11 at 3 seconds.
Return 11 to it. Note that (1,2,3) and (2,3,4) such that the middle 3+4=7 is good.
Follow up is usage is not constant, such as (1,2,1,2) the first second usage is 1,
The second second is 2, the linear increase, the highest is how much.

List<Integer> list=Arrays.asList(1,2,3,4,5,6);
Iterator it=list.iterator();
while(it.hasNext()){
System.out.println(it.next());
}
The above code will iterate sequentially through 1 to 6. Can we iterate the same list alternatively so that it will print 1,3,5 without changing the while loop.

Search for a sorted integer in an integer array that has been rotated multiple times.

Print the bottom view of a Binary Tree.
ex-

1        

        2       3

    4       5       7

        8       9       10

result is 4, 8, 5, 9, 7, 10

Given an alphabet where we do not know the order of the letters also do not know the number of letters.

We are give an input list of tuples where each entry in the list gives an ordering between the 2 letters

Determine the alphabet order.

Ex-
<A, B>
<C, D>
<C, E>
<D, E>
<A, C>
<B, C>
Order is A, B, C, D, E

I was asked this question in a recent interview for a startup.

We have coffee vending machine with 3 buttons which can dispense 4oz, 7oz and 13oz of coffee.

Given a cup and the min and max amount(oz) of coffee it should fill. determine if the coffee vending machine can satisfy the condition.

The buttons can be pressed as many times as possible to fill the cup. Coffee shouldn't overflow..