//
you're reading...
Các chuyên đề bồi dưỡng học sinh giỏi, Đề huấn luyện bằng tiếng Anh

List of problems sorted in increasing order of difficulty

[UVA Toolkit] [I Deserve]


Dynamic Programming


  1. Fibonacci Number
  2. Maximum subarray sum
  3. Word Break Problem
  4. Total number of possible Binary Search Trees with ‘n’ keys
  5. Subset Sum Problem
  6. Shortest Palindrome
  7. Palindrome Min Cut
  8. Minimum number of trials to reach from source word to destination word
  9. Minimum number of coins to make change
  10. Find minimum cost path in a matrix
  11. Maximum size square sub-matrix with all 1s
  12. Longest Palindromic Substring
  13. Longest Palindromic Subsequence
  14. Find the length of longest increasing subsequence in an array
  15. Longest Increasing Subsequence O(n logn)
  16. Longest Common Substring
  17. Longest Common Subsequence
  18. Find the length of longest bitonic subsequence in an array
  19. To print maximum number of As using given four keys.
  20. Gold Mine Problem
  21. Find minimum edit distance between given two strings
  22. 0-1 Knapsack Problem
  23. Distinct binary strings of length n with no consecutive 1s
  24. Count all possible decodings of a given digit sequence
  25. Find total number of ways to make change using given set of coins
  26. Set Partition Problem | Dynamic Programming

Graph


  1. Breadth first search in a graph
  2. Number of clusters of 1s OR Number of Islands
  3. Topological Sorting of a Directed Acyclic Graph.
  4. Minimum number of trials to reach from source word to destination word
  5. Friend Circles Problem – Graph Theory
  6. Dijkstra’s Shortest Path algorithm
  7. Bellman-Ford Algorithm

Trees


  1. Pre-order Traversal of a Binary Tree
  2. Post-order Traversal of a Binary Tree
  3. In-order Traversal of a Binary Tree
  4. Binary Tree Level Order Traversal
  5. Print right view of a binary tree
  6. Print all nodes of a binary tree that do not have sibling
  7. Print all Root to Leaf paths of a Binary Tree
  8. Minimum Depth of a Binary Tree
  9. Print left view of a binary tree
  10. Find sum of all left leaves of a binary tree
  11. Find depth of deepest odd level leaf node
  12. Check whether a binary tree is a full binary tree or not
  13. Check whether a binary tree is complete or not
  14. Check if two nodes are cousins in a Binary tree
  15. Check if two binary trees are identical
  16. Check if all internal nodes of BST have only one child without building tree
  17. Convert the given n-ary tree to its mirror image
  18. Convert a binary tree to its mirror tree
  19. Print top view of a binary tree
  20. Print top view of a binary tree using level order traversal
  21. Print bottom view of a binary tree
  22. Print bottom view of a binary tree using level order traversal
  23. Remove the nodes of binary search tree which are outside the given range
  24. Remove all nodes which lie on path having sum less than k
  25. Remove all the half nodes from a given binary tree
  26. Print binary tree in vertical order
  27. Populate right neighbors for all nodes in a binary tree
  28. Lowest Common Ancestor of two nodes in a Binary Search Tree
  29. Iterative Pre-order Traversal of a Binary Tree
  30. In-order Successor of a Node in a Binary Tree
  31. Recover a Binary Search Tree if positions of two nodes are swapped.
  32. Find floor and ceiling of an element from given dataset using binary search tree
  33. Diagonal Sum of a Binary Tree.
  34. Create a balanced Binary Search Tree from a sorted array
  35. Convert a sorted Doubly Linked List to Balanced Binary Search Tree
  36. Convert a binary tree to doubly linked list
  37. Check if a binary tree is balanced or not
  38. Check if a binary tree is a binary search tree
  39. Check if two binary search trees are identical given their array representations | Set 2
  40. Check if two binary search trees are identical given their array representations
  41. Check if a binary tree is sub-tree of another binary tree in time O(n)
  42. Check if a binary tree is sub-tree of another binary tree in space O(1)
  43. Binary Search tree | Insertion and Search
  44. Binary Search tree | Deletion
  45. Check if a given binary tree is symmetric tree or not
  46. Check if the given n-ary tree is symmetric tree or not
  47. Spiral Level Order Traversal of a Binary Tree | Set 1
  48. Spiral Level Order Traversal of a Binary Tree | Set 2
  49. Find maximum element from each sub-array of size ‘k’| Set 1
  50. Total number of possible Binary Search Trees with ‘n’ keys
  51. Find the size of largest BST in a binary tree
  52. Lowest Common Ancestor of 2 nodes in a Binary Tree
  53. Find height of the binary tree from its parent array representation
  54. Convert binary tree to binary search tree
  55. Construct the binary tree from its parent array representation
  56. Construct binary tree from inorder and preorder traversals
  57. Construct binary tree from inorder and postorder traversals
  58. AVL tree | Basics
  59. AVL tree | Insertion
  60. AVL tree | Deletion
  61. Trie Data Structure | Insert and search
  62. Trie Data Structure | Delete
  63. Pattern matching using Trie
  64. Longest Prefix Matching using Trie
  65. Given a sequence of words, group together all anagrams and print them.
  66. Serialize and Deserialize a binary search tree
  67. Serialize and Deserialize a binary search tree using post order traversal

Arrays


  1. Sorting Algorithm – Selection Sort
  2. Sorting Algorithm – Insertion Sort
  3. Sorting Algorithm – Bubble Sort
  4. Sorting Algorithm – Comb Sort
  5. Pancake Sorting
  6. Merge Sort
  7. Sorting Algorithm – Heap Sort
  8. Rotate an Array
  9. Fibonacci Number
  10. Merge two sorted arrays without using extra space
  11. Maximum subarray sum
  12. Maximum average subarray of size k
  13. Longest Substring with non-Repeating Characters
  14. Leaders in an array
  15. Find the missing number in the duplicate array
  16. Find Minimum Length Sub Array With Sum K
  17. Binary Search in a Sorted Array
  18. Search a sorted matrix
  19. Re-arrange elements in an array to put positive and negative elements in alternate order
  20. Number of clusters of 1s OR Number of Islands
  21. Find the next greater number using same digits
  22. Next greater element in an array
  23. First non-repeating character in a string
  24. Find the ‘n’th most frequent number in array
  25. Find the missing number in the increasing sequence
  26. Find duplicates in an integer array
  27. Find common elements in ‘n’ sorted arrays
  28. Find a Peak Element in an array
  29. Distribute Chocolates Problem
  30. Count frequencies of array elements in range 1 to n
  31. Find all permutations of a String
  32. Find pivot in a sorted rotated array
  33. Find an element in a sorted rotated array
  34. Find element in sorted rotated array without finding pivot
  35. Buy and sell stocks | Part 2
  36. Buy and sell stocks | Part 1
  37. Find index of 0 to replace to get longest continuous sequence of 1s
  38. O(n) time approach to find index of 0 to replace to get longest continuous sequence of 1s
  39. Find maximum element from each sub-array of size ‘k’| Set 1
  40. Find maximum element from each sub-array of size ‘k’| Set 2
  41. Trapping Rain Water between Towers
  42. The Skyline Problem
  43. Print a Matrix Diagonally
  44. Minimum number of coins to make change
  45. Find minimum cost path in a matrix
  46. Find maximum value of sum of index element products(i*array[i]) with only rotations allowed on a given array
  47. Maximum size square sub-matrix with all 1s
  48. Longest Subset With Consecutive Numbers
  49. Find the length of longest increasing subsequence in an array
  50. Longest Increasing Subsequence O(n logn)
  51. Find the length of longest bitonic subsequence in an array
  52. Given an array with all distinct elements, find the length of the longest sub-array which has elements(not in any particular order) that could form a contiguous sequence
  53. Find an integer array corresponding to the string specifying increase-decrease transitions
  54. Gold Mine Problem
  55. Find the Element That Appears Once in an Array
  56. Find median of two sorted arrays
  57. Find Majority Element in an Array
  58. 0-1 Knapsack Problem
  59. Count all possible decodings of a given digit sequence
  60. Find total number of ways to make change using given set of coins
  61. Find increasing sub-sequence of length three having maximum product
  62. Find increasing sub-sequence of length three having maximum product | Optimized approach
  63. Set Partition Problem | Recursion
  64. Set Partition Problem | Dynamic Programming

Strings


  1. Reverse words in a string
  2. Remove spaces from a given string
  3. Longest Substring with non-Repeating Characters
  4. Check balanced parentheses in a string
  5. Postfix Expression Evaluation
  6. Group all anagrams together from a given array of strings | Set 1
  7. First non-repeating character in a string
  8. Find all permutations of a String
  9. Word Break Problem
  10. Subset Sum Problem
  11. Shortest Palindrome
  12. To print maximum number of As using four keys of special keyboard.
  13. Palindrome Min Cut
  14. Minimum number of trials to reach from source word to destination word
  15. Longest Palindromic Substring
  16. Manacher’s Algorithm
  17. Longest Palindromic Subsequence
  18. Longest Common Substring
  19. Longest Common Subsequence
  20. Finding 10 letter repeated DNA sequences.
  21. Find minimum edit distance between given two strings
  22. Distinct binary strings of length n with no consecutive 1s
  23. Anagram Pattern Search

Linked List


  1. Merge two sorted linked lists
  2. Reverse a Linked List – Recursive
  3. Reverse a Linked List – Iterative
  4. Reverse every alternate k nodes of a Linked List
  5. Find nth Node from the end of a Linked List
  6. Sum of Two Linked Lists using Stacks
  7. LRU Cache Implementation
  8. Detect a loop in a linked list and find the node where the loop starts.
  9. Convert a sorted Doubly Linked List to Balanced Binary Search Tree
  10. Convert a binary tree to doubly linked list
  11. Sum of Two Linked Lists using Recursion | Set 1
  12. Sum of Two Linked Lists using Recursion | Set 2
  13. Find intersection of two Linked Lists
  14. Find intersection of two Linked Lists – O(m + n) Time Complexity and O(1) Space Complexity
  15. Find maximum element from each sub-array of size ‘k’| Set 2

About pascalteacher

Trang thông tin Toán học và Tin học

Thảo luận

Chưa có phản hồi.

Gửi phản hồi

Mời bạn điền thông tin vào ô dưới đây hoặc kích vào một biểu tượng để đăng nhập:

WordPress.com Logo

Bạn đang bình luận bằng tài khoản WordPress.com Log Out / Thay đổi )

Twitter picture

Bạn đang bình luận bằng tài khoản Twitter Log Out / Thay đổi )

Facebook photo

Bạn đang bình luận bằng tài khoản Facebook Log Out / Thay đổi )

Google+ photo

Bạn đang bình luận bằng tài khoản Google+ Log Out / Thay đổi )

Connecting to %s

Các tác giả

Danh mục

Tháng Mười Hai 2016
M T W T F S S
« Nov   Jan »
 1234
567891011
12131415161718
19202122232425
262728293031  

NCT Computer

Flickr Photos

Livin' on an Island

A better future...

The Last Hurrah

More Photos

Thống kê

  • 95,498 lượt xem

pascalteacher.nct@gmail.com


Trang huấn luyện học sinh giỏi Tin học

%d bloggers like this: