Forum Posts
- 1 Answer Will we get time for preparing after applying to Google?
I'm going to apply for an internship in Google. I'm afraid I'll get contacted the very next day and my interview gets scheduled within a week.
- peanuts December 08, 2013
I need a little more time for preparation (approx. 1 month).
Can I tell them to schedule my interview in one month?
Or shall I wait one month and then apply?
I'm just afraid it will get too late because I've heard they sometimes contact their applicants even after 1 month,| Flag | PURGE - 3 Answers Question need help asap
I saw this one and i really not sure. I have an idea that takes O(n^2) but I dont like it, please suggest better:
- Dany December 05, 2013
using a log generated by a multiprocessor machine, which contains start and end time of each process, find the longest slot of time in which the machine wasn't idle.
the log is sorted by the process's start time| Flag | PURGE - 0 Answers C program
Write a complete C program that will allow you to enter and maintain a computerized version of your
- shihan.viswa December 04, 2013
family tree. Begin by specifying the number of generations (i.e. the number of lever within the tree.)
Then enter the names and nationalities in a hierarchical fashion, beginning with our own name and
nationality. Include capabilities for modifying the tree and for adding new names (new nodes) to the
tree. Also, include a provision for displaying the entire tree automatically after each update.| Flag | PURGE - 3 Answers How to delete an account?
I've emailed careercup support 5+ times already (no response) about having this account deleted. Does anyone work actively on this site at all?
- S O U N D W A V E November 27, 2013
I occasionally get emails for recent comments to questions even though I'm not subscribed to this.
The unsubscribe link in this email leads to nothing useful (as I'm not subscribed to this service to begin with).
How do I contact the people who run careercup? How to stop the sporadic spam emails?
I just got this email (which is considered spam now) :
undefined has commented on a question.
You are given an array in which you’ve to find a subarray such that the sum of elements in it is equal to zero.
He algo is nice.
However, In java it is not easy using the hashMap to get the key of values if we use hashmap(index,value). And if we want to use hashtable(value,index), the array cannot have dup as it will have the same key and cover the previous value. We can use a biMap to handle it.
if we don't want to use biMap here is my solution using two hashMap.
static void sumEqZero()
{snip}
View » | To unsubscribe, login and click here.| Flag | PURGE - 5 Answers search an element in an array where adjacent numbers differ by +1 or -1
Give an array { 5, 6 , 7, 6, 5,4,5,4,3,2,1} where each adjacent element is differ by +1 or -1, Now give an number(say 6) and nth occurrence, we need to return the index of the element?
- babusek November 26, 2013| Flag | PURGE - 1 Answer Google Question
Most people have adopted the decimal number system which has ten symbols (0,1,2,3,4,5,6,7,8,9). There are other number systems like binary, hex and octal. Your job is to convert a hex number into a musical number. What is a musical number you might ask? It’s something we invented. Keep reading.
- sandeep17199117 November 26, 2013
The Hex alphabet contains 16 symbols: 0,1,2,3,4,5,6,7,8,9,a,b,c,d,e,f
The Musical alphabet contains 12 symbols: A,A#,B,C,C#,D,D#,E,F,F#,G,G# (# is pronounced 'sharp' so 'A#' is pronounced 'A-sharp', 'C#' is 'C-sharp' and so on)
Your program should validate input (make sure input is a hex number i.e. it is in base-16) and convert it to a number represented by the musical alphabet (base-12). Your program should output the musical number OR an error string "Input is not valid Hex" if the input is not valid hex| Flag | PURGE - 1 Answer Applying to multiple branches of same company
How does Google view it if we apply to its different branches separately? Are they all considered separately(separate set of interviews)? If I get into one branch am I barred from going to another branch?
- peanuts November 25, 2013| Flag | PURGE - 1 Answer How to test Amazon.com website?
Can someone help me with some out-of-box thinking to answer this question? How should I approach such an interview question? What followup questions should I ask to clarify?
- amazontester00 November 16, 2013
Any suggestion will be greatly appreciated...| Flag | PURGE - 2 Answers json groovy
def slurper = new JsonSlurper()
- mr.prashanthsharma November 12, 2013
def result = slurper.parseText('{"person":{"name":"Guillaume","age":33,"pets":["dog","cat"]}}')
the above is my code to extract value "Guillaume" from the above json object but I am stuck in next step| Flag | PURGE - 1 Answer Best optimization for reading stdin
Folks ,
- freak88delhi November 10, 2013
I have to optimize a code for below scenario. Please help
I am reading stdin (a file redirected to stdin) character by character. How many chars are going to come is not known. After every few chars there is a seaparator. e.g $ as below
rhhrkkj$hghjhdf$ddfkrjt
While reading, if the separator arrives I'm processing the string stored before that separator and then continue reading stdin in same fashion, till EOF. I am using getc(stdin) to read chars.
Using gprof I can see most of the program time is spent inside main() , for this reading logic. Rest of the program is just some insert and search operations. I am getting time of 0.01 secs at the moment, want to reduce further.| Flag | PURGE - 7 Answers Space complexity for Recursive Binary Search
Space complexity for Iterative Binary Search would obviously be O(1) but with the recursive algorithm I believe the stack would use O(log n) space. However, everywhere I read I see the worst case complexity for BS O(1). Could someone please help me understand.
- teli.vaibhav November 07, 2013| Flag | PURGE