List of Good Tutorial Resources on CodeChef

1.merge sort tree : https://discuss.codechef.com/questions/94448/merge-sort-tree-tutorial
2.dp
https://www.codechef.com/wiki/tutorial-dynamic-programming
3.suffix arrays
https://discuss.codechef.com/questions/21385/a-tutorial-on-suffix-arrays
4.graph theory tutorial:
https://discuss.codechef.com/questions/17801/introduction-to-graphs-definitions-traversal-depth-first-search
5.trees
https://discuss.codechef.com/questions/88168/data-structure-tutorial-tree
6.sum of binomial coeff’s
https://discuss.codechef.com/questions/84205/how-to-calculate-sum-of-binomial-coefficients-efficiently
7.persistence data struc:
8.mobius:
https://discuss.codechef.com/questions/72953/a-dance-with-mobius-function
9.fast modulo mult:
https://discuss.codechef.com/questions/20451/a-tutorial-on-fast-modulo-multiplication-exponential-squaring
10.hld using bfs:
https://discuss.codechef.com/questions/105493/an-alternative-trick-to-solve-many-hld-problems-using-basic-dfs
11.extended euclid:
https://discuss.codechef.com/questions/20842/a-tutorial-on-the-extended-euclids-algorithm
12.1operator precedence:
https://discuss.codechef.com/questions/97411/operator-precedence-table
13.factorials of a huge no:
https://discuss.codechef.com/questions/7349/computing-factorials-of-a-huge-number-in-cc-a-tutorial
14.sieve methods:
15.lazy propagation:
https://discuss.codechef.com/questions/38770/lazy-propagation
16.sprague grundy:
https://discuss.codechef.com/questions/101838/sprague-grundy-theorem-problems-tutorial
17.segment tree-lazy prop:
https://discuss.codechef.com/questions/101041/segment-tree-lazy-propagation
18.call-by-reference-call-by-value
https://discuss.codechef.com/questions/55961/call-by-reference-call-by-value
19.some modular arithmetic.
20.tree
https://www.codechef.com/wiki/tutorial-graph-theory-part-1
21.ncr thing
https://discuss.codechef.com/questions/63966/calculating-ncr-for-large-values-of-n
22.chinese rem theorem.
https://www.codechef.com/wiki/very-brief-tutorial-chinese-remainder-theorem
23.dfs:
https://discuss.codechef.com/questions/106156/dfs-of-graph
24.big int in c:
https://discuss.codechef.com/questions/328/big-integer-in-c
25.binary no.s
https://discuss.codechef.com/questions/46185/decimal-to-binary-conversion
26.comparators/constroc in c
https://www.codechef.com/wiki/using-constructors-and-comparators-c
27.implemented directed graph using linked list:
28.implement directed graph:
https://discuss.codechef.com/questions/102122/how-to-implement-a-directed-graph
29.store a graph in one d array:
https://discuss.codechef.com/questions/92615/how-to-store-any-graphtree-in-single-dimension-array-with-preprocessing-of-edges
30.the correct way to move:
https://discuss.codechef.com/questions/48877/data-structures-and-algorithms
31.finding xor in given range
https://discuss.codechef.com/questions/84803/how-to-find-xor-of-all-the-elements-in-given-range
32.maximum size of an array
https://discuss.codechef.com/questions/28604/maximum-size-of-an-array
33.real-difference-between-stack-memory-and-heap-memory
https://discuss.codechef.com/questions/30471/what-is-real-difference-between-stack-memory-and-heap-memory
34.trick for query-processing
https://discuss.codechef.com/questions/103405/query-processing-on-tree
35.cayley-hamilton
https://discuss.codechef.com/questions/49614/linear-recurrence-using-cayley-hamilton-theorem
36.seg tree
https://discuss.codechef.com/questions/102348/segment-tree-approach-for-problem-solving
37.lazy prop.
https://discuss.codechef.com/questions/38770/lazy-propagation
38.seg tree lazy
https://discuss.codechef.com/questions/101041/segment-tree-lazy-propagation
39.merge sort
https://discuss.codechef.com/questions/87324/how-merge-sort-work
40.bfs
https://discuss.codechef.com/questions/99664/i-want-to-learn-bfs-dfscan-someone-provide-me-stlc-implementation-of-bfs
41.ncr mod m
https://discuss.codechef.com/questions/3869/best-known-algos-for-calculating-ncr-m
42.extended euclid
https://discuss.codechef.com/questions/20842/a-tutorial-on-the-extended-euclids-algorithm
43.grundy
https://discuss.codechef.com/questions/79515/grundy-number
44.inverting bits
https://discuss.codechef.com/questions/97262/bits-inverting
45.operator precedence table
https://discuss.codechef.com/questions/97411/operator-precedence-table
46.priority queue
https://discuss.codechef.com/questions/96212/priority_queue-c
47.intro to graph theory.
https://discuss.codechef.com/questions/17801/introduction-to-graphs-definitions-traversal-depth-first-search
48.count-numbers-in-a-range-segment-tree-lazy
https://discuss.codechef.com/questions/78525/any-easy-way-for-count-numbers-in-a-range-segment-tree-lazy
49.find-no-of-factors-of-a-number
https://discuss.codechef.com/questions/95273/what-is-the-most-efficient-way-to-find-no-of-factors-of-a-number
50.algorithm-tricks
https://discuss.codechef.com/questions/85758/useful-algorithm-tricks
51.map-vs-vector
https://discuss.codechef.com/questions/94791/map-vs-vector
52.sieve-method
https://discuss.codechef.com/questions/94628/sieve-method
53.number-of-set-bits-in-large-numbers
https://discuss.codechef.com/questions/93216/how-to-find-the-number-of-set-bits-in-large-numbers
54.nimble-game-theory
https://discuss.codechef.com/questions/92832/nimble-game-theory
55.nth-fibonacci-number-modulo-m
https://discuss.codechef.com/questions/62693/fastest-way-to-calculate-nth-fibonacci-number-modulo-m
56.Dynamic progr-eggbreak-problem
https://discuss.codechef.com/questions/92306/the-eggbreak-problem
57.efiicient-algorithm-for-rmq
https://discuss.codechef.com/questions/91978/efiicient-algorithm-for-rmq
58.bipartite-graph
https://discuss.codechef.com/questions/91422/bipartite-graph
59.dijkstras-algorithm
https://discuss.codechef.com/questions/91861/implement-dijkstras-algorithm-efficiently
60.fastest-sorting-algorithm
https://discuss.codechef.com/questions/87274/fastest-sorting-algorithm
62.find-the-factorial-of-100-in-c
https://discuss.codechef.com/questions/6587/find-the-factorial-of-100-in-c
63.interval-scheduling-problem
https://discuss.codechef.com/questions/91250/interval-scheduling-problem
64.building-up-the-recurrence-matrix
https://discuss.codechef.com/questions/2335/building-up-the-recurrence-matrix-to-compute-recurrences-in-ologn-time
65.find-the-next-permutation
https://discuss.codechef.com/questions/61/to-find-the-next-permutation
66.interval-scheduling
https://discuss.codechef.com/questions/90639/interval-scheduling
67.unreachable-nodes-dfs
https://discuss.codechef.com/questions/90542/unreachable-nodes-dfs
68.list-vs-vector
https://discuss.codechef.com/questions/90510/list-vs-vector
69.checking-if-a-no-is-power-of-2
https://discuss.codechef.com/questions/85703/checking-if-a-no-is-power-of-2
70.sorting-of-vectors-or-arrays
https://discuss.codechef.com/questions/90224/sorting-of-vectors-or-arrays
71.longest-common-prefix
https://discuss.codechef.com/questions/90142/find-the-length-longest-common-prefix
72.range-minimum-query without BIT
https://discuss.codechef.com/questions/40112/range-minimum-query-without-using-fenwick-tree
74.recurrence-relation-for-a-dp-problem
https://discuss.codechef.com/questions/69008/how-to-formulate-a-recurrence-relation-for-a-dp-problem
75.find-unreachable-nodes-using-dfs
https://discuss.codechef.com/questions/89617/how-to-find-unreachable-nodes-using-dfs
76.bellman-ford-algorithm-implemention
https://discuss.codechef.com/questions/89823/bellman-ford-algorithm-implemention
77.data-structure-tutorial-array
https://discuss.codechef.com/questions/87915/data-structure-tutorial-array
78.data-structure-tutorial-stack
https://discuss.codechef.com/questions/88083/data-structure-tutorial-stack
79.dynamic-programming-guide
https://discuss.codechef.com/questions/89327/dynamic-programming-guide
80.cycle-detection-in-directed-graph
https://discuss.codechef.com/questions/88748/cycle-detection-in-directed-graph
81.java-collections-tutorial-part-3
https://discuss.codechef.com/questions/87026/java-collections-tutorial-part-3
82.java-collections-tutorial-part-2
https://discuss.codechef.com/questions/87027/java-collections-tutorial-part-2
83.data-structure-tutorial-tree
https://discuss.codechef.com/questions/88168/data-structure-tutorial-tree
84.dijkstra-algorithm-tutorial
https://discuss.codechef.com/questions/66913/dijkstra-algorithm-tutorial
85.finding-prime-factors-in-osqrtn
https://discuss.codechef.com/questions/85743/tutorials-finding-prime-factors-in-osqrtn
87.data-structure-tutorial-introduction
https://discuss.codechef.com/questions/87772/data-structure-tutorial-introduction
88.data-structure-tutorial-queue
https://discuss.codechef.com/questions/88099/data-structure-tutorial-queue
89.gaussian-elimination-algorithm
https://discuss.codechef.com/questions/87369/gaussian-elimination-algorithm
90.algorithm-to-find-inverse-modulo-m
https://discuss.codechef.com/questions/1440/algorithm-to-find-inverse-modulo-m
91.binary-search-tree-deletion
https://discuss.codechef.com/questions/17145/binary-search-tree-deletion
92.finding-number-of-digits-in-nth-term-of-fibonacci-series
https://discuss.codechef.com/questions/85730/finding-number-of-digits-in-nth-term-of-fibonacci-series
93.calculate-power
https://discuss.codechef.com/questions/87070/how-to-calculate-power
94.java-collections-tutorial-part-4
https://discuss.codechef.com/questions/87025/java-collections-tutorial-part-4
95.java-collections-tutorial-part-1
https://discuss.codechef.com/questions/87028/java-collections-tutorial-part-1
96.in-order-traversal-in-a-bst
https://discuss.codechef.com/questions/86951/in-order-traversal-in-a-bst
97.segment-tree-vs-bit
https://discuss.codechef.com/questions/73815/segment-tree-vs-bit
98.size-of-segment-tree
https://discuss.codechef.com/questions/85040/size-of-segment-tree
99.find-maximum-xor-prefix-and-suffix-optimally
https://discuss.codechef.com/questions/84304/how-to-find-maximum-xor-prefix-and-suffix-optimally
100.construction-of-persistent-segment-tree
https://discuss.codechef.com/questions/84296/construction-of-persistent-segment-tree
101.turbo-sort
https://discuss.codechef.com/questions/14768/turbo-sort
102.modulo-10^9+7
https://discuss.codechef.com/questions/42378/modulo-109-7
103.find-sum10^9+7-in-a-given-range-of-array-efficiently
https://discuss.codechef.com/questions/83444/how-to-find-sum1097-in-a-given-range-of-array-efficiently
104.dijkstra-algorithmin-c
https://discuss.codechef.com/questions/51322/how-to-implement-dijkstra-algorithmin-c
105.lowest-common-ancestor-in-binary-tree
https://discuss.codechef.com/questions/14645/finding-lowest-common-ancestor-in-binary-tree
106.sliding-window-algorithm
https://discuss.codechef.com/questions/28264/sliding-window-algorithm