Gaurav Deshpande gaurav9822

Inspired by this article. Neat tricks for speeding up integer computations.

Note: cin.sync_with_stdio(false); disables synchronous IO and gives you a performance boost. If used, you should only use cin for reading input (don't use both cin and scanf when sync is disabled, for example) or you will get unexpected results.

Multiply by a power of 2

x = x << 1; // x = x * 2

##Google Interview Questions: Product Marketing Manager

Why do you want to join Google? -- Because I want to create tools for others to learn, for free. I didn't have a lot of money when growing up so I didn't get access to the same books, computers and resources that others had which caused money, I want to help ensure that others can learn on the same playing field regardless of their families wealth status or location.
What do you know about Google’s product and technology? -- A lot actually, I am a beta tester for numerous products, I use most of the Google tools such as: Search, Gmaill, Drive, Reader, Calendar, G+, YouTube, Web Master Tools, Keyword tools, Analytics etc.
If you are Product Manager for Google’s Adwords, how do you plan to market this?
What would you say during an AdWords or AdSense product seminar?
Who are Google’s competitors, and how does Google compete with them? -- Google competes on numerous fields: --- Search: Baidu, Bing, Duck Duck Go

General Tip

"The trick is to catch exceptions at the proper layer, where your program can either meaningfully recover from the exception and continue without causing further errors, or provide the user with specific information, including instructions on how to recover from the error. When it is not practical for a method to do either of these, simply let the exception go so it can be caught later on and handled at the appropriate level."

Resources

Advantages of Exceptions
Excellent example of separating error-handling code from program logic

Three Rules for Effective Exception Handling
Longer explanation and case study of exception use, including the basic principles of "throw early" and "catch late". Clear and thorough.

Everything I Ever Learned About JVM Performance Tuning @Twitter- by Attila Szegedi

http://www.infoq.com/presentations/JVM-Performance-Tuning-twitter (video & slides)

9 Fallacies of Java Performance - by Ben Evans

http://www.infoq.com/articles/9_Fallacies_Java_Performance (video & slides)

Visualizing Java GC - by Ben Evans

http://www.infoq.com/presentations/Visualizing-Java-GC (video & slides)

Java Garbage Collection Distilled by Martin Thompson

ANNOUNCEMENT

I have moved this over to the Tech Interview Cheat Sheet Repo and has been expanded and even has code challenges you can run and practice against!

\

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD

	-- show running queries (pre 9.2)
	SELECT procpid, age(clock_timestamp(), query_start), usename, current_query
	FROM pg_stat_activity
	WHERE current_query != '<IDLE>' AND current_query NOT ILIKE '%pg_stat_activity%'
	ORDER BY query_start desc;

	-- show running queries (9.2)
	SELECT pid, age(clock_timestamp(), query_start), usename, query
	FROM pg_stat_activity
	WHERE query != '<IDLE>' AND query NOT ILIKE '%pg_stat_activity%'

	-server
	-Xms2048m
	-Xmx2048m
	-XX:NewSize=512m
	-XX:MaxNewSize=512m
	-XX:PermSize=512m
	-XX:MaxPermSize=512m
	-XX:+UseParNewGC
	-XX:ParallelGCThreads=4
	-XX:MaxTenuringThreshold=1

	Author unknown.

	1.) Algorithm Complexity: You need to know Big-O. If you struggle with
	basic big-O complexity analysis, then you are almost guaranteed not to
	get hired.
	For more information on Algorithms you can visit:
	http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=alg_index

	2.) Coding: You should know at least one programming language really
	well, and it should preferably be C++ or Java. C# is OK too, since