CareerCup

Output the second index corresponding to the first one, requiring output only if there is only one match, and false if there is more than one pair
a b c d e f g a b -> [0,1]

a b b c, a b c -> False

Check if characters of a given string can be swaped to form target string

ab : ba true
ac : ab false

1
   \
2 - 3
 \ /
  4
  |
  5 - 8
  |  /
   7
For the undirected graph, the LCS is 2,3,4,5, so how can we find it?
 For a undirected graph, find the Longest Consecutive Sequence

/**
* Definition for undirected graph.
* class UndirectedGraphNode {
* int label;
* List<UndirectedGraphNode> neighbors;
* UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
* };
*/
public class Solution {
public List<Integer> longestGraph(List<UndirectedGraphNode> nodes) {

}
}

check if there are two subarrays in an array are identical

comparison of two strings if they are the same, use o(1) space
abc \ b is equal to ab
abc \ ca equals abcA

\ b = backspace
\ c = CapsLock

convert Prefix to Postfix using recursion
+ * A B / C D -> A B * C D / +

Design a dictionary with historical records
t0: hdict = HistoricalDict ()
t2: hdict.set ('foo', 1)
t4: hdict.set ('foo', 2)
t5: hdict.get ('foo', t5) -> 2
t6: hdict.get ('foo', t3) -> 1
t7: hdict.get ('foo', t0) -> None

CSS colors can be defined in the hexadecimal notation "#rgb", a shorthand for "#rrggbb". For example, "#03f" is equivalent to "#0033ff". Suppose the similarity between two colors "#abcdef" and "#ghijkl" is defined as (-(ab-gh)^2 - (cd-ij)^2 - (ef-kl)^2), write a function that accepts a color in the "#abcdef" format and returns a "#rgb" color that is most similar to the input. For example, given "#09f166", "#1e6" should be returned.

Given a binary tree, output the maximum EVEN sum along any path
      10
     /    \
    2      5
   /  \      \
  1   101    13
Maximum even sum = 101 +2 +10 + 5 = 118

Given two input arrays, return true if the words array is sorted according to the ordering array
Input:
words = ['cc', 'cb', 'bb', 'ac']
ordering = ['c', 'b', 'a']
Output: True

Input:
words = ['cc', 'cb', 'bb', 'ac']
ordering = ['b', 'c', 'a']
Output: False

Give the following input, output if the array is sorted according to the ordering array given. Return true or false.
Input:
words = ['cc', 'cb', 'bb', 'ac']
ordering = ['c', 'b', 'a']
Output: True

Input:
words = ['cc', 'cb', 'bb', 'ac']
[bb cb cc ac]
ordering = ['b', 'c', 'a']
Output: False

Define a class 'Space' which has a member string variable that indicates if the space is a "tree", a "house" or an empty space and another member variable that will store the 'space neighbors' (left, right, up and down only)

Given a 'Grid' (list) of Spaces write the code for the findAll(start) method to find all the trees and houses given a 'Space' as start point

Example, Grid of 'Spaces':

T 0 0 H 0
0 0 0 0 0
H H T H 0

Where Ts are trees and Hs are houses

Given a singly linked list, Your task is to remove every Kth node. The task is to complete a method deleteK that takes two argument, head of linked list and an integer k.The method returns the head of the new linked list. There are multiple test cases. For each test case, this method will be called individually.

Given a binary tree (not only BST) return the length of the longest consecutive sequence. The sequence can be between ANY TWO nodes and not only from root to leaves.

For example:

-
      2
     /  \
   1    3
   /   /  \
  0  4   7
 /
10

Should return 5: 0->1->2->3->4

A and B are playing a perfect 8-9 game. The rules are pretty simple. At each point, you can either insert an 8 at the end of the previous number or a 9. one 8 and one 9 forms a pair. a 9 can only be inserted if there is an 8 which does not form a pair. Perfect solution is the one which has all its numbers in pair. Find out all the possible perfect outcomes of the game in lexicographic order.

Input-
Input 1: Max length of number

Output-
Your array must return an array of string s containing all possible outcomes.

Example 1:
Input: 4
Output: {"8899", "8989"}

Explanation: There can be only 2 possible outcomes out of 4 as nine must follow eight.

Example 2:
Input: 6
Output:{"888999","889899","889989","898899","898989"}

Explanation: The possible outcomes are 5.

Given a 3x3 tic-tac-toe board with players 1 and 2. Find all the possible ways player 1 can lose given a particular configuration of the board.

For example (0 denotes empty spot):
input:
0, 1, 0
2, 2, 1
1, 1, 2

Output: 1 (because the only move for player 2 to win would be to play board[0,0])

The input board can have any configuration (player 1 and 2 can be in all possible spots with any number).

convert a Sorted linkedList to complete BST

I am surprised by this GS question.I thought this is one of the classic number theory partition problem which is so hard that the best algorithm is approximation one.

Given value, find all possible combination of ways which equals to that sum.

Give N socks, there is no guarantee that each can be paired, socks two colors, black and white, you need to pair them

css color format # abcdef, another abbreviated color format # rgb
(Converted to the previous format, ie, #rrggbb.) Now give your #abcdef, the first color format, to find the two least different colors, #rgb.

/*Coding question: The customers for a particular business, required to use a webpage to select a Browse Node.
A Browse Node, is an element in the classification structure used to classify products in the Amazon webpage.
The products are classified in 8 categories. Each category has its own sub-classification that looks like a tree with many
children per node and many levels. The UI developer has a tool to paint such tree. He requires from you (You are the backend developer)
to implement 2 interfaces for him:

Node getRoot();
List<Node> getChildren(Node node);
The data is available for you in a text file with this format:
//nodeid, parent_node_id, nodename

Example:
//nodeid, parent_node_id, nodename
10, 1, Comedy Books
20, 2, Tablets
1, -1, Books
11, 1, Novels
12, 11, Terror novels
2, -1, Electronics
-1, 0, GlobalRoot
*/

Given the below input and output and asked to write in Java.
Example 1)
input : {1,2,3,4, &, 12,13,14,15}
output : {15,14,13,12,1,2,3,4}

Example 2 )
input : {33,34,&,55,63}
output : {63,55,33,34}

Assumption : '&' will always be in the middle.

Google Fucked up question.

Given a random list of appointments (Start Date , End Date). Find all the appointments that are colliding.

This pretty easy looking question screwed me up today.There are tons of edge cases, I couldn't complete em all and 45 minutes pass like 15 minutes while explaining and coding same time.

Given list of edge in the graph, find the number of reversed pairs,(1,2)
and (2,1) are such pair. Follow up: How to implement the distributed version.

You have two arrays of strings, words and parts. Return an array that contains the strings from words, modified so that any occurrences of the substrings from parts are surrounded by square brackets [], following these guidelines:

If several parts substrings occur in one string in words, choose the longest one. If there is still more than one such part, then choose the one that appears first in the string.

Example

For words = ["Apple", "Melon", "Orange", "Watermelon"] and parts = ["a", "mel", "lon", "el", "An"], the output should be
findSubstrings(words, parts) = ["Apple", "Me[lon]", "Or[a]nge", "Water[mel]on"].

While "Watermelon" contains three substrings from the parts array, "a", "mel", and "lon", "mel" is the longest substring that appears first in the string.

100% Get The Lucky Winning Numbers By Powerful And Trusted Lottery Spell Caster +27789456728 In The World and Usa,Uk,Canada.

Winning isn't just luck it is about your positive energy and how you can utilize positive energy from the universe to change your bad luck to good luck and earning heaps of money.
There are couple of lucky individuals who have won lotteries, yet again they are likewise conventional individuals like us, the main thing is that you have the positive energy that profits stars exceptionally strong and powerful and when this happens, you ingest energy from the universe which again makes your sub cognizant personality powerful so your mind reveals to you which lottery you need to take and furthermore from where you need to take and after that when the outcomes are out their life changes.
Life isn't simple and to survive you have to earn money, and furthermore having luck on your side can help you in carrying on with a happy and successful life, and spell cast of lottery spell isn't bad, you are just taking help of the universe and its powers to achieve your objectives, as the spell will help you expanding your positive energy that will ingest powers of the universe to help you.
http://www.profmamahanisha.com/ email.www.info@profmamahanisha.com call +27789456728/ WHATSSAP

WORLD APPROVED POWERFUL LOST LOVE SPELLS THAT WORK FAST+27789456728 IN UK ,USA ,CANADA ,AUSTRALIA ,JAMAICA.

WORLD POWERFUL LOST LOVE SPELLS IN OMAN , PALAU ,PALESTINIAN , TERRITORIES , PANAMA , PAPUA , NEW , GUINEA , PARAGUAY , PERU , PHILIPPINES , POLAND NAMIBIA
LOST LOVE SPELLS
lost love spells, love spells witchcraft spells, voodoo, dark enchantment, spell throwing and spell caster counsel.I have helped many individuals with their genuine issues and I will help you. My exceptional learning and my adoration spells and lost love spells are more intense than some other. Give me a chance to direct you.This is my first site. This year I have resigned from my voyages and I am concentrating on my coven and on spreading the work in a moderate way for you through this website
.website:http://www.profmamahanisha.com/ email.www.info@profmamahanisha.com call +27789456728/ WHATSSAP

POWERFUL MAGIC RINGS THAT ARE EFFECTIVELY Magic rings are made on the basis and effects of luck and stars. luck and stars have a very strong influence on us and our daily activities and occurrences. Our stars are directly responsible for good luck and bad luck respectively.There are many choices of magical rings available for your purposes. The Protection Magic Ring will protect you from enemies and danger, if protection is what you are seeking. If you are looking for success in life, then the Egyptian Pentagram Magical Ring will serve your needs. We want to wish you good luck and success in finding the right magical ring needed for your specific purpose or situation. Choose from our list of mystic rings below or contact Me if this list does not include the ring you may need. We will prepare it just for you.
http://www.profmamahanisha.com/ email.www.info@profmamahanisha.com call +27789456728/ WHATSSAP

Remove '_' and print with 1 space separated string from "Amazon_w_e_b_services are___widely__used_acc__ro___ss_the_worl_d", output should be : Amazon web services are widely used accross the world.