The FANG Gambit

Solutions to some data structures and algorithms practical questions

1. Two sum

• Problem, constraints and test cases
• Brute force Solution
• optimized Solution

2. Container with most Water

• Problem, constraints and test cases
• Brute force solution
• optimized solution

3. Trapped Rain water

• Problem, constraints and test cases
• Brute force solution
• optimized solution

4. Validate sub-sequence

• Problem, constraints and test cases
• Brute force solution
• optimized solution

5. Sorted squared array

• Problem, constraints and test cases
• Brute force solution
• optimized solution

6. Backspace String compare

• Problem, constraints and test cases
• Brute force solution
• optimized solution;

7. Longest sub-string without repeating characters

• Problem, constraints and test cases
• Brute force solution
• optimized solution;

8. Palindrome

• Problem, constraints and test cases;
• Brute force/optimized solution;
• Almost palindrome question;

10. Smallest difference

• Problem, constraints and test cases;
• Brute force solution;
• optimized solution;

11. move element to the end

• Problem, constraints and test cases;
• Brute force solution;
• optimized solution;

12. monotonic array

• Problem, constraints and test cases;
• Brute force solution;
• optimized solution;

All the other Questions will have the same format, i.e

• a text file containing the problem description, sample test cases and constraints.
• A brute force file containing the solution to the problem in a brute force fashion/way of thinking.
• An optimized.js file containing optimized solution of the problem
• A optimized.ins.js which is either further optimization of the current optimization or a decent version of the current optimization eg factored code, good practices e.t.c.