This repository just has few practice questions for DSA. It contains competitive programming questions & solutions.
Link to problem- https://www.hackerearth.com/practice/data-structures/arrays/multi-dimensional/practice-problems/algorithm/roy-and-symmetric-logos-1/
Link to problem- https://www.hackerearth.com/practice/data-structures/arrays/multi-dimensional/practice-problems/algorithm/saul-goodmans-problem-statement/description/
An anagram of a string is another string that contains same characters,
only the order of characters can be different.
For example, “abcd” and “dabc” are anagram of each other.
Other examples- 1. LISTEN <----> SILENT
2. TRIANGLE <----> INTEGRAL
The time complexity of the solution is O(n)
Link to problem- https://www.interviewbit.com/problems/add-one-to-number/
Given an integer array A of size N. You need to check that whether there exist a element which is strictly greater than all the elements on left of it and strictly smaller than all the elements on right of it.
If it exists return 1 else return 0.
NOTE:
- Do not consider the corner elements i.e A[0] and A[N-1] as the answer.