Article Yahoo Interview Questions

About The Company
Yahoo! Inc is an American public corporation headquartered in Sunnyvale, California. The company is perhaps best known for its web portal, search engine (Yahoo! Search), Yahoo! Directory, Yahoo! Mail, Yahoo! News, advertising, online mapping (Yahoo! Maps), video sharing (Yahoo! Video), and social media websites and services.
History
In January 1994, Jerry Yang and David Filo were Electrical Engineering graduate students at Stanford University. In April 1994, "Jerry and David's Guide to the World Wide Web" was renamed "Yahoo!", for which the official backronym is "Yet Another Hierarchical Officious Oracle". The Yahoo! domain was created on January 18, 1995. Yang and Filo realized their website had massive business potential, and on March 1, 1995, Yahoo! was incorporated.On April 5, 1995, Michael Moritz of Sequoia Capital provided Yahoo! with two rounds of venture capital, raising approximately $3 million.
Product Divisions
  • Communication: Yahoo! provides internet communication services such as Yahoo! Mail and Yahoo! Messenger, Yahoo! Mail is the largest e-mail service in the world with almost half the market share
  • Content: Yahoo! partners with hundreds of premier content providers in products such as Yahoo! Sports, Yahoo! Finance, Yahoo! Music, Yahoo! Movies, etc.
  • Co-branded Internet services: Yahoo! has developed partnerships with different broadband providers such as AT&T, Verizon Communications, offering a range of free and premium Yahoo! content and services to subscribers
  • Mobile: Yahoo! Mobile includes services for on-the-go messaging, such as email, instant messaging and mobile blogging.
  • Commerce: Yahoo! offers commerce services as Yahoo! shipping, Yahoo! Real Estate which enables users to gather relevant information and make commercial transactions and purchases online.
Sample Questions
1.Find maximum subarray within a given array.
Solution: int MaxSubArray(int *a, int size, int &from, int &to){ int sum = 0, maxSum = 0; for (int i = 0; i < size; ++i) { sum += a[i]; if (sum >maxSum) { to = i; // RANGE OF MAXIMUM SUB ARRAY TILL THIS POSITION maxSum = sum; } else if (sum < 0) { from = i+1; // RANGE OF MAXIMUM SUB ARRAY STARTS FROM THIS POSITION. sum = 0; } } return maxSum; } 2. How will u find the min element in the stack with O(1).
  • Have an external array which initially has the 1st element that's pushed to the stack
  • As elements gets processed,append it only if it's lesser than the last element of the array
  • If an element gets popped and is the last element in the array, delete the element from the array
  • The last element in the array will be the minimum at any point of time
For eg: Let's say the elements to be pushed into the stack are: 3 7 2 4
Iteration Stack contents Array Contents Operation
0 3 3 Push
1 3 7 3 Push
2 3 7 2 3 2 Push
3 3 7 2 4 3 2 Push
4 3 7 2 3 2 Pop
5 3 7 3 Pop
Company Headquarters
Indian Presence
Experience a YAHOO
mock interview

Share this post