CareerCup http://www.careercup.com/ CareerCup : Technical Interview Questions en-us CareerCup: New Interview Question for Google | Algorithm(1st telephone interview) | Software Engineer / Developer http://www.careercup.com/question?id=3744704
Interview Question for Google » Algorithm(1st telephone interview) » Software Engineer / Developer

Create methods for Set implementation. (Getting unique values from user to create a Set, and methods to implement Intersection, Union... of 2 sets

View »
Posted by neo on September 01, 2010
]]>
http://www.careercup.com/question?id=3744704 neo 2010-09-01T13:32+00:00
CareerCup: New Interview Question for Amazon | Algorithm | Intern http://www.careercup.com/question?id=3749707
Interview Question for Amazon » Algorithm » Intern

You are given the amazon.com database which consists of names of millions of products. When a user enters a search query for particular object with the keyword say "foo" , output all the products which have names having 50% or more similarity with the given keyword ie "foo"

Write the most efficient algorithm for the same.

View »
Posted by iaintgeek on September 01, 2010
]]>
http://www.careercup.com/question?id=3749707 iaintgeek 2010-09-01T11:06+00:00
CareerCup: New Interview Question for Microsoft | Algorithm | Software Engineer / Developer http://www.careercup.com/question?id=3747687
Interview Question for Microsoft » Algorithm » Software Engineer / Developer

Print all edge nodes of a complete binary tree anti-clockwise.
That is all the left most nodes starting at root, then the leaves left to right and finally all the rightmost nodes.
In other words, print the boundary of the tree.

Variant: Print the same for a tree that is not complete.

(I traversed the tree twice, but interviewer said there is a recursive way to solve this)

View »
Posted by Mahesh on September 01, 2010
]]>
http://www.careercup.com/question?id=3747687 Mahesh 2010-09-01T05:19+00:00
CareerCup: New Interview Question for NetApp | Algorithm | Software Engineer / Developer http://www.careercup.com/question?id=3686937
Interview Question for NetApp » Algorithm » Software Engineer / Developer

An array is given where each rows are sorted in ascending order and each columns are sorted in ascending order. Like {{1,2,4,6}, {3,5,7,8}}. Now one number "k" is given which can be inside the matrix. Or may not be too.
Need to find out what is the position (i,j) for k, if this is inside the matrix.

View »
Posted by Anonymous on August 31, 2010
]]>
http://www.careercup.com/question?id=3686937 Anonymous 2010-08-31T14:56+00:00
CareerCup: New Interview Question for Amazon | Algorithm http://www.careercup.com/question?id=3653970
Interview Question for Amazon » Algorithm

Write a program to arrange numbers from 1 to 16 such that the sum of two consecutive numbers is a perfect square

View »
Posted by Amazon on August 31, 2010
]]>
http://www.careercup.com/question?id=3653970 Amazon 2010-08-31T04:47+00:00
CareerCup: New Interview Question for Amazon | Algorithm | Software Engineer in Test http://www.careercup.com/question?id=3678917
Interview Question for Amazon » Algorithm » Software Engineer in Test

Implement a function
public long[] GetMultiples(int num)
eg if num is given as 30, output array should contain {1,2,4,8,16}. It shouldn't contain 32 since 32 is more than the given number.

Another exp: if num is 300 then output will be {1,2,4,8,16,32,64,128,256}

View »
Posted by Job Seeker on August 31, 2010
]]>
http://www.careercup.com/question?id=3678917 Job Seeker 2010-08-31T00:27+00:00
CareerCup: New Interview Question for Amazon | Algorithm | Software Engineer in Test http://www.careercup.com/question?id=3713944
Interview Question for Amazon » Algorithm » Software Engineer in Test

How do you output the nodes from a binary search tree given a range

View »
Posted by manishgp11 on August 31, 2010
]]>
http://www.careercup.com/question?id=3713944 manishgp11 2010-08-31T00:21+00:00
CareerCup: New Interview Question for Real Networks | Operating System | Software Engineer / Developer http://www.careercup.com/question?id=3700907
Interview Question for Real Networks » Operating System » Software Engineer / Developer

Phone screen: Asked a few Windows platform questions like how to create and manage a thread.

View »
Posted by dimarzio on August 30, 2010
]]>
http://www.careercup.com/question?id=3700907 dimarzio 2010-08-30T20:48+00:00
CareerCup: New Interview Question for Real Networks | Algorithm | Software Engineer / Developer http://www.careercup.com/question?id=3643879
Interview Question for Real Networks » Algorithm » Software Engineer / Developer

Given a char array with words in it, find all 'a' characters and replace with xyz. Modify the input array, do not create a copy of the array.

View »
Posted by dimarzio on August 30, 2010
]]>
http://www.careercup.com/question?id=3643879 dimarzio 2010-08-30T20:48+00:00
CareerCup: New Interview Question for Real Networks | Algorithm | Software Engineer / Developer http://www.careercup.com/question?id=3652869
Interview Question for Real Networks » Algorithm » Software Engineer / Developer

Given an array of n with each element being in the range of 1-50, print out how many time each number from 1-50 occurs.

View »
Posted by dimarzio on August 30, 2010
]]>
http://www.careercup.com/question?id=3652869 dimarzio 2010-08-30T20:48+00:00
CareerCup: New Interview Question for Real Networks | Data Structures | Software Engineer / Developer http://www.careercup.com/question?id=3650901
Interview Question for Real Networks » Data Structures » Software Engineer / Developer

Do in order traversal of tree.

View »
Posted by dimarzio on August 30, 2010
]]>
http://www.careercup.com/question?id=3650901 dimarzio 2010-08-30T20:48+00:00
CareerCup: New Interview Question for Real Networks | Data Structures | Software Engineer / Developer http://www.careercup.com/question?id=3674907
Interview Question for Real Networks » Data Structures » Software Engineer / Developer

Print a tree level by level.

View »
Posted by dimarzio on August 30, 2010
]]>
http://www.careercup.com/question?id=3674907 dimarzio 2010-08-30T20:48+00:00
CareerCup: New Interview Question for Real Networks | Coding | Software Engineer / Developer http://www.careercup.com/question?id=3681878
Interview Question for Real Networks » Coding » Software Engineer / Developer

Implement atoi in C.

View »
Posted by dimarzio on August 30, 2010
]]>
http://www.careercup.com/question?id=3681878 dimarzio 2010-08-30T20:48+00:00
CareerCup: New Interview Question for Amazon | Algorithm | Software Engineer / Developer http://www.careercup.com/question?id=3643842
Interview Question for Amazon » Algorithm » Software Engineer / Developer

Input Data : {[1,3],[2,4],[10,11],[4,6]}
Output: {[1,6],[10,11]}
We have to merge all the ranges that are overlapping. You can consider Input data as any Data structure.

View »
Posted by kuku on August 30, 2010
]]>
http://www.careercup.com/question?id=3643842 kuku 2010-08-30T05:04+00:00
CareerCup: New Interview Question for LLC | Developer Program Engineer http://www.careercup.com/question?id=3706841
Interview Question for LLC » Developer Program Engineer

A site wants to present lowest airfare for a return journey. Suggest the algorithm to calculate k least sum.
If i say show me 4 options then it should return 4 lowest fares. If 8 then 8 options.

View »
Posted by Amdy on August 30, 2010
]]>
http://www.careercup.com/question?id=3706841 Amdy 2010-08-30T04:29+00:00
CareerCup: New Interview Question for LLC | Algorithm | Developer Program Engineer http://www.careercup.com/question?id=3649851
Interview Question for LLC » Algorithm » Developer Program Engineer

Given a sorted array find two numbers whose sum is equal to the given sum.
E.g 1 2 3 4 5 Sum to find 9 then 4+5 (Just two numbers occurring first and fulfilling the criteria)

View »
Posted by Amdy on August 30, 2010
]]>
http://www.careercup.com/question?id=3649851 Amdy 2010-08-30T04:29+00:00
CareerCup: New Interview Question for self | Java http://www.careercup.com/question?id=3656839
Interview Question for self » Java

what is daemon thread in java

View »
Posted by srinu on August 30, 2010
]]>
http://www.careercup.com/question?id=3656839 srinu 2010-08-30T03:48+00:00
CareerCup: New Interview Question for Amazon | Algorithm | Software Engineer in Test http://www.careercup.com/question?id=3700841
Interview Question for Amazon » Algorithm » Software Engineer in Test

How do we validate that a given doc is a well formed xml? which DS and algorithm? Write the test cases as well

View »
Posted by Amazon on August 29, 2010
]]>
http://www.careercup.com/question?id=3700841 Amazon 2010-08-29T23:19+00:00
CareerCup: New Interview Question for Achieve Internet http://www.careercup.com/question?id=3644819
Interview Question for Achieve Internet

Given a list of strings say N, how would you write a perfect hash function and ensure 0 collissions?

View »
Posted by Anonymous on August 29, 2010
]]>
http://www.careercup.com/question?id=3644819 Anonymous 2010-08-29T18:08+00:00
CareerCup: New Interview Question for Amazon | Linked List | Software Engineer / Developer http://www.careercup.com/question?id=3691807
Interview Question for Amazon » Linked List » Software Engineer / Developer

Linked List with following structure..
{{{
struct node
{
int data;
struct node *next;
struct node *next_larger;
}
}}}
initially next_larger of every node is point to NULL.
now write a c code which set all node's next_larger pointer.
where next_largest point to the next larger then its own value and largest value node's next_larger pointer points to NULL

i.e.
if LL is 3->1->5->6->4
then 3's next_larger points to 4
and 1's next_larger points to 3
and 5's next_larger points to 6
and 6's next_larger points to NULL
and 4's next_larger points to 5

View »
Posted by rohan on August 29, 2010
]]>
http://www.careercup.com/question?id=3691807 rohan 2010-08-29T13:53+00:00
CareerCup: Question of the Day | March 17, 2009 http://www.careercup.com/question?id=2794
Daily Question: Microsoft » Coding » Software Engineer / Developer

write code to implement itoa()

View »
Posted by Chandan on March 17, 2009
]]>
http://www.careercup.com/question?id=2794#march-17-2009 Chandan 2009-03-17T00:00+00:00
CareerCup: Question of the Day | March 15, 2009 http://www.careercup.com/question?id=57210
Daily Question: Adobe » Coding Algorithm » Software Engineer / Developer

Write a function to add two numbers, without using any arithmetic operator. Even the ++ in for statement is not allowed

View »
Posted by Anonymous on March 15, 2009
]]>
http://www.careercup.com/question?id=57210#march-15-2009 Anonymous 2009-03-15T00:00+00:00
CareerCup: Question of the Day | March 14, 2009 http://www.careercup.com/question?id=2742
Daily Question: IBM » Algorithm » Software Engineer / Developer

Write a Java program to check whether any two elements in an array add to a constant C or not. Implement the program with least complexity O(n).

View »
Posted by rajtaresh on March 14, 2009
]]>
http://www.careercup.com/question?id=2742#march-14-2009 rajtaresh 2009-03-14T00:00+00:00
CareerCup: Question of the Day | March 12, 2009 http://www.careercup.com/question?id=2094
Daily Question: Citrix Online » General Questions and Comments » Software Engineer / Developer

When contacted the 2nd recruiter, she told me the position might be filled but I can still interview in a week. A little akward.

View »
Posted by Jack on March 12, 2009
]]>
http://www.careercup.com/question?id=2094#march-12-2009 Jack 2009-03-12T00:00+00:00
CareerCup: Question of the Day | February 17, 2009 http://www.careercup.com/question?id=2448
Daily Question: Microsoft » Algorithm » Software Engineer / Developer

Which (one or more) of the following numbers can't be represented accurately in binary?

0.1, 319, 63.5, 1/16, 1.32, 5.390625

View »
Posted by AlgoFreak on February 17, 2009
]]>
http://www.careercup.com/question?id=2448#february-17-2009 AlgoFreak 2009-02-17T00:00+00:00
CareerCup: Question of the Day | February 16, 2009 http://www.careercup.com/question?id=2448
Daily Question: Microsoft » Algorithm » Software Engineer / Developer

Which (one or more) of the following numbers can't be represented accurately in binary?

0.1, 319, 63.5, 1/16, 1.32, 5.390625

View »
Posted by AlgoFreak on February 16, 2009
]]>
http://www.careercup.com/question?id=2448#february-16-2009 AlgoFreak 2009-02-16T00:00+00:00
CareerCup: Question of the Day | February 11, 2009 http://www.careercup.com/question?id=70745
Daily Question: Microsoft » Software Engineer / Developer

There are two linked lists which converge at one point. Return the 1st node at which they converge

{{{[__]-->[__]-->[__]-->
[__]-->[__]
[__]-->
}}}
Hope my diagram is understandable

View »
Posted by Anonymous on February 11, 2009
]]>
http://www.careercup.com/question?id=70745#february-11-2009 Anonymous 2009-02-11T00:00+00:00
CareerCup: Question of the Day | January 27, 2009 http://www.careercup.com/question?id=2070
Daily Question: MarketRX » Database » Software Engineer / Developer

Interviewer> If we have a table containing Emp_ID,Emp_Name and Dept_ID(Primary key) and another table having Emp_Name and Dept_ID (foreign key), how would u find the number of employees in each dept?

View »
Posted by Karthik Srinivasan on January 27, 2009
]]>
http://www.careercup.com/question?id=2070#january-27-2009 Karthik Srinivasan 2009-01-27T00:00+00:00
CareerCup: Question of the Day | January 16, 2009 http://www.careercup.com/question?id=65909
Daily Question: Amazon » Arrays

Given 1) an int[] array and 2) an int value, how do i find out which two elements in the array add up to the value given? What is the speed of your algorithm? Can it be done faster?

View »
Posted by Zefram Cochrane on January 16, 2009
]]>
http://www.careercup.com/question?id=65909#january-16-2009 Zefram Cochrane 2009-01-16T00:00+00:00
CareerCup: Question of the Day | January 15, 2009 http://www.careercup.com/question?id=67830
Daily Question: Bloomberg LP » C » Financial Software Developer

int x;
function()=x;

Is it legal or illegal code?Why?

View »
Posted by Anonymous on January 15, 2009
]]>
http://www.careercup.com/question?id=67830#january-15-2009 Anonymous 2009-01-15T00:00+00:00
CareerCup: Request for Help for Microsoft | Algorithm | Software Engineer / Developer http://www.careercup.com/question?id=3747687
Request for Help: Microsoft » Algorithm » Software Engineer / Developer

Print all edge nodes of a complete binary tree anti-clockwise.
That is all the left most nodes starting at root, then the leaves left to right and finally all the rightmost nodes.
In other words, print the boundary of the tree.

Variant: Print the same for a tree that is not complete.

(I traversed the tree twice, but interviewer said there is a recursive way to solve this)

View »
Posted by Mahesh on September 01, 2010
]]>
http://www.careercup.com/question?id=3747687#helprequest Mahesh 2010-09-01T05:19+00:00
CareerCup: Request for Help for IBM | Software Engineer / Developer http://www.careercup.com/question?id=3649710
Request for Help: IBM » Software Engineer / Developer

Given a matrix of integers where every row is sorted and every column is sorted. Print all elements in sorted order.

Cannot use merging of arrays. Solution should be better than O(n2logn)

View »
Posted by Anonymous on August 27, 2010
]]>
http://www.careercup.com/question?id=3649710#helprequest Anonymous 2010-08-27T16:47+00:00
CareerCup: Request for Help for http://www.careercup.com/question?id=3675683
Request for Help:

Given is an array of integers. Element is called an extreme if no other element's value is more distant from the average. Write a function

int extreme(int[] A);

that given an array of integers returns the index of an extreme (any one of them if there are many).

If no extreme exists, the function should return -1.

A[0]=9, A[1]=4, A[2]=-3, A[3]=-10

the index of an extreme is 3, because the average of the array is

(9 + 4 + (-3) + (-10)) / 4 = 0

and in this array no value is further from 0 than -10

View »
Posted by anniyan on August 27, 2010
]]>
http://www.careercup.com/question?id=3675683#helprequest anniyan 2010-08-27T03:03+00:00
CareerCup Blog Post: One developer's experience (successfully) interviewing with Google India http://www.careercup.com/blog?id=1903662
One developer's experience (successfully) interviewing with Google India

This is a very nice write-up of a Google interview. For the most part, his analysis of the interview is totally accurate. Read it here.

There are a few things incorrect, though, that I should clear up:


  • "No positions for Java programmers". There are lots of positions for java programmers. But, if you see yourself as that, you may not be a good fit for Google. Google wants scientists, not trade programmers.

  • "Same kind of numbness". I don't think is a "strategy" of the interviewers - more likely it's just their personality. What would expect - jumping for joy if you get a great answer? There's really little excitement with a great candidate because they've asked these questions dozens of times. Nor are they going to show frustration.

That said, there's nothing special or magic about a Google interview. Google asks the same kinds of questions as all the other top firms. Programming interview prep is universal (easier for you!).

View »
Posted by Gayle Laakmann on April 21, 2010
]]>
http://www.careercup.com/blogpost?id=1903662 Gayle Laakmann 2010-04-21T23:18+00:00
CareerCup Blog Post: Picking the Right Companies http://www.careercup.com/blog?id=56396
Picking the Right Companies

I've been working (working: v. to write one or two sentences with the intention of finishing it up later that day, or the next day, or...) for a while on a post about how to pick which companies to apply to. Jon Pincus, my former manager from Microsoft, has done a better job that I would have, so I'll just let him take it from here...

Jon Pincus: "You probably won’t be able to get your dream job in your next job; what you want is something that’s noticeably closer than where you are now, and makes it a lot more likely that the following job has even more of the dream job characteristics."

Or, if you're one of those people who want to go to a big company and are just trying to come up with names, Google Sets can actually be useful here. If you put in Google, Microsoft and Apple, it'll return related terms such as Intel, Sun, Yahoo and Blackberry. It's not a perfect list, but it's a start!

View »
Posted by Gayle Laakmann on June 19, 2008
]]>
http://www.careercup.com/blogpost?id=56396 Gayle Laakmann 2008-06-19T17:30+00:00
CareerCup Blog Post: Preparing Effective Resumes http://www.careercup.com/blog?id=56378
Preparing Effective Resumes

When I was in high school, a teacher returned an essay of mine with the following written on the top of the paper: "Know your audience." The task was to write a persuasive essay on any topic of our choosing. I just so happened to pick a topic on which the teacher had extensive knowledge and strong feelings. I hadn't been thinking about this at the time I chose the topic, but he was right - I should have known this wasn't a good topic. Lesson learned.

Writing a resume is no different. Tailor what you're writing to the specific company and position.

Resume Cosmetics

  • Avoid the Text Blob: Employers don't read your resume - they glance at it for, oh, 10 - 15 seconds. You can't absorb key points from a large blob of text, so bullet your accomplishments instead. Write short, concise sentences. Craft your resume such that a quick glance is enough to say "wow".
  • Use a Template: Do *not* just type everything into Microsoft Word - format your resume nicely by using a template. Microsoft Word has lots of built in resume tables - use one, or make your resume.
  • Pages: if you're a recent college graduate (last few years), your resume should probably be one page. Can't get it all in one page? Trim it down to the most important stuff. This is actually a *good* thing to do, because the best stuff will stand out more.
  • Formatting Tip: Electronic copies: if you create a good format in Micosoft Word, your resume probably uses tables. You may have noticed that table borders show up when you view them in Word but not when you print them out. And guess how many people will view your resume? That's right - on Word. So, you'll want to *really* hide your table borders. Here's how: instead of setting the borders to invisible (invisible on paper, but visible electronic), set them to visible but white. They'll be truly invisible then.
  • Filename: A lot of people send me resumes named liked "Resume.doc", and they get lost. If you don't want your resume to be lost, put your name in the filename (eg, "John Smith Resume - April 2006.doc"). I *highly* recommend that you save it on your computer with such a filename this way you won't forget to send it with the proper name.
Resume Content:

  • Accomplishments, not Responsibilities: Employers want to know not just what you were assigned to do, but what you actually accomplished. For example, saying something like "Reduced time to perform X by 75% by optimizing Y" looks much more impressive than "Responsible for optimizing X." List your accomplishments over your responsibilities, and be specific.
  • Projects: Employers want to see practical experience - that means internships and projects (this is especially true for Software Engineering positions). Yes, have a specific section on your resume for projects - 3 to 4 projects is ideal, whether they're class project or personal projects. If they're personal projects, say so! It shows passion and motivation.
  • Kill the Fluff: I have never once said "oooh... this person claims to have great team working skills. Let's hire them!" Maybe I'm wrong here, but I don't think employers believe fluff stuff just because it's on a resume.
  • For US Positions: Please don't list your age, marital status, gender, etc. I see this a lot with international applicants. In the US, it is illegal to use those as factors in a hiring decision. We don't want those on your resume.
Resume Wording & Proofing
  • Bullets: Bullet each item for a job - you don't need to write complete sentences. Use action words.
  • Spelling & Grammar: Once you've done all this, make sure to check for spelling mistakes, grammatical mistakes and typos. Get as many people as possible to read over your resume and tell them to be picky. This is especially important for non-Native English speakers. Many companies will, unfortunately, toss your resume for a simple spelling mistake.
  • Personal Information: This should be obvious, but double check that your phone number, address and email address are correct. Don't list your cell phone unless you are ok with receiving calls on it.

Resume Customization:
I've said that you need to customize your resume based on the position, so I'll explain a little bit about what I'd do for each company. But first, a short summary of the various things I could include:
  • Microsoft Software Engineering Internships: 2001, 2002, 2003
  • Apple Software Engineering Internship: 2004
  • Google Software Engineering: 2005 - Present
  • TAing in College, including being Head TA
  • Webdesign / webprogramming for a small company in Philadelphia before going to Google
  • Creating a course in college and teaching it
  • Teaching at University of Washington while working at Google
  • Planning a lot of large social events with 200+ people (see http://www.theseattleantifreeze.com)
  • 3 or 4 "meaty" projects in college
  • CareerCup (a website for technical job applications)
Software Engineer (anywhere): I'd want to show off the technical problems I've done, as well as show myself to have good initiative. So, I would emphasize the technical work I've done at Google, Microsoft and Apple (big names = prestige). I'd drop the webdesign work - doesn't add much given the other jobs. I'd talk a bit about CareerCup, since that shows independent work. I wouldn't talk much about teaching or event planning, but I'd given them a brief mention.

Program Manager: I'd want to show off some technical stuff, but I also need to show good planning skills, design work, initiative. Google/Microsoft/Apple would have some stuff, but I wouldn't go into as much technical detail. I'd talk more about CareerCup (initiative, ability to drive a project). Planning large social events would be somewhat important too (shows leadership). Teaching at UW and Penn would be good to talk about as well because it shows communication skills and leadership.

Board Position for Theater: I recently applied for a board position for the young professionals group of a Seattle theater. I talked a bit about Google, Microsoft and Apple, but dropped a lot of the technical details. I talked a bunch about event planning, because they would want me to help plan events. I talked more about the various websites I maintain, because, who knows, maybe they would want me to help out with their website. I talked about creating a course at Penn and UW (initiative, communication skills, etc).

I never once exaggerated what I did - I simply cut details or elaborate depending on how important something is.

Resumes for Software Engineers:
I'll talk specifically about this since I see tons of Software Engineering resumes.

  • A company like Google or Amazon, which does a lot of server / web work, will be most interested in projects you've done relating to the web or to scalable systems. Microsoft, however, might be more interested in client-side work. Again - customize!
  • Languages (Foreign & Programming): Many employers will expect you to actually be able to *use* the languages you list on your resume - that means if you list French, you should be able to speak french. If you list C++, you should be able to write in C++ - and they might just test you on it. A good thing to do is to list your languages like this:

    Proficient with: Java, C++
         Previously worked with: C, C#, Javascript, HTML
    Oh, and this is just a pet peeve of mine that has to be said: if you've worked with C++ and C#, don't list them as "C++/C#". Yes, their names sound similar but the languages aren't. The same goes for Java/JavaScript

  • GPA: If your GPA isn't on your resume, the assumption is that it's below a 3.0. So, if you have a 3.2, list it! You can list either your in-major GPA or your total GPA, or both. Feel free to list which ever one's higher. Also, many universities have a policy that you can round your GPA to the nearest tenth. Check with your school, but if so, you should round that 3.67 to a 3.7. Every little bit helps, right?
------------------
As a point of reference, here's my resume: Gayle Laakmann - Resume 2004. Give yourself 15 seconds to look and the resume and then put it away. What was your impression of it? Did you get a good feel for my past experience? My resume is certainly not perfect (for one, it's too crowded, and quite out of date). I could probably trim it down a bit. That should give you a good start though.

The most important thing to remember is that all you get to show off your years and years of experience is about 15 seconds. Can you tell the employer enough in 15 seconds to make them pick up the phone and call?

View »
Posted by Gayle Laakmann on June 19, 2008
]]>
http://www.careercup.com/blogpost?id=56378 Gayle Laakmann 2008-06-19T17:30+00:00
CareerCup Blog Post: Building Up Your Raw Skills http://www.careercup.com/blog?id=56377
Building Up Your Raw Skills

Technology is a somewhat unique field - in my completely biased opinion - in that your raw skills are tangible and testable. That is to say, in an interview, there's typically less emphasis on "fluff" and more emphasis on what you can actually do.

So, how do you build these raw skills?

Regardless of what position you're looking for, if you want to know how to get there, you should ask someone in the field. Think about where you want to be in the next few years. Find a person who is right now where you want to be and ask them (ask them what?) If you don't know anyone offhand, well, that's what Google is for. Find someone and email them. People are pretty willing to help - if you only ask!

That brings me to the specifics. I've been a software engineer at Google for the last two years, so people ask me pretty frequently how they can get a job at Google. The number one thing that I think is missing from applicants is real project experience.

If you're in school, you should study hard and all that good stuff. But, that's not enough. You need project experience - companies want to see what you can actually code. By the time you've graduated, aim to get at least three major software development projects under your belt. Here are a few ideas as to how to get those projects:


  • Many schools offer the ability to do an independent study. Think of an application that you want to build, pitch it to a professor, and maybe you can get credit for it by doing as an independent study.

  • Talk to professors that you know - or even ones that you don't - and ask them if you can help them out with research. If you want to be a software engineer, focus specifically on the projects where you'll be writing code in a language like C++ or Java (as opposed to, say, MatLab).

  • Check out the code to an open source project and build it. Take some time to learn the project architecture, then start coding. Start with fixing a few bugs, and then move into real feature work.

  • Enroll in courses which have large projects. Yeah, they're hard, but no pain no gain, right?

If you're not in school right now, you might be able to enroll in courses at a local university. But if not, you can still do projects on your own. Start with something small - like a Google Maps mashup listing your favorite restaurants - and go from there.

You'll learn a lot from coding on your own, but the benefits go beyond that - simply the fact that you did coding on your own rather than for work / school shows the passion and dedication that every company wants to see.

View »
Posted by Gayle Laakmann on June 19, 2008
]]>
http://www.careercup.com/blogpost?id=56377 Gayle Laakmann 2008-06-19T17:27+00:00
CareerCup Blog Post: How to Get Your Dream Job http://www.careercup.com/blog?id=56395
How to Get Your Dream Job

Every few weeks, I get an email from someone asking if I can get them a job at their favorite tech company. Sometimes I can get this process started for them, sometimes I can’t, but either way, the process of getting a job is about far more than just submitting your resume.

So, here it is: getting a job in ten not-always-easy steps. Over the next few weeks or so, I’m going to write about each one of these in more detail.

(1) Build Raw Skills

Think a few years out about what position you’d like. What do you need to do to get there?

(2) Prepare a *good* resume

Great experience isn’t enough. You need to show this in your resume. Remember – a resume is not a timeline of everything you’ve done; it’s a proof of your skills.

(3) Picking the right companies

To list just a few things to think about: company size, company culture, the role of someone in your position, how long the company has been around, what the company actually does, growth of the company, location, etc.

(4) Prepare a cover letter

This is a company’s first introduction to you, so make it perfect.

(5) Apply!

Getting your foot in the door at a company isn’t always easy, but there are a few tricks I’ve learned...

(6) Preparing for the interview

Know what to expect and prepare accordingly. If you’re reading CareerCup, you’re probably off to a great start.

(7) Interview

This is what it all comes down, and there’s a lot you can do to shape the outcome.

(8) Negotiate

You can negotiate (almost) any offer – even if they say it’s "non-negotiable"

(9) Make a decision

If you have several offers, you’re in a great spot. How do you pick the one that’s right for you?

(10) Accepting & Denying

Accepting an offer is easy, but don’t forget – it’s important that you decline the offer the right way too.

Stay tuned – I’ll elaborate on each one of these in the upcoming weeks.

View »
Posted by Gayle Laakmann on June 19, 2008
]]>
http://www.careercup.com/blogpost?id=56395 Gayle Laakmann 2008-06-19T17:24+00:00