Linked List II: Topic Name

TOPIC NAME
Linked List
Linked List II
Binary Search
BST II BST Binary Search II
DP & Backtracking Heaps BST II
STL
KADANE ALGORITHM
APPLICATION OF
DYNAMIC
PROGRAMING
Divide &
Conqueror
Divide &
Conqueror
Graphs
TRIE
BackBacktracki Backtracking and D
perm
permuattion
permuattion of a arr
prinprinting all printing all the subse
KnapKnapsack PrKnapsack Problem [sp
N quN queen prN queen problem
BlueBlue BerriesBlue Berries [ RPLB ]
MaxMax sum ofMax sum of subsequ
larg largest so largest sommon sub
cutcutting the cutting the rod
whatwhat is nextwhat is next
SuduSuduko Suduko
BuyiBuying applBuying apples
No oNo of ways No
t of ways to arrange
OOPOOPs OOPs
vectvector vector
set set set
maps
maps maps
htphtps://www
htps://www.hackere
htphtps://wwhtps://www.hacker
htphtps://www
htps://www.hackere
htphtps://wwhtps://www.codec
No oNo of ways No
t of ways to arrange
OOPOOPs OOPs
vectvector vector
set set set
maps
maps maps
htphtps://www
htps://www.hackere
htphtps://www
htps://www.hackere
htphtps://wwhtps://www.codec
KADANE ALGORITHM
APPLICATION OF
DYNAMIC
PROGRAMING
DIVIDE AND
CONQUER
CONQUER
Questions
Print elements of link list

Print elements in reverse
Write a function to insert a new node at the end of a link list.
Write a function to insert a new node at the front of a link list.
Write a function to find whether given number is present in link list or not
Write a function to find count of given number in link list
Write a function to find sum of all number in link list
Write a function to find max and min of all number in link list
Write a function to delete the first node with given number in link list
Write a function to delete all node with given number in link list
Write a function to insert a new node at a cerntain position in the link list. If that position doesn't exist then insert
at front of link list.
Write a function to delete node at a cerntain position in the link list. If that position doesn't exist then delete
the first node
Write a function to insert a new node at a cerntain position in the link list. If that position doesn't exist then insert
at end of link list.
Write a function to delete node at a cerntain position in the link list. If that position doesn't exist then delete
the last node
Revese a link list

Get Node Value from tail
Get Node Value from head
Insert node into sorted double link list
Compare two linked lists

Merge two sorted linked lists
Delete duplicate-value nodes from a sorted linked list
Cycle detection
Find Merge point of two LL
Inserted node into sorted double link list
Revese a double LL
Hashing Function
Merge sort
Binary Search
Bussy Man
EKO
No of Stairs
1. Find number of rotations in a circularly sorted array
2. Search an element in a circular sorted array
3. Find first or last occurrence of a given number in a sorted array
4. Count occurrences of a number in a sorted array with duplicates
5. Find smallest missing element from a sorted array
6. Find Floor and Ceil of a number in a sorted array
7. Search in a nearly sorted array in O(logn) time
8. Find number of 1’s in a sorted binary array
9. Find the peak element in an array
10. Exponential search
Find Lower Bound
Find last occurance of a number in the ascending order of a array
Find 1st occurance of a number in the descending order of a array
Find the count of occurance of a number
htps://www.codechef.com/MARCH18B/problems/MINEAT
Binary Search tree

creating BST
finding number in the tree
deleting the number
inserting the number in the tree
height of a binary tree
AVL Tree
Basic:
Pre Order
Post Order
In Order
Height of Binary Tree
Insertion
Medium:
LCA of two nodes
Top View of Tree
Level Order
Hard:
BST to DLL
htps://www.geeksforgeeks.org/binary-tree-to-binary-search-tree-conversion/
htps://www.geeksforgeeks.org/check-for-identical-bsts-without-building-the-trees/
htps://www.geeksforgeeks.org/second-largest-element-in-binary-search-tree-bst/
htps://www.geeksforgeeks.org/kth-largest-element-in-bst-when-modification-to-bst-is-not-allowed/
htps://www.geeksforgeeks.org/kth-smallest-element-in-bst-using-o1-extra-space/
htps://www.geeksforgeeks.org/check-two-bsts-contain-set-elements/
htps://www.geeksforgeeks.org/largest-number-bst-less-equal-n/
htps://www.geeksforgeeks.org/count-inversions-in-an-array-set-2-using-self-balancing-bst/
htps://www.geeksforgeeks.org/count-pairs-from-two-bsts-whose-sum-is-equal-to-a-given-value-x/
htps://www.geeksforgeeks.org/sum-k-smallest-elements-bst/
htps://github.com/rishabh115/Interview-Questions/tree/master/Samsung
BST to DLL
creating heap
finding minima
deleting minima
heap sorting
Heap by STL
Finding Kth Minima and Kth Maxima
Jesse and cookies
Delete any general element from the Heap
Heap by class
permuattion of a array
printing all the subsets
N queen problem
Blue Berries [ RPLB ]
Max sum of subsequences
what is next
Tower of Honoi
Rate Maze
Number of ways of changing coin.
Suduko
No of ways to arrange White balls & Black balls such that 2 balls are not together
Very Easy
https://www.codechef.com/problems/KJCP3
https://www.codechef.com/problems/GOOGOL05
https://www.codechef.com/problems/AMMEAT
https://www.codechef.com/problems/SMPAIR
Easy
Medium
https://www.codechef.com/problems/NUMBERS
https://www.codechef.com/problems/SWEGARR
https://www.codechef.com/problems/MAXDIFF
https://www.codechef.com/problems/CHEFA
https://www.codechef.com/problems/KETFAST
https://www.codechef.com/problems/TACHSTCK
Hard
https://www.codechef.com/problems/TOURMAP
htps://www.codechef.com/FEB18/problems/PERMPAL
https://www.hackerearth.com/practice/data-structures/trees/binary-search-tree/practice-problems/algorithm/monk-a
https://www.hackerearth.com/problem/algorithm/monks-birthday-party/
https://www.hackerearth.com/problem/algorithm/the-monk-and-class-marks/
https://www.hackerearth.com/practice/data-structures/trees/heapspriority-queues/practice-problems/algorithm/mon
https://www.codechef.com/problems/NUMBERS
htps://www.codechef.com/MARCH18B/problems/MIXCOLOR
1. Rod cutting Problem -

2. Find length of Longest Common Substring.
3. Find length of Longest Common Subsequence.
4. Knapsack Problem
5. Wachovia Bank Problem from SPOJ
6. Buying Apple Problem from SPOJ
7. 5 Variant of Coin change problem
8. Print longest common Substring
9. Print all longest common Substring
10. Print lexicographically smallest Longest common Substring
11. Print longest common Subsequence
12. Print all longest common Subsequence
13. Print lexicographically smallest Longest common Subsequence
14. Catalan number : Problem and solution | Set of problems whose solution is Catalan
Number : https://brilliant.org/wiki/catalan-numbers/ , http://www.geometer.org/mathcircles/catalan.pdf
Inversion count -O(NlogN)

EKO
a to power b in O(logn)
a to power b mod c
Lower_bound
and Upper_bound by binary search
Commulative sum
Max element in the array
Sum of the array
Maximum Histogram Area
Count all '1' in the array of '0' and '1'
creating adjency list

BFS
DFS
Checking wheter graph is bipartite or not ?
Checking wheter graph is connected or not ?
Checking 2 edge connectivity ?

Dikstras Algorithm
Krushkal's Algorithm
1. https://www.codechef.com/ENGM2015/problems/ENIGMA07
3. http://www.spoj.com/problems/ABCPATH/
5. https://www.codechef.com/problems/CC
6. https://www.codechef.com/MARCH12/problems/HDELIVER
7. http://www.spoj.com/problems/PPATH/
Codes for graph:
http://www.spoj.com/problems/FACEFRND/
http://www.spoj.com/problems/FRNDCIRC/ KRUSKAL
http://www.spoj.com/problems/IGALAXY/
http://www.spoj.com/problems/CCHESS/
http://www.spoj.com/problems/TRAFFICN/
Trie implementation
Finding Whether Sentence is formed or not ?
Backtracking and Dynamic Programming
Knapsack Problem [spoj ]
N queen problem
largest sommon subsequence
cutting the rod
what is next
Suduko
Buying apples
OOPs
vector
set
maps
htps://www.hackerearth.com/practice/data-structures/trees/binary-search-tree/practice-problems/algorithm/monk-and-
htps://www.hackerearth.com/problem/algorithm/monks-birthday-party/
htps://www.hackerearth.com/problem/algorithm/the-monk-and-class-marks/
htps://www.hackerearth.com/practice/data-structures/trees/heapspriority-queues/practice-problems/algorithm/monk-an
htps://www.codechef.com/problems/NUMBERS
OOPs
vector
set
maps

N queen problem
cutting the rod
what is next
Suduko
Buying apples
OOPs
vector
set
maps
OOPs
vector
set
maps
Link My Status 1 My Status 2
https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list/problem
Implemented
https://www.hackerrank.com/challenges/print-the-elements-of-a-linked-list-in-reverse/problem
Implemented
https://www.hackerrank.com/challenges/insert-a-node-at-the-tail-of-a-linked-list/problem
Implemented
https://www.hackerrank.com/challenges/insert-a-node-at-the-head-of-a-linked-list/problem
Implemented
NA Implemented
NA Implemented
NA Implemented
NA Implemented
https://www.hackerrank.com/challenges/delete-a-node-from-a-linked-list/problem
Implemented
NA Implemented
https://www.hackerrank.com/challenges/insert-a-node-at-a-specific-position-in-a-linked-list/problem
Implemented
NA Implemented
NA Implemented
NA Implemented
https://www.hackerrank.com/challenges/reverse-a-linked-list/problem
Implemented
https://www.hackerrank.com/challenges/get-the-value-of-the-node-at-a-specific-position-from-the-tail/problem
Implemented
NA Implemented
https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-doubly-linked-list/problem
NOT
https://www.hackerrank.com/challenges/compare-two-linked-lists/problem
NOT
https://www.hackerrank.com/challenges/merge-two-sorted-linked-lists/problem
NOT
https://www.hackerrank.com/challenges/delete-duplicate-value-nodes-from-a-sorted-linked-list/problem
Implemented
https://www.hackerrank.com/challenges/detect-whether-a-linked-list-contains-a-cycle/problem
Implemented
https://www.hackerrank.com/challenges/find-the-merge-point-of-two-joined-linked-lists/problem
Implemented
https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-doubly-linked-list/problem
NOT
https://www.hackerrank.com/challenges/reverse-a-doubly-linked-list/problem
NOT
Implemented
Implemented
NOT
TRIED
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
NOT
htps://www.hackerrank.com/challenges/tree-preorder-traversal/problem
Implemented
htps://www.hackerrank.com/challenges/tree-postorder-traversal
Implemented
htps://www.hackerrank.com/challenges/tree-inorder-traversal/problem
Implemented
htps://www.hackerrank.com/challenges/tree-height-of-a-binary-tree/problem
Implemented
htps://www.hackerrank.com/challenges/binary-search-tree-insertion/problem
Implemented
htps://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor/problem
NOT
htps://www.hackerrank.com/challenges/tree-top-view/problem
NOT
htps://www.hackerrank.com/challenges/tree-level-order-traversal/problem
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
Inversion Count NOT
NOT
NOT
Implemented
Implemented
Implemented
Tried - could't
Implemented
Logic is known- not tried
Tried - could't
NOT
Implemenetd
Implemenetd
NOT
Tried - could'nt
Implemenetd
Implemenetd
NOT
Implemenetd
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
/monk-and-his-friends/ NOT
NOT
NOT
hm/monk-and-the-magical-candy-baNOT
NOT
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
NOT
NOT
NOT
NOT
NOT
NOT
seen - tried-could'nt
Implemented
Tried-many times- could'nt submit
Not
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
Implemented
NOT
Implemented
Implemented
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
NOT
Backtracking and DynamBacktracking and D Backtracking an BBacktracking and D Backtrack
permuattion of a array permuattion of a arrpermuattion of appermuattion of a arrpermuattio
printing all the subsets printing all the subseprinting all the s pprinting all the subsprinting al
Knapsack Problem [spoj ]Knapsack Problem [sp
Knapsack Problem
KKnapsack Problem [sKnapsack P
N queen problem N queen problem N queen problemNN queen problem N queen p
Blue Berries [ RPLB ] Blue Berries [ RPLB ]Blue Berries [ RPLBBlue Berries [ RPLB ]Blue Berrie
Max sum of subsequenceMax sum of subsequMax sum of subsM
Max sum of subsequMax sum o
largest sommon subsequlargest sommon sublargest sommon llargest sommon sublargest s
cutting the rod cutting the rod cutting the rod ccutting the rod cutting the
what is next what is next what is next w
what is next what is nex
Suduko Suduko Suduko SSuduko Suduko
Buying apples Buying apples Buying apples BBuying apples Buying app
No of ways to arrange Whi
No of ways to arrange
No of ways to arrNNo of ways to arrangNo of ways
OOPs OOPs OOPs OOOPs OOPs

vector vector vector vvector vector
set set set sset set
maps maps maps m
maps maps
htps://www.hackerearth.htps://www.hackerehtps://www.hack
hhtps://www.hackere
htps://ww
htps://www.hackerearthhtps://www.hackerhtps://www.hachhtps://www.hackerhtps://ww
htps://www.hackerearthhtps://www.hackerhtps://www.hachhtps://www.hackerhtps://w
htps://www.hackerearthhtps://www.hackerehtps://www.hack
hhtps://www.hackerhtps://ww
htps://www.codechef. htps://www.codec htps://www.co hhtps://www.codec htps://w
No of ways to arrange
No of ways to arrNNo of ways to arrangNo of ways
OOPs OOPs OOPs OOOPs OOPs

vector vector vector vvector vector
set set set sset set
maps maps maps m
maps maps
htps://www.hackerearth.htps://www.hackerehtps://www.hack
hhtps://www.hackere
htps://ww
htps://www.hackerearthhtps://www.hackerhtps://www.hachhtps://www.hackerhtps://ww
htps://www.hackerearthhtps://www.hackerhtps://www.hachhtps://www.hackerhtps://w
htps://www.hackerearthhtps://www.hackerehtps://www.hack
hhtps://www.hackerhtps://ww
htps://www.codechef. htps://www.codec htps://www.co hhtps://www.codec htps://w
implemented
implemented Very Important
implemented
implemented
implemented
implemented
implemented
Not Implemented
partially
Not Implemented
Not Implemented
implemented
implemented
implemented
implemented
implemented
implemented
implemented
/monk-and-the-magical-candy-bags/
onk-and-his-friends/
/monk-and-the-magical-candy-bags/
Backtracking and DynamBacktrack Backtrack Backtrack Backtrack Backtrack Backtrack Backtrack Backtrack
permuattion of a array permuattiopermuattiopermuattiopermuattiopermuattiopermuattiopermuattiopermuattio
printing all the subsets printing al printing al printing al printing al printing al printing al printing al printing al
Knapsack Problem [spoj ]Knapsack PKnapsack PKnapsack PKnapsack PKnapsack PKnapsack PKnapsack PKnapsack P
N queen problem N queen pN queen pN queen pN queen pN queen pN queen pN queen pN queen p
Blue Berries [ RPLB ] Blue BerrieBlue BerrieBlue BerrieBlue BerrieBlue BerrieBlue BerrieBlue BerrieBlue Berrie
Max sum of subsequenceMax sum oMax sum oMax sum oMax sum oMax sum oMax sum oMax sum oMax sum o
largest sommon subsequlargest s largest s largest s largest s largest s largest s largest s largest s
cutting the rod cutting thecutting thecutting thecutting thecutting thecutting thecutting thecutting the
what is next what is nexwhat is nexwhat is nexwhat is nexwhat is nexwhat is nexwhat is nexwhat is nex
Suduko Suduko Suduko Suduko Suduko Suduko Suduko Suduko Suduko
Buying apples Buying appBuying appBuying appBuying appBuying appBuying appBuying appBuying app
No of waysNo of waysNo of waysNo of waysNo of waysNo of waysNo of waysNo of ways
OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs

vector vector vector vector vector vector vector vector vector
set set set set set set set set set
maps maps maps maps maps maps maps maps maps
htps://www.hackerearth.htps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://ww
htps://www.hackerearthhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://ww
htps://www.hackerearthhtps://w htps://w htps://w htps://w htps://w htps://w htps://w htps://w
htps://www.codechef. htps://w htps://w htps://w htps://w htps://w htps://w htps://w htps://w
No of waysNo of waysNo of waysNo of waysNo of waysNo of waysNo of waysNo of ways
OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs

vector vector vector vector vector vector vector vector vector
set set set set set set set set set
maps maps maps maps maps maps maps maps maps
htps://www.hackerearth.htps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://ww
htps://www.hackerearthhtps://w htps://w htps://w htps://w htps://w htps://w htps://w htps://w
htps://www.codechef. htps://w htps://w htps://w htps://w htps://w htps://w htps://w htps://w
Standard Problem
Backtrack Backtrack Backtrack Backtrack Backtrack Backtrack Backtrack Backtrack Backtrack Backtrack
permuattiopermuattiopermuattiopermuattiopermuattiopermuattiopermuattiopermuattiopermuattiopermuattio
printing al printing al printing al printing al printing al printing al printing al printing al printing al printing al
Knapsack PKnapsack PKnapsack PKnapsack PKnapsack PKnapsack PKnapsack PKnapsack PKnapsack PKnapsack P
N queen pN queen pN queen pN queen pN queen pN queen pN queen pN queen pN queen pN queen p
Blue BerrieBlue BerrieBlue BerrieBlue BerrieBlue BerrieBlue BerrieBlue BerrieBlue BerrieBlue BerrieBlue Berrie
Max sum oMax sum oMax sum oMax sum oMax sum oMax sum oMax sum oMax sum oMax sum oMax sum o
largest s largest s largest s largest s largest s largest s largest s largest s largest s largest s
cutting thecutting thecutting thecutting thecutting thecutting thecutting thecutting thecutting thecutting the
what is nexwhat is nexwhat is nexwhat is nexwhat is nexwhat is nexwhat is nexwhat is nexwhat is nexwhat is nex
Suduko Suduko Suduko Suduko Suduko Suduko Suduko Suduko Suduko Suduko
Buying appBuying appBuying appBuying appBuying appBuying appBuying appBuying appBuying appBuying app
No of waysNo of waysNo of waysNo of waysNo of waysNo of waysNo of waysNo of waysNo of waysNo of ways
OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs
vector vector vector vector vector vector vector vector vector vector
set set set set set set set set set set
maps maps maps maps maps maps maps maps maps maps
htps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://wwhtps://ww
htps://w htps://w htps://w htps://w htps://w htps://w htps://w htps://w htps://w htps://w
Backtrack Backtrack Backtrack Backtrack Backtrack
permuattiopermuattiopermuattiopermuattiopermuattio
printing al printing al printing al printing al printing al
Knapsack PKnapsack PKnapsack PKnapsack PKnapsack P
N queen pN queen pN queen pN queen pN queen p
Blue BerrieBlue BerrieBlue BerrieBlue BerrieBlue Berrie
Max sum oMax sum oMax sum oMax sum oMax sum o
largest s largest s largest s largest s largest s
cutting thecutting thecutting thecutting thecutting the
what is nexwhat is nexwhat is nexwhat is nexwhat is nex
Suduko Suduko Suduko Suduko Suduko
Buying appBuying appBuying appBuying appBuying app
No of waysNo of waysNo of waysNo of waysNo of ways
OOPs OOPs OOPs OOPs OOPs

vector vector vector vector vector
set set set set set
maps maps maps maps maps
htps://wwhtps://wwhtps://wwhtps://wwhtps://ww
htps://w htps://w htps://w htps://w htps://w
No of waysNo of waysNo of waysNo of waysNo of ways
OOPs OOPs OOPs OOPs OOPs

vector vector vector vector vector
set set set set set
maps maps maps maps maps
Data Structure
Array
TREES - Binary
Trees. Binary
Search Trees,
Heap
LINKED
LIST
LINKED
LIST
Ques
Program for array rotation - O(n) ans Space - O(1)
1. Reversal algorithm for array rotation
1. Given a sorted and rotated array, find if there is a pair with a given sum
1. k largest(or smallest) elements in an array | added Min Heap method
Rearrange array such that arr[i] >= arr[j] if i is even and arr[i]<=arr[j] if i is odd
and j < i
Status
SPOJ QUESTION CATEGORY
ACPC10A
CLONE
DIEHARD
EKO
PRIME1
RPLB
WACHOVIA DP
CLONE
DIEHARD
ABA12C
BUSYMAN
ELEVTRBL
PIGBANK
ALIEN
COINS
MAXSUMSQ
SUBSUMS
2. Word Count
3. Good Strategy
4. ALIEN2
5.
o Foot Ball Fever
f
7. Prime Generator
8. True Friends
9. Prime Path
10. Minimum Knight Moves
STATUS
I
Topics taught in Hyderabad
What is being taught ??

Time complexity ,
solving the given problems

Recursion problems
linked list - circular linked list

creating a linked list
finding a node in the list
deleting a node
inserting at any position
circular linked list
Hashing Function
Merge sort
Binary Search
Bussy Man
EKO
No of Stairs
Binary Search tree

creating BST
finding number in the tree
deleting the number
inserting the number in the tree
height of a binary tree
AVL Tree
Heaps
creating heap
finding minima
deleting minima
heap sorting

N queen problem
cutting the rod
what is next
Suduko
Buying apples
OOPs
vector
set
maps
OOPs
vector
set
maps
DateWiseRivisionHyd
DATE
Page 245
DateWiseRivisionHyd
Rivision :
1) Graph :
BFS : Roten Orange , PPATH
DFS
Kruskal
Dektra
2) Backtracking :
1) RateMaze
2) Tower of Hanio
3) Depth of BST
4)N queen
5) BST to DLL
6) Inorder and Preorder to BST
7) SODOKU
8) Geeks SET 5 Coloring Problems
9) Remove invalid parenthesis
10) PRIME PATH
5th July : DP
1) LCSubtring
2) LCSubsequence
3) LIS geeks
4) Coin1
6th July : Greedy: Easy Problems will be ask not very tough
1) LCSubsequence : Printing All DP
2) Busy Man
3) Candy man
4) SRM 706 : TopCoder DP
5) Coin2, Coin3
6) Blue Beries.
7) Total Number of ways of chnaking coin in Coin change Problem.
11 July :
1) bst to Dll
2) Backtracking :
3) Pair in a sorted array with given sum.
a) Keeping 2 pointers at starting(move right if sum is less) and end(move left if sum is greater)
b) Given BST to array to dll.
c) using lower_bound.
4) July long 2 qestions [45min] : chodechef
5) Top coder : 4/5 question
6) Glories of lower_bound and upper_bound
Page 246
DateWiseRivisionHyd
12 July :
1. Heap Sorting (Function using same array)
2) Heapify in O(n)[not logn using insert] from IIT D lecture
3) Codechef July Q1 and Q2
4) Facebook : Q1, Q2, Q3
5) Pair with sum = k using map
a) is possible or not
b) Print all pairs with indecices.
Page 247
DateWiseRivisionHyd
Page 248
DateWiseReport2KrsnaALD
Month Day Prabhat Pr Geeks Murlee Pr DBMS OS OOPS HTML

July 31
Aug 1
Page 249
DateWiseReport2KrsnaALD
CSS SQL CodeChef Topcoder HackerR/E SPOJ
Page 250

Linked List II: Topic Name

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Linked List II: Topic Name

Uploaded by

Copyright:

Available Formats

TOPIC NAME

Print elements of link list

Revese a link list

Compare two linked lists

Binary Search tree

1. Rod cutting Problem -

12. Print all longest common Subsequence

13. Print lexicographically smallest Longest common Subsequence

Inversion count -O(NlogN)

creating adjency list

Checking wheter graph is bipartite or not ?

Checking wheter graph is connected or not ?

Checking 2 edge connectivity ?

Backtracking and Dynamic Programming

OOPs OOPs OOPs OOOPs OOPs

OOPs OOPs OOPs OOOPs OOPs

OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs

OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs OOPs

OOPs OOPs OOPs OOPs OOPs

OOPs OOPs OOPs OOPs OOPs

1. k largest(or smallest) elements in an array | added Min Heap method

What is being taught ??

solving the given problems

linked list - circular linked list

Binary Search tree

Backtracking and Dynamic Programming

Month Day Prabhat Pr Geeks Murlee Pr DBMS OS OOPS HTML

CSS SQL CodeChef Topcoder HackerR/E SPOJ

You might also like