Project 2

A set of 20 problems to solve in an optimised way with the given restrictions of time and space complexity

I have attached my eclipse code zip file for all these programs.

Arrays and Strings

• SUBARRAY WITH GIVEN SUM
• PERMUTATIONS OF A GIVEN STRING

Trees

• DETERMINE IF TWO TREES ARE IDENTICAL
• COUNT LEAVES IN BINARY TREE
• LOWEST COMMON ANCESTOR IN A BINARY TREE

Sorting

• LINKED LIST OF 0S, 1S AND 2S, SORT IT.

Searching

• FIND FIRST REPEATED CHARACTER
• CHECK IF TWO ARRAYS ARE EQUAL OR NOT

Hashing

• RELATIVE SORTING
  

Graph

• SHORTEST SOURCE TO DESTINATION PATH
• CIRCLE OF STRINGS
  

Stacks queues

• FIRST NON-REPEATING CHARACTER IN A STREAM
  

Heap

• REARRANGE CHARACTERS
  

Dynamic programming

• Maximum sum of increasing subsequence's
• COUNT NUMBER OF HOPS

Greedy

• MINIMISE THE SUM OF PRODUCT
  
• LARGEST NUMBER POSSIBLE
  

Divide and conquer

• Find the element that appears once in sorted array

Two pointer & sliding window

• LONGEST DISTINCT CHARACTERS IN STRING

Bit Manipulation

• POWER OF 2