Recommendations For Structure And Standards Of: Fill & Download for Free

Mastering Data Structures and algorithms is a step by step learning process. As we say “You can’t win a battle in a day, you need to prepare for it before for months”. Similarly before learning Data Structures and Algorithms, you need to learn basics of programming.This is the road-map which you should follow:[Day 0-30]Learn a programming language. Prefer an object oriented programming language like C++, Java, Python. You can also choose C in the beginning if you are facing difficulty in leaning an OOPS language and then switch to Java or C++.But I highly recommend learning C++ or Java because it has many important concepts which lack in other scripting or shell languages.Books to be followed:The C++ Programming LanguageCore Java Volume I – FundamentalsJava Concurrency in PracticeEffective JavaDay [31-40]Once you have mastered all the concepts of programming languages like C, C++, JAVA or Python, now you can start learning data structures.->Time and space complexity : For every code you write or have written till now , you should be able to calculate time and space complexity for it . Just coding is not enough, you need to write an efficient code with optimised time and space complexity.-> Arrays and Strings : These are the simplest data structures but the building blocks of every other data structure. These need to be practised very properly.->Linked Lists ,Stacks and Queues : Most important to learn. These are foundation of heaps, binary trees etc.Day[41-50]Now ,learn some basics of algorithms :Mathematical Logic : Practice some questions on basic mathematical concepts like fibonacci numbers , prime , hcf, lcm etc. to build your coding logic.Searching and Sorting algorithms : Learn all the sorting algorithms like Bubble sort, Selection Sort, Merge Sort etc and basic searching algorithms like linear and merge sort.Pattern Matching and string algorithms,Recursion : Recursion if a function calling itself. Many standard algorithms are based on recursion concept.Day[51-60]Heaps and Trees :Learn how to build min and max heap , binary trees, binary search trees, AVL trees etc.Graphs : Learn different ways to implement graphs through matrix and adjacency list.Hashing : This is mostly asked topic in coding interviews .Day[61-70]Learn some advance algorithms:Backtracking : Backtracking is a general algorithm for finding all solutions to some computational problems.Divide and conquer divide and conquer is an algorithm design paradigm based on multi-branched recursion.Dynamic Programming Dynamic programming approach is similar to divide and conquer in breaking down the problem into smaller and yet smaller possible sub-problemsGreedy algorithms An algorithm is designed to achieve optimum solution for a given problem.The Bitwise Algorithms are used to perform operations at bit-level or to manipulate bits in different ways.Day[71-80]System design: Systems design is the process of defining the architecture, modules, interfaces, and data for a system to satisfy specified requirements.Low level design & design patterns: software design pattern is a general, reusable solution to a commonly occurring problem within a given context in software design.Practice your skills on online coding platforms like :1.Hackerearth https://www.hackerearth.com/2.HackerRank https://hackerrank.com/3.LeetCode https://leetcode.com/4.Codechef https://www.codechef.com/5: Learnbay.io ( System design, Low level design & data structure online course )6: Udacity (data structure training ).7: Hackstack (Best online courses for Data Structures, System Design, Data structure using Python)8: Educative. io ( Educative: Interactive Courses for Software Developers )9: CodeforcesAll the best

I have a few books that I recommend a lotAlgorithms1) Algorithm Design 1st Edition by Jon Kleinberg, Eva Tardos - One of the best books for Algorithms and takes a good effort in making you understand the intution behind the Algorithm, which I have found to like a lot.2) The Algorithm Design Manual by Steven S. Skiena - Once you get past Kleinberg, this book will introduce you to a wide range of problems, this book is a example by example book, and hence may need basic level knowledge.Graph TheoryI specialized in that, and hence even though you may not need them, suggesting the following.1) Introduction to Graph Theory 2nd Edition by Douglas B West. - This is my favorite book, and has almost everything on Graph theory, but lacks a intutional idea.2) Graph Theory 01 Edition by Harary - A classic book that is easy to read but a lot old by Harary, introduces Graph theory wonderfully.3) Graph Theory 0004 Edition by Reinhard Diestel- Standard text book for Graph theory, and does a good job at that, but personally I like the above two books for different reasons better.References1) Introduction to Algorithms 3 Edition - I find this book useful only as a reference, when I need to know stuff, the algorithms and data structures, are presented as is, without any amount of intuition or anything. But if you have a technical doubt in algorithms, chances are that this book will answer it. So please do use this as a reference book. Chances are you will find better text books for each of the topics in CLRS.

I am sure this is going to help you (source : codechef) :Binary Search : tutorial with problems, tutorial with implementation, problemQuicksort : tutorial with implementation, tutorial with problemsMerge Sort : tutorial with implementation, tutorial with problemsSuffix Array : tutorial with implementation, tutorial with implementation, problem, problem, problemKnuth-Morris-Pratt Algorithm (KMP) : tutorial, tutorial with implementation, problem, problem, problemRabin-Karp Algorithm : tutorial with implementation, tutorial, problem, problemTries : tutorial with problems, Tutorial : I, II, tutorial, problem, problem, problemDepth First Traversal of a graph : tutorial with implementation, tutorial with problems, problem, problem, problemBreadth First Traversal of a graph : tutorial with implementation, tutorial with problems, problem, problem, problem, Flood FillDijkstra's Algorithm : tutorial with problems, problem, tutorial(greedy), tutorial (with heap), implementation, problem, problemBinary Indexed Tree : tutorial with problems, tutorial, original paper, tutorial, tutorial, problem, problem, problem, problem,problem, problemSegment Tree (with lazy propagation) : tutorial with implementation, tutorial, tutorial with problems and implementation,tutorial with implementation, Persistent Segment Tree, problems same as BIT, problemZ algorithm : tutorial with problem, tutorial, problems same as KMP.Floyd Warshall Algorithm : tutorial with implementation, problem, problemSparse Table(RMQ) : tutorial with problems, tutorial with implementation(C++), java implementationHeap / Priority Queue / Heapsort : implementation with explanation, tutorial, implementation, problem, reading the chapter from clrs is highly recommended.Modular Multiplicative InversenCr % MSuffix Automaton : detailed paper, tutorial with implementation (I), tutorial with implementation (II), problem, problem,problem, problem, tutorial with implementationLowest Common Ancestor : tutorial with problems, tutorial(binary tree) with implementation, detailed paper for LCA in DAGs, problem, problemCounting Inversions : Divide and Conquer, Segment Tree, Fenwick Tree, problemEuclid's Extended AlgorithmSuffix Tree : tutorial, tutorial, tutorial, tutorial, implementation, implementation, problem, problem, problem, problemDynamic Programming : chapter from clrs(essential), tutorial with problems, problem, problem, problem, problem, problem,tutorial, problem, problem, problem, longest increasing subsequence, bitmask dp, bitmask dp, optimization, problem, problem,problem, problem, problem, problem, problem, dp on trees : I, IIBasic Data Structures : tutorial, Stack implementation, Queue implementation and tutorial, Linked list implementationlogarithmic exponentiationGraphs : definition, representation, definition, representation, problem, problemMinimum Spanning Tree : tutorial, tutorial with kruskal's implementation, Prim's implementation, problem, problem, problem,problem, problemEfficient Prime FactorizationCombinatorics : tutorial with problems, problemUnion Find/Disjoint Set : tutorial, tutorial with problems, problem, problem, problemKnapsack problem : solution and implementationAho-Corasick String Matching Algorithm : tutorial, implementation, problem, problem, problem, problemStrongly Connected Components : tutorial with implementation, tutorial, problem, problem, problemBellman Ford algorithm : tutorial with implementation, tutorial with implementation, problem, problemHeavy-light Decomposition : tutorial, tutorial, implementation, implementation, problem, problem, problem, problem, problem,problem, problemConvex Hull : tutorial with jarvis's algorithm implementation, tutorial with graham scan, tutorial, implementation, problem,problem, problem, problemLine Intersection : tutorial with imp., tutorial with problemsSieve of ErastothenesInterval Tree : tutorial with implementation, problem, problem, problem, problem, problem, problem, tutorialCounting SortProbabilitiesBuilding up the recurrence matrix to compute recurrences in O(logN) timeNetwork flow : (Max Flow)Tutorial : I, II, Max flow(ford-fulkerson) tutorial with implementation, (Min cut) tutorial with implementation, (Min cost flow)Tutorial : I, II, III, Dinic's algorithm with implementation, Max flow by Edmonds Karp with implementation, problem, problem, problem, problem, problem, problem, problem, problem, problem, problem, problem,problem, problem, problem, problemK-d tree : tutorial, tutorial, implementation, problemDequeBinary Search Tree : tutorial with implementation, Searching and insertion, DeletionQuick Select : implementation, implementationTreap/Cartesian Tree : tutorial(detailed), tutorial with implementation, problemGame Theory : detailed paper, tutorial with problems, Grundy numbers, Tutorial with example problems - I, II, III, IV, tutorial with problems, problem, problem, problem, problem, problem, problem, problem, problem, problem, problem, problem, NimSTL (C++) : I, II, Crash CourseMaximum Bipartite MatchingManacher's Algorithm : implementation, tutorial, tutorial with implementation, tutorial with implementation, problem, problem,problemMiller-Rabin Primality Test : CodeStable Marriage ProblemHungarian AlgorithmSweep line Algorithm : I, IILCP : tutorial with implementation, tutorial with implementationGaussian EliminationPollard Rho Integer Factorization, problemTopological SortingDetecting Cycles in a Graph : Directed - I, II Undirected : IGeometry : BasicsBacktracking : N queens problem, Tug of War, SudokuEulerian and Hamiltonian Paths : tutorial, tutorial, (eulerian path and cycle)implementation, (hamiltonian cycle)implementationGraph Coloring : tutorial with implementationMeet in the Middle : tutorial, implementationArbitrary Precision Integer(BigInt), IIRadix Sort, Bucket SortJohnson's Algorithm : tutorial, tutorial, implementationMaximal Matching in a General Graph : Blossom/Edmond's Algorithm with implementation, Tutte Matrix, problemRecursion : I, II, Towers of Hanoi with explanationInclusion and Exclusion Principle