Each Project will have Reference Links which you can read to get a quick grasp on the topic and some Practice Questions,If you want more practice for each Topic .

Each Practice Question is slightly abstracted ,You need to make certain assumptions and write the best solution .Think for the best complexity algorithms .Remember also Space vs Time Tradeoff

Reference Links : (Right Click is disabled ,So Ctrl+C and Ctrl+V the links

• https://www.quora.com/What-are-the-some-tricky-c-programs
• https://www.udacity.com/course/viewer#!/c-ud923/l-3398018620/m-3417038572

Practice Questions :

• Find common elements in three sorted array.
• Multiply two matrices if possible else return null.
• Find first repeating number in an array of integers.
• Find first non-repeating number in an array of integers.
• Rearrange array in alteranating positive and negative numbers.
  • Input: 1,2,3,-4,-1,4
  • Output: -4,1,-1,2,3,4
• Given an array of positive and negative numbers. Find the subset who’s sum is max among all the subsets.
• Find the subset with sum equal to k.
• Find minimum value in a rotated sorted array.
• Given an array of of size n and a number k, find all elements that appear more than n/k times
  • Input: {3, 1, 2, 2, 1, 2, 3, 3} and k is 4
  • Output: 2,3
• Given an array of integers write a program that will determine if any two numbers add up to a specified number N. Do this without using hash tables