Challenge repo

This repo contains challenges and algorithms study. These challenges were given to me on an interview process. The algorithms I decided to study by myself.

1st Challenge

Given a text string, create a method to check if the opening and closing brackets are matching.

• Link: https://www.hackerrank.com/challenges/balanced-brackets/problem
• Signature: boolean validBracketSequence(String sequence)
• Implementation: First.java

2nd Challenge

Given two strings a and b, both consisting only of lowercase English letters, calculate how many strings equal to a can be constructed using only letters from the string b? Each letter can be used only once and in one string only.

• Link: https://wachino.github.io/codefights/codefights-arcade/codefights-arcade-thecore/59_stringsConstruction/README.html
• Signature: int stringsConstruction(String a, String b)
• Implementation: Second.java

3rd Challenge

• Link: Sorry. Didn't find first.
• Signature: double closestPointPair(int[][] p)
• Implementation: Third.java

Binary Search

Given an integer array and a value, implement a function that search for that value using a binary tree algorithm.

• Link: https://www.geeksforgeeks.org/binary-search/
• Signature: int find(int[] arr, int x)
• Implementation: BinarySearch.java

Bubble Sort

Given an unsorted array of integer, sort it using bubble sort method.

• Link: https://www.geeksforgeeks.org/bubble-sort/
• Signature: void sortArray(int[] arr)
• Implementation: BubbleSort.java

Quick Sort

Given an unsorted array of integers, sort it using quick sort method.

• Link: https://www.geeksforgeeks.org/quick-sort/
• Signature: here...
• Implementation: QuickSort.java