Posts

How to study CLRS?

Well, you should read this book from Start to end (From Basics to Masters). Here are my suggestion on How to read this Book.  Reading and Understanding CLRS: 1.  Use video lectures to understand the concept, and read the chapter from the book. Best site for CLRS lecture videos :  Lecture 1: Administrivia, Introduction, Analysis of Algorithms, Insertion Sort, Mergesort Video Lectures | Introduction to Algorithms (SMA 5503) | Electrical Engineering and Computer Science | MIT OpenCourseWare Peteris Krumins  has published a series of blog posts covering the lectures. You can  also find his lecture notes for each video. Start with this one:  http://www.catonmat.net/b log/mit... . What if you're not understanding Mathematical equations and Proofs, functions given in the Book?  1.  Watch Videos on Discrete mathematics by Arsdigita University Course 02: Discrete Mathematics (Arsdigita University) : Free Download & Streaming : Internet Archive   In parallel with it read  Discrete mathe

Bible of Algorithms

This is the most prefferable book for competitive programmers you can download it at  http://folk.ntnu.no/nicolaat/uni/Algdat/%5BThomas_H._Cormen,_Charles_E._Leiserson,_Ronald_L.(BookFi.org).pdf

How to get started.

Here are some steps to get started and be good at it. Get comfortable writing code in either of one of these languages C, C++ or Java . Why only C, C++ or Java? Because these are the standard languages allowed in any programming competition.   If you are already good at C, it is suggested to learn C++ . It is the most popular language among competitive programmers because of its speed and an excellent library in the form of STL (Standard Template Library).   Pick an online judge. Recommended ones are Topcoder and Codeforces . These sites have high quality of problems and also allow you to see other’s code post contest completion. These also categorize problems based on the topic. Some other popular judges include SPOJ , CodeChef (powered by SPOJ) and HackerEarth .   To begin with, start with simple problems that typically require transformingEnglish to code and does not require any knowledge on algorithms. Solving Div 2 250 (Division 2, 250 points) in Topcoder or Div 2 P

Welcome to my blog

Here i will try to give the best resources for Competitive programming and hope everyone will keep visiting my blog Thank you.