SYMBOL INDEX (262 symbols across 42 files)

FILE: src/main/java/com/bruis/algorithminjava/algorithm/huawei/Question01.java
  class Question01 (line 20) | public class Question01 {
    method main (line 26) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/ContainsDuplicate_217.java
  class ContainsDuplicate_217 (line 11) | public class ContainsDuplicate_217 {
    method main (line 13) | public static void main(String[] args) {
    method containsDuplicate (line 18) | public static boolean containsDuplicate(int[] nums) {
    method setSolution (line 34) | public static boolean setSolution(int[] nums) {
    method sortSolution (line 53) | public static boolean sortSolution(int[] nums) {
    method bucketMapSolution (line 72) | public static boolean bucketMapSolution(int[] nums) {
    method violentSolution (line 95) | public static boolean violentSolution(int[] nums) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/LongestPalindromicSubstring_5.java
  class LongestPalindromicSubstring_5 (line 8) | public class LongestPalindromicSubstring_5 {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/MaximumSubarray_53.java
  class MaximumSubarray_53 (line 8) | public class MaximumSubarray_53 {
    method main (line 10) | public static void main(String[] args) {
    method violentSolution (line 25) | public static int violentSolution(int[] nums) {
    method maxSubArray (line 46) | public static int maxSubArray(int[] nums) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/TwoSum.java
  class TwoSum (line 11) | public class TwoSum {
    method twoSum (line 12) | public int[] twoSum(int[] nums, int target) {
    method optimizeSolution02 (line 26) | private int[] optimizeSolution02(int[] nums, int target) {
    method optimizeSolution01 (line 47) | private int[] optimizeSolution01(int[] nums, int target) {
    method forceSolution (line 77) | private int[] forceSolution(int[] nums, int target) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/TwoSumII.java
  class TwoSumII (line 8) | public class TwoSumII {
    method twoSum (line 9) | public int[] twoSum(int[] numbers, int target) {
    method twoPointer (line 21) | private int[] twoPointer(int[] numbers, int target) {
    method forceSolution (line 48) | private int[] forceSolution(int[] numbers, int target) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/IsPalindrome.java
  class IsPalindrome (line 14) | public class IsPalindrome {
    method isPalindrome (line 15) | public boolean isPalindrome(String str) {
    method main (line 36) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/MaximumGap.java
  class MaximumGap (line 12) | public class MaximumGap {
    method maximumGapOptimize2 (line 21) | public int maximumGapOptimize2(int[] nums) {
    method maximumGapOptimize (line 75) | public int maximumGapOptimize(int[] nums) {
    method maximumGap (line 109) | public int maximumGap(int[] nums) {
    method quickSort (line 125) | private void quickSort(int[] nums) {
    method quickSort3ways (line 130) | private void quickSort3ways(int[] nums, int left, int right) {
    method max (line 154) | private int max(int i, int j) {
    method swap (line 158) | private void swap(int[] nums, int i, int j) {
    method main (line 164) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/MaximumProductSubarray.java
  class MaximumProductSubarray (line 10) | public class MaximumProductSubarray {
    method maxProduct (line 21) | public int maxProduct(int[] nums) {
    method main (line 63) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/ReversePairs.java
  class ReversePairs (line 12) | public class ReversePairs {
    method reversePairs2 (line 22) | public int reversePairs2(int[] nums) {
    method reversePairs (line 46) | public int reversePairs(int[] nums) {
    method getReversePairs (line 54) | private int getReversePairs(int[] nums) {
    method getReversePairs (line 59) | private int getReversePairs(int[] nums, int left, int right) {
    method reversePairs (line 69) | private int reversePairs(int[] nums, int left, int mid, int right) {
    method reversePairs3 (line 103) | public int reversePairs3(int[] nums) {
    method mergeCount (line 114) | private int mergeCount(int[] nums, int[] temp, int start, int end) {
    method reversePairs4 (line 152) | public int reversePairs4(int[] nums) {
    method mergeCount2 (line 162) | private int mergeCount2(int[] nums, int[] temp, int start, int end) {
    method main (line 171) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/ReverseVowels.java
  class ReverseVowels (line 13) | public class ReverseVowels {
    method reverseVowels (line 15) | public String reverseVowels(String s) {
    method isVowel (line 48) | private boolean isVowel(char ch) {
    method swap (line 53) | private void swap(char[] arr, int i, int j) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/SortColors.java
  class SortColors (line 11) | public class SortColors {
    method sortColors (line 13) | public void sortColors(int[] nums) {
    method sort (line 20) | private void sort(int[] nums, int left, int right) {
    method swap (line 45) | private void swap(int[] nums, int i, int j) {
    method main (line 51) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/SubarraySumEqualsK.java
  class SubarraySumEqualsK (line 15) | public class SubarraySumEqualsK {
    method subarraySum01 (line 22) | public int subarraySum01(int[] nums, int k) {
    method subarraySum02 (line 50) | public int subarraySum02(int[] nums, int k) {
    method subarraySum03 (line 82) | public int subarraySum03(int[] nums, int k) {
    method subarraySum04 (line 117) | public int subarraySum04(int[] nums, int k) {
    method main (line 133) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/ThreeSum.java
  class ThreeSum (line 14) | public class ThreeSum {
    method main (line 16) | public static void main(String[] args) {
    method threeSum (line 34) | public static List<List<Integer>> threeSum(int[] nums) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/TopKFrequentElements.java
  class TopKFrequentElements (line 13) | public class TopKFrequentElements {
    method topKFrequent (line 20) | public int[] topKFrequent(int[] nums, int k) {
    method main (line 62) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/TwoSum.java
  class TwoSum (line 12) | public class TwoSum {
    method twoSum (line 25) | public static int[] twoSum(int[] nums, int target) {
    method main (line 82) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/leetcode/array/TwoSumII.java
  class TwoSumII (line 12) | public class TwoSumII {
    method twoSum (line 14) | public int[] twoSum(int[] numbers, int target) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/BinarySearch.java
  class BinarySearch (line 9) | public class BinarySearch {
    method binarySearch (line 11) | public static int binarySearch(int[] arr, int n, int target) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/BubbleSort.java
  class BubbleSort (line 6) | public class BubbleSort {
    method sort (line 9) | public static void sort(int[] arr) {
    method sort2 (line 25) | public static void sort2(int[] arr) {
    method sort3 (line 50) | public static void sort3(int[] arr) {
    method swap (line 73) | public static void swap(int[] arr, int i, int j) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/BucketSort.java
  class BucketSort (line 12) | public class BucketSort {
    method BucketSort (line 31) | public BucketSort(int range) {
    method doSort (line 34) | public int[] doSort(int[] arr) {
    method main (line 52) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/Heap.java
  class Heap (line 10) | public class Heap {
    method Heap (line 37) | public Heap(int capacity) {
    method Heap (line 43) | public Heap(int[] data, int capacity) {
    method insert (line 52) | public void insert(int value) {
    method extractMax (line 64) | public int extractMax() {
    method heapify (line 77) | public void heapify(int k) {
    method size (line 84) | public int size() {
    method isEmpty (line 88) | public boolean isEmpty() {
    method shiftUp (line 96) | private void shiftUp(int k) {
    method shiftDown (line 107) | private void shiftDown(int k) {
    method swap (line 117) | private void swap(int a, int b) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/HeapSort01.java
  class HeapSort01 (line 11) | public class HeapSort01 {
    method heapify (line 17) | private static void heapify(int[] arr) {
    method extractMax (line 27) | private static int extractMax(int[] arr) {
    method shiftDown (line 41) | private static void shiftDown(int k, int n, int[] arr) {
    method shiftUp (line 60) | private void shiftUp(int k, int[] arr) {
    method swap (line 67) | private static void swap(int[] arr, int i, int j) {
    method sort (line 73) | public static int[] sort(int[] arr) {
    method main (line 83) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/HeapSort02.java
  class HeapSort02 (line 11) | public class HeapSort02 {
    method sort (line 13) | public static void sort(int[] arr) {
    method siftDown (line 36) | public static void siftDown(int[] arr, int n, int k) {
    method siftDown2 (line 58) | private static void siftDown2(int[] arr, int n, int k) {
    method swap (line 79) | public static void swap(int[] arr, int i, int j) {
    method main (line 85) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/InsertionSort.java
  class InsertionSort (line 6) | public class InsertionSort {
    method sort (line 8) | public static void sort(int[] arr) {
    method sort2 (line 23) | public static void sort2(int[] arr) {
    method sort3 (line 34) | public static void sort3(int[] arr) {
    method swap (line 49) | public static void swap(int[] arr, int i, int j) {
    method main (line 55) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/MergeSort.java
  class MergeSort (line 11) | public class MergeSort {
    method merge (line 22) | public static void merge(int[] arr, int left, int mid, int right) {
    method sort (line 56) | public static void sort(int[] arr, int left, int right) {
    method sort (line 66) | public static void sort(int[] arr) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/MergeSortAdvanced01.java
  class MergeSortAdvanced01 (line 11) | public class MergeSortAdvanced01 {
    method merge (line 13) | public static void merge(int[] arr, int left, int mid, int right) {
    method sort (line 35) | public static void sort(int[] arr, int left, int right) {
    method sort (line 53) | public static void sort(int[] arr) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/MergeSortBU.java
  class MergeSortBU (line 11) | public class MergeSortBU {
    method merge (line 12) | private static void merge(int[] arr, int left, int mid, int right) {
    method sort (line 35) | public static void sort(int[] arr) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/QuickSort.java
  class QuickSort (line 9) | public class QuickSort {
    method partition (line 20) | private static int partition(int[] arr, int left, int right) {
    method sort (line 36) | private static void sort(int[] arr, int left, int right) {
    method sort (line 45) | public static void sort(int[] arr) {
    method swap (line 50) | private static void swap(int[] arr, int i, int j) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/QuickSort2.java
  class QuickSort2 (line 10) | public class QuickSort2 {
    method partition (line 21) | private static int partition(int[] arr, int left, int right) {
    method sort (line 42) | private static void sort(int[] arr, int left, int right) {
    method sort (line 55) | public static void sort(int[] arr) {
    method swap (line 60) | private static void swap(int[] arr, int i, int j) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/QuickSort2Ways.java
  class QuickSort2Ways (line 9) | public class QuickSort2Ways {
    method partition (line 11) | private static int partition(int[] arr, int left, int right) {
    method sort (line 43) | private static void sort(int[] arr, int left, int right) {
    method sort (line 54) | public static void sort(int[] arr) {
    method swap (line 59) | public static void swap(int[] arr, int i, int j) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/QuickSort3Ways.java
  class QuickSort3Ways (line 9) | public class QuickSort3Ways {
    method sort (line 11) | private static void sort(int[] arr, int left, int right) {
    method sort (line 48) | public static void sort(int[] arr) {
    method swap (line 53) | private static void swap(int[] arr, int i, int j) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/sort/ShellSort.java
  class ShellSort (line 9) | public class ShellSort {
    method sort (line 10) | public static void sort(int[] arr) {

FILE: src/main/java/com/bruis/algorithminjava/algorithm/stack/MinStack.java
  class MinStack (line 14) | public class MinStack {
    method MinStack (line 26) | public MinStack() {
    method push (line 31) | public void push(int x) {
    method pop (line 44) | public void pop() {
    method top (line 55) | public int top() {
    method getMin (line 59) | public int getMin() {

FILE: src/main/java/com/bruis/algorithminjava/datastructures/array/MyArray.java
  class MyArray (line 6) | public class MyArray<E> {
    method MyArray (line 13) | public MyArray(int capacity) {
    method MyArray (line 18) | public MyArray() {
    method getCapacity (line 23) | public int getCapacity() {
    method getSize (line 28) | public int getSize() {
    method isEmpty (line 32) | public boolean isEmpty() {
    method insert (line 37) | public void insert(int index, E value) {
    method delete (line 55) | public E delete(int index) {
    method update (line 70) | public void update(int index, E value) {
    method addLast (line 78) | public void addLast(E e) {
    method addFirst (line 83) | public void addFirst(E e) {
    method get (line 87) | public E get(int index) {
    method getLast (line 95) | public E getLast() {
    method getFirst (line 100) | public E getFirst() {
    method contains (line 104) | public boolean contains(E e) {
    method find (line 114) | public int find(E e) {
    method remove (line 123) | public E remove(int index) {
    method removeFirst (line 140) | public E removeFirst(){
    method removeLast (line 145) | public E removeLast(){
    method removeElement (line 150) | public void removeElement(E e){
    method resize (line 157) | public void resize(int newSize) {
    method printData (line 165) | private void printData(E[] data, int size) {
    method main (line 177) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/datastructures/heap/IndexMapHeap.java
  class IndexMapHeap (line 12) | public class IndexMapHeap {
    method IndexMapHeap (line 30) | public IndexMapHeap(int capacity) {
    method isEmpty (line 39) | public boolean isEmpty() {
    method size (line 43) | public int size() {
    method insert (line 53) | public void insert(int i, int item) {
    method getItem (line 68) | public int getItem(int i) {
    method getMaxIndex (line 79) | public int getMaxIndex() {
    method extractMax (line 91) | public int extractMax() {
    method extractMaxIndex (line 107) | public int extractMaxIndex() {
    method shiftUp (line 124) | private void shiftUp(int k) {
    method shiftDown (line 141) | private void shiftDown(int k) {
    method change (line 166) | public void change(int i, int item) {
    method swap (line 183) | private void swap(int[] arr, int i, int k) {
    method testIndexes (line 191) | public boolean testIndexes() {
    method testSort (line 210) | public void testSort(int[] arr) {
    method main (line 218) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/datastructures/heap/MaxHeap.java
  class MaxHeap (line 8) | public class MaxHeap {
    method MaxHeap (line 25) | public MaxHeap(int capacity) {
    method MaxHeap (line 30) | public MaxHeap() {
    method MaxHeap (line 38) | public MaxHeap(int[] data) {
    method size (line 60) | public int size() {
    method isEmpty (line 68) | public boolean isEmpty() {
    method parent (line 77) | private int parent(int index) {
    method leftChild (line 89) | private int leftChild(int index) {
    method rightChild (line 98) | private int rightChild(int index) {
    method add (line 107) | public void add(int i) {
    method siftUp (line 118) | private void siftUp(int k) {
    method findMax (line 134) | public int findMax() {
    method extractMax (line 145) | public int extractMax() {
    method siftDown (line 157) | private void siftDown(int k) {
    method swap (line 180) | private void swap(int[] arr, int i, int j) {
    method main (line 186) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/datastructures/queue/MyLoopQueue.java
  class MyLoopQueue (line 6) | public class MyLoopQueue<E> implements Queue<E> {
    method MyLoopQueue (line 12) | public MyLoopQueue(int capacity) {
    method MyLoopQueue (line 19) | public MyLoopQueue() {
    method getSize (line 23) | @Override
    method isEmpty (line 28) | @Override
    method getCapacity (line 33) | public int getCapacity() {
    method enqueue (line 45) | @Override
    method dequeue (line 55) | @Override
    method getFront (line 70) | @Override
    method resize (line 78) | private void resize(int newCapacity) {
    method toString (line 88) | @Override
    method main (line 103) | public static void main(String[] args){

FILE: src/main/java/com/bruis/algorithminjava/datastructures/queue/MyQueue.java
  class MyQueue (line 8) | public class MyQueue<E> implements Queue<E> {
    method MyQueue (line 12) | public MyQueue(int capacity) {
    method MyQueue (line 16) | public MyQueue() {
    method getSize (line 20) | @Override
    method isEmpty (line 25) | @Override
    method enqueue (line 36) | @Override
    method dequeue (line 46) | @Override
    method getFront (line 51) | @Override
    method toString (line 56) | @Override
    method main (line 70) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/datastructures/queue/Queue.java
  type Queue (line 6) | public interface Queue<E> {
    method getSize (line 7) | int getSize();
    method isEmpty (line 8) | boolean isEmpty();
    method enqueue (line 10) | void enqueue(E e);
    method dequeue (line 12) | E dequeue();
    method getFront (line 14) | E getFront();

FILE: src/main/java/com/bruis/algorithminjava/datastructures/stack/MyStack.java
  class MyStack (line 9) | public class MyStack<E> implements Stack<E> {
    method MyStack (line 13) | public MyStack(int capacity){
    method MyStack (line 17) | public MyStack(){
    method getSize (line 22) | @Override
    method isEmpty (line 27) | @Override
    method push (line 37) | @Override
    method pop (line 48) | @Override
    method peek (line 53) | @Override
    method toString (line 58) | @Override
    method main (line 73) | public static void main(String[] args) {

FILE: src/main/java/com/bruis/algorithminjava/datastructures/stack/Stack.java
  type Stack (line 6) | public interface Stack<E> {
    method getSize (line 7) | int getSize();
    method isEmpty (line 8) | boolean isEmpty();
    method push (line 9) | void push(E e);
    method pop (line 11) | E pop();
    method peek (line 12) | E peek();

FILE: src/main/java/com/bruis/algorithminjava/utils/SortTestHelper.java
  class SortTestHelper (line 8) | public class SortTestHelper {
    method SortTestHelper (line 12) | private SortTestHelper(){}
    method generateRandomArray (line 21) | public static Integer[] generateRandomArray(int n, int rangeL, int ran...
    method generateNearlyOrderedArray (line 43) | public static Integer[] generateNearlyOrderedArray(int n, int swapTimes){
    method printArray (line 65) | public static void printArray(Object[] arr) {
    method isSorted (line 81) | public static boolean isSorted(Comparable[] arr){
    method testSort (line 97) | public static void testSort(String sortClassName, Comparable[] arr){
    method testSort2 (line 130) | public static long testSort2(String sortClassName, Comparable[] arr){