Skip to content

Instantly share code, notes, and snippets.

@snowcrumble

snowcrumble/Interview Topics.md

Forked from lawloretienne/Interview Topics.md
Created February 15, 2019 06:23
Download ZIP

Revisions

  1. @lawloretienne lawloretienne revised this gist Apr 4, 2017. 1 changed file with 94 additions and 94 deletions.
    188 changes: 94 additions & 94 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -8,105 +8,105 @@
    * [Red-Black Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#red-black-tree)
    * [AVL Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#avl-tree)
    * [Tries](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tries)
    * [Graphs](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#graphs)
    * [Stacks](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#stacks)
    * [Queues](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#queues)
    * [Vectors](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#vectors)
    * [ArrayLists](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#arraylists)
    * [Hash Tables](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#hash-tables)
    * [Adjacency Matrix](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adjacency-matrix)
    * [Adjacency List](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adjacency-list)
    * [Incidence List](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#incidence-list)
    * [Graphs](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#graphs)
    * [Stacks](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#stacks)
    * [Queues](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#queues)
    * [Vectors](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#vectors)
    * [ArrayLists](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#arraylists)
    * [Hash Tables](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#hash-tables)
    * [Adjacency Matrix](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adjacency-matrix)
    * [Adjacency List](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adjacency-list)
    * [Incidence List](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#incidence-list)
    * [Algorithms](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#algorithms)
    * [Breadth First Search](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#breadth-first-search)
    * [Depth First Search](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#depth-first-search)
    * [Binary Search](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-search)
    * [Merge Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#merge-sort)
    * [Quick Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#quick-sort)
    * [Selection Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#selection-sort)
    * [Bubble Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bubble-sort)
    * [Radix Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#radix-sort)
    * [Tree Searching](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-searching)
    * [Tree Insertion](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-insertion)
    * [Tree Deletion](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-deletion)
    * [Traveling Salesman Problem (TSP)](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#traveling-salesman-problem-tsp)
    * [Knapsack Problem](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#knapsack-problem)
    * [Dijkstra's Algorithm](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dijkstras-algorithm)
    * [A\* Algorithm](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#a-algorithm)
    * [Breadth First Search](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#breadth-first-search)
    * [Depth First Search](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#depth-first-search)
    * [Binary Search](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-search)
    * [Merge Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#merge-sort)
    * [Quick Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#quick-sort)
    * [Selection Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#selection-sort)
    * [Bubble Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bubble-sort)
    * [Radix Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#radix-sort)
    * [Tree Searching](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-searching)
    * [Tree Insertion](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-insertion)
    * [Tree Deletion](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-deletion)
    * [Traveling Salesman Problem (TSP)](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#traveling-salesman-problem-tsp)
    * [Knapsack Problem](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#knapsack-problem)
    * [Dijkstra's Algorithm](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dijkstras-algorithm)
    * [A\* Algorithm](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#a-algorithm)
    * [Concepts](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#concepts)
    * [Bit Manipulation](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bit-manipulation)
    * [Singleton Design Pattern](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#singleton-design-pattern)
    * [Factory Design Pattern](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#factory-design-pattern)
    * [Memory (Stack vs. Heap)](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#memory-stack-vs-heap)
    * [Garbage Collection](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#garbage-collection)
    * [Memory Leak](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#memory-leak)
    * [Recursion](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#recursion)
    * [Dynamic Programming](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dynamic-programming)
    * [Big-O Time](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#big-o-time)
    * [NP](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np)
    * [NP-complete](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np-complete)
    * [NP-hard](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np-hard)
    * [Process](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#process)
    * [Thread](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#thread)
    * [Monitor](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#monitor-lock)
    * [Deadlock](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#deadlock)
    * [Semaphore](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#semaphore)
    * [Context Switch](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#context-switch)
    * [Probability](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#probability)
    * [Bit Manipulation](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bit-manipulation)
    * [Singleton Design Pattern](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#singleton-design-pattern)
    * [Factory Design Pattern](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#factory-design-pattern)
    * [Memory (Stack vs. Heap)](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#memory-stack-vs-heap)
    * [Garbage Collection](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#garbage-collection)
    * [Memory Leak](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#memory-leak)
    * [Recursion](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#recursion)
    * [Dynamic Programming](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dynamic-programming)
    * [Big-O Time](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#big-o-time)
    * [NP](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np)
    * [NP-complete](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np-complete)
    * [NP-hard](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np-hard)
    * [Process](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#process)
    * [Thread](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#thread)
    * [Monitor](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#monitor-lock)
    * [Deadlock](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#deadlock)
    * [Semaphore](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#semaphore)
    * [Context Switch](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#context-switch)
    * [Probability](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#probability)
    * [Java](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#java)
    * [Inheritance](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#inheritance)
    * [Encapsulation](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#encapsulation)
    * [Abstraction](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#abstraction)
    * [Polymorphism](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#polymorphism)
    * [Interface](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#interface)
    * [Abstract Class](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#abstract-class)
    * [Overriding](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#overriding)
    * [Overloading](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#overloading)
    * [Access modifiers](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#access-modifiers)
    * [transient](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#transient)
    * [volatile](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#volatile)
    * [final vs. finally vs. finalize](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#final-vs-finally-vs-finalize)
    * [static](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#static)
    * [Strong Reference](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#strong-reference)
    * [Soft Reference](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#soft-reference)
    * [Weak Reference](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#weak-reference)
    * [Autoboxing](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#autoboxing)
    * [Unboxing](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#unboxing)
    * [Enumeration](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#enumeration)
    * [Iterator](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#iterator)
    * [Inheritance](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#inheritance)
    * [Encapsulation](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#encapsulation)
    * [Abstraction](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#abstraction)
    * [Polymorphism](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#polymorphism)
    * [Interface](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#interface)
    * [Abstract Class](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#abstract-class)
    * [Overriding](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#overriding)
    * [Overloading](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#overloading)
    * [Access modifiers](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#access-modifiers)
    * [transient](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#transient)
    * [volatile](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#volatile)
    * [final vs. finally vs. finalize](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#final-vs-finally-vs-finalize)
    * [static](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#static)
    * [Strong Reference](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#strong-reference)
    * [Soft Reference](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#soft-reference)
    * [Weak Reference](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#weak-reference)
    * [Autoboxing](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#autoboxing)
    * [Unboxing](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#unboxing)
    * [Enumeration](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#enumeration)
    * [Iterator](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#iterator)
    * [Android](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#android)
    * [Activity](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#activity)
    * [Fragment](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fragment)
    * [Service](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#service)
    * [BroadcastReceiver](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#broadcastreceiver)
    * [ContentProvider](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#contentprovider)
    * [Activity Lifecycle](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#activity-lifecycle)
    * [Intent](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#intent)
    * [Intent Filter](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#intent-filter)
    * [APK](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#apk)
    * [ADB](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adb)
    * [DDMS](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#ddms)
    * [AAPT](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#aapt)
    * [JVM](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jvm)
    * [JRE](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jre)
    * [JDK](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jdk)
    * [DVM](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dvm)
    * [ART](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#art)
    * [AIDL](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#aidl)
    * [NDK](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#ndk)
    * [ANR](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#anr)
    * [Shared Preferences](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#shared-preferences)
    * [Nine-patch](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#nine-patch)
    * [Support Library](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#support-library)
    * [Loader](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#loader)
    * [StrictMode](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#strictmode)
    * [Gradle](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#gradle)
    * [Android Build Process](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#android-build-process)
    * [Proguard](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#proguard)
    * [Multidex](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multidex)
    * [Activity](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#activity)
    * [Fragment](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fragment)
    * [Service](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#service)
    * [BroadcastReceiver](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#broadcastreceiver)
    * [ContentProvider](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#contentprovider)
    * [Activity Lifecycle](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#activity-lifecycle)
    * [Intent](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#intent)
    * [Intent Filter](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#intent-filter)
    * [APK](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#apk)
    * [ADB](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adb)
    * [DDMS](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#ddms)
    * [AAPT](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#aapt)
    * [JVM](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jvm)
    * [JRE](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jre)
    * [JDK](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jdk)
    * [DVM](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dvm)
    * [ART](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#art)
    * [AIDL](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#aidl)
    * [NDK](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#ndk)
    * [ANR](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#anr)
    * [Shared Preferences](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#shared-preferences)
    * [Nine-patch](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#nine-patch)
    * [Support Library](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#support-library)
    * [Loader](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#loader)
    * [StrictMode](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#strictmode)
    * [Gradle](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#gradle)
    * [Android Build Process](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#android-build-process)
    * [Proguard](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#proguard)
    * [Multidex](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multidex)
    * [Questions](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#questions)
    * [Most frequent K words in a document](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#most-frequent-k-words-in-a-document)
    * [Longest common subsequence](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#longest-common-subsequence)
    * [Most frequent K words in a document](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#most-frequent-k-words-in-a-document)
    * [Longest common subsequence](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#longest-common-subsequence)
    * [String compression](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#string-compression)
    * [Two Sum](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#two-sum)
    * [Sudoku Board Validator](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#sudoku-board-validator)
  2. @lawloretienne lawloretienne revised this gist Apr 4, 2017. 1 changed file with 7 additions and 7 deletions.
    14 changes: 7 additions & 7 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1,13 +1,13 @@
    ## Table Of Contents

    * [Data Structures](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#data-structures)
    * [Linked Lists](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linked-lists)
    * [Trees](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#trees)
    * [Binary Trees](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-trees)
    * [Binary Search Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-search-tree)
    * [Red-Black Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#red-black-tree)
    * [AVL Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#avl-tree)
    * [Tries](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tries)
    * [Linked Lists](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linked-lists)
    * [Trees](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#trees)
    * [Binary Trees](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-trees)
    * [Binary Search Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-search-tree)
    * [Red-Black Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#red-black-tree)
    * [AVL Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#avl-tree)
    * [Tries](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tries)
    * [Graphs](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#graphs)
    * [Stacks](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#stacks)
    * [Queues](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#queues)
  3. @lawloretienne lawloretienne revised this gist Apr 4, 2017. 1 changed file with 116 additions and 116 deletions.
    232 changes: 116 additions & 116 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1,122 +1,122 @@
    ## Table Of Contents

    * [Data Structures](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#data-structures)
    * [Linked Lists] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linked-lists)
    * [Trees] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#trees)
    * [Binary Trees] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-trees)
    * [Binary Search Tree] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-search-tree)
    * [Red-Black Tree] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#red-black-tree)
    * [AVL Tree] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#avl-tree)
    * [Tries] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tries)
    * [Graphs] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#graphs)
    * [Stacks] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#stacks)
    * [Queues] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#queues)
    * [Vectors] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#vectors)
    * [ArrayLists] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#arraylists)
    * [Hash Tables] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#hash-tables)
    * [Adjacency Matrix] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adjacency-matrix)
    * [Adjacency List] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adjacency-list)
    * [Incidence List] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#incidence-list)
    * [Algorithms] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#algorithms)
    * [Breadth First Search] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#breadth-first-search)
    * [Depth First Search] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#depth-first-search)
    * [Binary Search] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-search)
    * [Merge Sort] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#merge-sort)
    * [Quick Sort] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#quick-sort)
    * [Selection Sort] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#selection-sort)
    * [Bubble Sort] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bubble-sort)
    * [Radix Sort] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#radix-sort)
    * [Tree Searching] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-searching)
    * [Tree Insertion] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-insertion)
    * [Tree Deletion] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-deletion)
    * [Traveling Salesman Problem (TSP)] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#traveling-salesman-problem-tsp)
    * [Knapsack Problem] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#knapsack-problem)
    * [Dijkstra's Algorithm] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dijkstras-algorithm)
    * [A\* Algorithm] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#a-algorithm)
    * [Concepts] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#concepts)
    * [Bit Manipulation] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bit-manipulation)
    * [Singleton Design Pattern] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#singleton-design-pattern)
    * [Factory Design Pattern] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#factory-design-pattern)
    * [Memory (Stack vs. Heap)] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#memory-stack-vs-heap)
    * [Garbage Collection] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#garbage-collection)
    * [Memory Leak] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#memory-leak)
    * [Recursion] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#recursion)
    * [Dynamic Programming] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dynamic-programming)
    * [Big-O Time] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#big-o-time)
    * [NP] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np)
    * [NP-complete] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np-complete)
    * [NP-hard] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np-hard)
    * [Process] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#process)
    * [Thread] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#thread)
    * [Monitor] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#monitor-lock)
    * [Deadlock] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#deadlock)
    * [Semaphore] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#semaphore)
    * [Context Switch] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#context-switch)
    * [Probability] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#probability)
    * [Java] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#java)
    * [Inheritance] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#inheritance)
    * [Encapsulation] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#encapsulation)
    * [Abstraction] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#abstraction)
    * [Polymorphism] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#polymorphism)
    * [Interface] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#interface)
    * [Abstract Class] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#abstract-class)
    * [Overriding] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#overriding)
    * [Overloading] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#overloading)
    * [Access modifiers] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#access-modifiers)
    * [transient] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#transient)
    * [volatile] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#volatile)
    * [final vs. finally vs. finalize] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#final-vs-finally-vs-finalize)
    * [static] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#static)
    * [Strong Reference] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#strong-reference)
    * [Soft Reference] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#soft-reference)
    * [Weak Reference] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#weak-reference)
    * [Autoboxing] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#autoboxing)
    * [Unboxing] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#unboxing)
    * [Enumeration] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#enumeration)
    * [Iterator] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#iterator)
    * [Android] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#android)
    * [Activity] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#activity)
    * [Fragment] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fragment)
    * [Service] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#service)
    * [BroadcastReceiver] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#broadcastreceiver)
    * [ContentProvider] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#contentprovider)
    * [Activity Lifecycle] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#activity-lifecycle)
    * [Intent] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#intent)
    * [Intent Filter] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#intent-filter)
    * [APK] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#apk)
    * [ADB] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adb)
    * [DDMS] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#ddms)
    * [AAPT] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#aapt)
    * [JVM] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jvm)
    * [JRE] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jre)
    * [JDK] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jdk)
    * [DVM] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dvm)
    * [ART] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#art)
    * [AIDL] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#aidl)
    * [NDK] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#ndk)
    * [ANR] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#anr)
    * [Shared Preferences] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#shared-preferences)
    * [Nine-patch] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#nine-patch)
    * [Support Library] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#support-library)
    * [Loader] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#loader)
    * [StrictMode] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#strictmode)
    * [Gradle] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#gradle)
    * [Android Build Process] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#android-build-process)
    * [Proguard] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#proguard)
    * [Multidex] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multidex)
    * [Questions] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#questions)
    * [Most frequent K words in a document] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#most-frequent-k-words-in-a-document)
    * [Longest common subsequence] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#longest-common-subsequence)
    * [String compression] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#string-compression)
    * [Two Sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#two-sum)
    * [Sudoku Board Validator] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#sudoku-board-validator)
    * [Multiples of 3] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multiples-of-3)
    * [Fibonacci series] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fibonacci-series)
    * [BigInt sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bigint-sum)
    * [LRU Cache] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#lru-cache)
    * [LinkedList Cycle] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linkedlist-cycle)
    * [Reverse Stack] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#reverse-stack)
    * [Valid Expression] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#valid-expression)
    * [Linked Lists](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linked-lists)
    * [Trees](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#trees)
    * [Binary Trees](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-trees)
    * [Binary Search Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-search-tree)
    * [Red-Black Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#red-black-tree)
    * [AVL Tree](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#avl-tree)
    * [Tries](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tries)
    * [Graphs](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#graphs)
    * [Stacks](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#stacks)
    * [Queues](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#queues)
    * [Vectors](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#vectors)
    * [ArrayLists](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#arraylists)
    * [Hash Tables](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#hash-tables)
    * [Adjacency Matrix](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adjacency-matrix)
    * [Adjacency List](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adjacency-list)
    * [Incidence List](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#incidence-list)
    * [Algorithms](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#algorithms)
    * [Breadth First Search](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#breadth-first-search)
    * [Depth First Search](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#depth-first-search)
    * [Binary Search](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-search)
    * [Merge Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#merge-sort)
    * [Quick Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#quick-sort)
    * [Selection Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#selection-sort)
    * [Bubble Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bubble-sort)
    * [Radix Sort](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#radix-sort)
    * [Tree Searching](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-searching)
    * [Tree Insertion](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-insertion)
    * [Tree Deletion](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tree-deletion)
    * [Traveling Salesman Problem (TSP)](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#traveling-salesman-problem-tsp)
    * [Knapsack Problem](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#knapsack-problem)
    * [Dijkstra's Algorithm](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dijkstras-algorithm)
    * [A\* Algorithm](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#a-algorithm)
    * [Concepts](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#concepts)
    * [Bit Manipulation](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bit-manipulation)
    * [Singleton Design Pattern](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#singleton-design-pattern)
    * [Factory Design Pattern](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#factory-design-pattern)
    * [Memory (Stack vs. Heap)](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#memory-stack-vs-heap)
    * [Garbage Collection](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#garbage-collection)
    * [Memory Leak](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#memory-leak)
    * [Recursion](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#recursion)
    * [Dynamic Programming](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dynamic-programming)
    * [Big-O Time](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#big-o-time)
    * [NP](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np)
    * [NP-complete](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np-complete)
    * [NP-hard](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#np-hard)
    * [Process](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#process)
    * [Thread](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#thread)
    * [Monitor](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#monitor-lock)
    * [Deadlock](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#deadlock)
    * [Semaphore](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#semaphore)
    * [Context Switch](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#context-switch)
    * [Probability](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#probability)
    * [Java](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#java)
    * [Inheritance](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#inheritance)
    * [Encapsulation](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#encapsulation)
    * [Abstraction](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#abstraction)
    * [Polymorphism](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#polymorphism)
    * [Interface](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#interface)
    * [Abstract Class](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#abstract-class)
    * [Overriding](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#overriding)
    * [Overloading](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#overloading)
    * [Access modifiers](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#access-modifiers)
    * [transient](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#transient)
    * [volatile](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#volatile)
    * [final vs. finally vs. finalize](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#final-vs-finally-vs-finalize)
    * [static](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#static)
    * [Strong Reference](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#strong-reference)
    * [Soft Reference](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#soft-reference)
    * [Weak Reference](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#weak-reference)
    * [Autoboxing](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#autoboxing)
    * [Unboxing](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#unboxing)
    * [Enumeration](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#enumeration)
    * [Iterator](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#iterator)
    * [Android](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#android)
    * [Activity](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#activity)
    * [Fragment](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fragment)
    * [Service](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#service)
    * [BroadcastReceiver](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#broadcastreceiver)
    * [ContentProvider](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#contentprovider)
    * [Activity Lifecycle](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#activity-lifecycle)
    * [Intent](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#intent)
    * [Intent Filter](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#intent-filter)
    * [APK](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#apk)
    * [ADB](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#adb)
    * [DDMS](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#ddms)
    * [AAPT](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#aapt)
    * [JVM](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jvm)
    * [JRE](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jre)
    * [JDK](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#jdk)
    * [DVM](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#dvm)
    * [ART](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#art)
    * [AIDL](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#aidl)
    * [NDK](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#ndk)
    * [ANR](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#anr)
    * [Shared Preferences](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#shared-preferences)
    * [Nine-patch](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#nine-patch)
    * [Support Library](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#support-library)
    * [Loader](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#loader)
    * [StrictMode](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#strictmode)
    * [Gradle](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#gradle)
    * [Android Build Process](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#android-build-process)
    * [Proguard](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#proguard)
    * [Multidex](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multidex)
    * [Questions](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#questions)
    * [Most frequent K words in a document](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#most-frequent-k-words-in-a-document)
    * [Longest common subsequence](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#longest-common-subsequence)
    * [String compression](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#string-compression)
    * [Two Sum](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#two-sum)
    * [Sudoku Board Validator](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#sudoku-board-validator)
    * [Multiples of 3](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multiples-of-3)
    * [Fibonacci series](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fibonacci-series)
    * [BigInt sum](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bigint-sum)
    * [LRU Cache](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#lru-cache)
    * [LinkedList Cycle](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linkedlist-cycle)
    * [Reverse Stack](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#reverse-stack)
    * [Valid Expression](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#valid-expression)

    ## Data Structures

  4. @lawloretienne lawloretienne revised this gist Apr 4, 2017. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1,6 +1,6 @@
    ## Table Of Contents

    * [Data Structures] : (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#data-structures)
    * [Data Structures](https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#data-structures)
    * [Linked Lists] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linked-lists)
    * [Trees] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#trees)
    * [Binary Trees] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-trees)
  5. @lawloretienne lawloretienne revised this gist Apr 4, 2017. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1,6 +1,6 @@
    ## Table Of Contents

    * [Data Structures] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#data-structures)
    * [Data Structures] : (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#data-structures)
    * [Linked Lists] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linked-lists)
    * [Trees] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#trees)
    * [Binary Trees] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-trees)
  6. @lawloretienne lawloretienne revised this gist Apr 4, 2017. No changes.
  7. @lawloretienne lawloretienne revised this gist Feb 1, 2017. 1 changed file with 2 additions and 2 deletions.
    4 changes: 2 additions & 2 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1810,10 +1810,10 @@ private boolean isRowValid(int[][] board, int row){
    return false;
    }

    if(uniqueNumbers.contains(i)){ // found duplicate
    if(uniqueNumbers.contains(value)){ // found duplicate
    return false;
    } else {
    uniqueNumbers.add(i);
    uniqueNumbers.add(value);
    }
    }

  8. @lawloretienne lawloretienne revised this gist Jan 31, 2017. 1 changed file with 2 additions and 2 deletions.
    4 changes: 2 additions & 2 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -737,8 +737,8 @@ void swap(int array[], int left, int right){
    ```

    ### Radix Sort
    * Radix sort is a sorting algorithm for integers (and some other data types) that takes advantage of the fact that integers have a finite number of bits. In radix sort, we iterate through each digit of the number, grouping numbers by each digit. For example, if we have an array of integers, we might first sort by the first digit, so that the Os are grouped together. Then, we sort each of these groupings by the next digit. We repeat this process sorting by each subsequent digit, until finally the whole array issorted.
    * Unlike comparison sorting algorithms, which cannot perform better than 0(n log(n)) in the average case, radix sort has a runtime of 0(kn), where n is the number of elements and k is the number of passes of the sorting algorithm.
    * Radix sort is a sorting algorithm for integers (and some other data types) that takes advantage of the fact that integers have a finite number of bits. In radix sort, we iterate through each digit of the number, grouping numbers by each digit. For example, if we have an array of integers, we might first sort by the first digit, so that the 0s are grouped together. Then, we sort each of these groupings by the next digit. We repeat this process sorting by each subsequent digit, until finally the whole array is sorted.
    * Unlike comparison sorting algorithms, which cannot perform better than O(n log(n)) in the average case, radix sort has a runtime of O(kn), where n is the number of elements and k is the number of passes of the sorting algorithm.

    ```java
    void radixSort(int[] a){
  9. @lawloretienne lawloretienne revised this gist Jan 31, 2017. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -330,7 +330,7 @@ class Node {
    ### Breadth First Search
    * An algorithm for traversing or searching tree or graph data structures.
    * It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key') and explores the neighbor nodes first, before moving to the next level neighbors.
    * Breadth First Search algorithm(BFS) traverses a graph in a breadthwards motion and uses a queue.
    * The Breadth First Search (BFS) algorithm traverses a graph in a breadthwards motion and uses a queue.
    * This traversal visits nodes by levels from top to bottom and from left to right.
    * Breadth first search can also be useful to find the shortest path.

  10. @lawloretienne lawloretienne revised this gist Nov 28, 2016. 1 changed file with 66 additions and 1 deletion.
    67 changes: 66 additions & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -116,6 +116,7 @@
    * [LRU Cache] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#lru-cache)
    * [LinkedList Cycle] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linkedlist-cycle)
    * [Reverse Stack] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#reverse-stack)
    * [Valid Expression] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#valid-expression)

    ## Data Structures

    @@ -2143,4 +2144,68 @@ void insert(Stack stack, Object obj){
    stack.push(element);
    }
    }
    ```
    ```

    ### Valid Expression
    * Given a string ((0+4)+(1x3) ) Or ( { } ) { ] [ } Or { ( [ (1*3) +2 ] ) / a+ [12 ] } Or { ( a+b ) Output whether the expression is valid (that is, the brackets “match up”). No need to evaluate results. 1 and 3 are valid, 2 and 4 are not.

    ```java
    String a = "((0+4)+(1x3) )";
    String b = "( { } ) { ] [ }";
    String c = "{ ( [ (1*3) +2 ] ) / a+ [12 ] }";
    String d = "{ ( a+b )";

    System.out.println(String.format("Exp a is %b", isValidExpression(a)));
    System.out.println(String.format("Exp b is %b", isValidExpression(b)));
    System.out.println(String.format("Exp c is %b", isValidExpression(c)));
    System.out.println(String.format("Exp d is %b", isValidExpression(d)));

    public static boolean isValidExpression(String exp){
    Stack<Character> bracesStack = new Stack<Character>();

    for(int i=0; i<exp.length(); i++){
    char c1 = exp.charAt(i);

    if(isOpeningChar(c1)){
    bracesStack.push(c1);
    } else if(isClosingChar(c1)) {
    char c2 = bracesStack.peek();
    if(isMatchingBrace(c2, c1))
    bracesStack.pop();
    else
    return false;
    }
    }

    if(bracesStack.isEmpty())
    return true;

    return false;
    }

    private static boolean isOpeningChar(char c1){
    if(c1 == '(' || c1 == '[' || c1 == '{')
    return true;
    else
    return false;
    }

    private static boolean isClosingChar(char c1){
    if(c1 == ')' || c1 == ']' || c1 == '}')
    return true;
    else
    return false;
    }

    private static boolean isMatchingBrace(char c1, char c2){
    if(c1 == '(' && c2 == ')'){
    return true;
    } else if(c1 == '{' && c2 == '}'){
    return true;
    } else if(c1 == '[' && c2 == ']'){
    return true;
    }

    return false;
    }
    ```
  11. @lawloretienne lawloretienne revised this gist Nov 22, 2016. 1 changed file with 9 additions and 0 deletions.
    9 changes: 9 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -265,6 +265,15 @@ class Queue {
    return null;
    }
    }

    class Node {
    Object data;
    Node next;

    Node(Object item){
    data = item;
    }
    }
    ```

    ### Vectors
  12. @lawloretienne lawloretienne revised this gist Oct 31, 2016. 1 changed file with 26 additions and 0 deletions.
    26 changes: 26 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -115,6 +115,7 @@
    * [BigInt sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bigint-sum)
    * [LRU Cache] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#lru-cache)
    * [LinkedList Cycle] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linkedlist-cycle)
    * [Reverse Stack] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#reverse-stack)

    ## Data Structures

    @@ -2108,4 +2109,29 @@ boolean hasCycle(Node first) {
    }
    return false; // fast reached null, so the list terminates
    }
    ```

    ### Reverse Stack
    * Reverse the elements of a stack without using another data structure.

    ```java
    void reverseStack(Stack stack) {
    if (stack.isEmpty()) {
    return;
    } else {
    Object obj = stack.pop();
    reverseStack(stack);
    insert(stack, obj);
    }
    }

    void insert(Stack stack, Object obj){
    if (stack.isEmpty()) {
    stack.push(obj);
    } else {
    Object element = stack.pop();
    insert(stack, obj);
    stack.push(element);
    }
    }
    ```
  13. @lawloretienne lawloretienne revised this gist Oct 31, 2016. 1 changed file with 17 additions and 4 deletions.
    21 changes: 17 additions & 4 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1724,16 +1724,29 @@ public String stringCompression(String uncompressedString){

    ```java
    public void twoSum(int[] array, int sum){
    Map<Integer, Integer> map = new HashMap<>();
    Map<Integer, List<Integer>> map = new HashMap<>();

    for(int i=0; i<array.length; i++){
    map.put(array[i], i);
    if(map.containsKey(array[i])){
    List<Integer> indices = map.get(array[i]);
    indices.add(i);
    map.put(array[i], indices);
    } else {
    List<Integer> indices = new ArrayList<>();
    indices.add(i);
    map.put(array[i], indices);
    }
    }

    for(int i=0; i<array.length; i++){
    int b = sum - array[i];
    if(map.containsKey(b) && i < map.get(b)){
    System.out.println(String.format("twoSum() : Indices %d and %d add up to the target %d", i, map.get(b), sum));
    if(map.containsKey(b)){
    List<Integer> indices = map.get(b);
    for(Integer index : indices){
    if(i!=index && i < index){
    System.out.println(String.format("twoSum() : Indices %d and %d add up to the target %d", i, index, sum));
    }
    }
    }
    }
    }
  14. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 20 additions and 0 deletions.
    20 changes: 20 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -114,6 +114,7 @@
    * [Fibonacci series] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fibonacci-series)
    * [BigInt sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bigint-sum)
    * [LRU Cache] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#lru-cache)
    * [LinkedList Cycle] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linkedlist-cycle)

    ## Data Structures

    @@ -2075,4 +2076,23 @@ public class LRUCache {
    }
    // endregion
    }
    ```

    ### LinkedList Cycle
    * Detect if a linkedlist has a cycle.

    ```java
    boolean hasCycle(Node first) {
    Node slow = first;
    Node fast = first;

    while(fast != null && fast.next != null) {
    slow = slow.next; // 1 hop
    fast = fast.next.next; // 2 hops

    if(slow == fast) // fast caught up to slow, so there is a loop
    return true;
    }
    return false; // fast reached null, so the list terminates
    }
    ```
  15. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 0 additions and 1 deletion.
    1 change: 0 additions & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1768,7 +1768,6 @@ public boolean isSudokuBoardValid(int[][] board){
    if(!isRegionValid(board, i, i + 2, j, j + 2)){
    return false;
    }

    j+=3;
    }
    i+=3;
  16. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 0 additions and 2 deletions.
    2 changes: 0 additions & 2 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1730,9 +1730,7 @@ public void twoSum(int[] array, int sum){
    }

    for(int i=0; i<array.length; i++){

    int b = sum - array[i];

    if(map.containsKey(b) && i < map.get(b)){
    System.out.println(String.format("twoSum() : Indices %d and %d add up to the target %d", i, map.get(b), sum));
    }
  17. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1733,7 +1733,7 @@ public void twoSum(int[] array, int sum){

    int b = sum - array[i];

    if(map.containsKey(b) && i!=map.get(b) && i < map.get(b)){
    if(map.containsKey(b) && i < map.get(b)){
    System.out.println(String.format("twoSum() : Indices %d and %d add up to the target %d", i, map.get(b), sum));
    }
    }
  18. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 148 additions and 0 deletions.
    148 changes: 148 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1930,4 +1930,152 @@ public String sum(String a, String b) {
    * `set(key, value)` - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.

    ```java
    public class LRUCache {

    // region Member Variables
    private int capacity;
    private Map<Integer, Node> data;
    private Node head;
    private Node tail;
    // endregion

    // region Constructors
    public LRUCache(int capacity) {
    this.capacity = capacity;
    this.data = new HashMap<>();
    }
    // endregion

    public int get(int key){

    // Existing key
    if(data.containsKey(key)){

    // Move to first
    Node node = data.get(key);
    moveFirst(node);

    return node.value;
    }

    // Not found
    return -1;
    }

    public void set(int key, int value){
    // Existing slot
    if(data.containsKey(key)){
    Node node = data.get(key);
    node.value = value;
    moveFirst(node);
    return;
    }

    // Out of capacity, cleaning the oldest slot
    if(data.size() >= capacity){
    int id = tail.key;
    removeLast();
    data.remove(id);
    }

    // New slot
    Node node = new Node(key, value);
    add(node);
    data.put(key, node);
    }

    private void add(Node node){
    // Reset position
    node.prev = null;
    node.next = null;

    // First element
    if(head == null){
    head = node;
    tail = node;
    return;
    }

    // Existing element
    head.prev = node;
    node.next = head;
    head = node;

    }

    private void remove(Node node){
    // Nothing to do
    if(node == null || head == null){
    return;
    }

    // The only one item
    if(head == tail && node == head){
    head = null;
    tail = null;
    return;
    }

    // Remove from head
    if(node == head){
    head.next.prev = null;
    head = head.next;
    return;
    }

    // Remove from end
    if(node == tail){
    tail.prev.next = null;
    tail = tail.prev;
    return;
    }

    // Remove in the middle
    node.prev.next = node.next;
    node.next.prev = node.prev;

    }

    // move a node to the head (for a cache hit)
    private void moveFirst(Node node){
    remove(node);
    add(node);
    }

    // remove the oldest item which is the tail
    private void removeLast(){
    remove(tail);
    }

    public void printContents(){
    if(head == null){
    System.out.println("LRUCache is empty");
    return;
    }

    Node currNode = head;

    String contents = "";
    while(currNode != null){
    contents += String.format("%s ", currNode.value);
    currNode = currNode.next;
    }

    System.out.println(String.format("LRUCache contents : %s", contents));
    }

    // region Inner Classes
    private class Node {
    Node prev;
    Node next;
    int key;
    int value;

    private Node(int key, int value) {
    this.key = key;
    this.value = value;
    }
    }
    // endregion
    }
    ```
  19. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 9 additions and 0 deletions.
    9 changes: 9 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -113,6 +113,7 @@
    * [Multiples of 3] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multiples-of-3)
    * [Fibonacci series] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fibonacci-series)
    * [BigInt sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bigint-sum)
    * [LRU Cache] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#lru-cache)

    ## Data Structures

    @@ -1921,4 +1922,12 @@ public String sum(String a, String b) {

    return sb.toString();
    }
    ```

    ### LRU Cache
    * Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get() and set().
    * `get(key)` - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
    * `set(key, value)` - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.

    ```java
    ```
  20. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1859,7 +1859,7 @@ private String multiplesOfThree(int[] a){
    ```

    ### Fibonacci series
    * The Fibonacci series is a series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc. // Write a recursive function to compute the nth number in the fibonacci series.
    * The Fibonacci series is a series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc. Write a recursive function to compute the nth number in the fibonacci series.

    ```java
    int fibonacci(int n) {
  21. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 44 additions and 0 deletions.
    44 changes: 44 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -112,6 +112,7 @@
    * [Sudoku Board Validator] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#sudoku-board-validator)
    * [Multiples of 3] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multiples-of-3)
    * [Fibonacci series] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fibonacci-series)
    * [BigInt sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#bigint-sum)

    ## Data Structures

    @@ -1877,4 +1878,47 @@ int fibonacci(int n, int[] a) {
    }
    return a[n];
    }
    ```

    ### BigInt sum
    * Given two very long sequeces of digits, lets call these BigInts, write a function to calculate the sum of two BigInts. These sequences could be 1000 or more digits long. Think of the sequences as strings.

    ```java
    public String sum(String a, String b) {
    int d1, d2, tempSum;
    int carry = 0;

    int sumLength = (a.length()>b.length()) ? a.length() : b.length();
    StringBuilder sb = new StringBuilder(sumLength);

    int i=a.length()-1;
    int j=b.length()-1;

    while(i>=0 || j>=0){
    d1 = 0;
    d2 = 0;

    if(i>=0) {
    d1 = a.charAt(i) - '0';
    i--;
    }

    if(j>=0) {
    d2 = b.charAt(j) - '0';
    j--;
    }

    tempSum = d1+d2+carry;
    if(tempSum>9){
    carry = tempSum / 10;
    tempSum = tempSum % 10;
    } else {
    carry = 0;
    }

    sb.insert(0, tempSum);
    }

    return sb.toString();
    }
    ```
  22. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 23 additions and 0 deletions.
    23 changes: 23 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -111,6 +111,7 @@
    * [Two Sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#two-sum)
    * [Sudoku Board Validator] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#sudoku-board-validator)
    * [Multiples of 3] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multiples-of-3)
    * [Fibonacci series] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#fibonacci-series)

    ## Data Structures

    @@ -1854,4 +1855,26 @@ private String multiplesOfThree(int[] a){

    return indices.substring(0, indices.length()-1);
    }
    ```

    ### Fibonacci series
    * The Fibonacci series is a series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc. // Write a recursive function to compute the nth number in the fibonacci series.

    ```java
    int fibonacci(int n) {
    int[] memoizationArray = new int[n+1];
    Arrays.fill(memoizationArray, -1);
    return fibonacci(n, memoizationArray);
    }

    int fibonacci(int n, int[] a) {
    if (n <= 2) {
    return 1;
    } else if (a[n] != -1) {
    return a[n]; // Return cached result.
    } else {
    a[n] = fibonacci(n-1, a) + fibonacci(n-2, a); // Cache result
    }
    return a[n];
    }
    ```
  23. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 21 additions and 0 deletions.
    21 changes: 21 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -110,6 +110,7 @@
    * [String compression] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#string-compression)
    * [Two Sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#two-sum)
    * [Sudoku Board Validator] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#sudoku-board-validator)
    * [Multiples of 3] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multiples-of-3)

    ## Data Structures

    @@ -1833,4 +1834,24 @@ private boolean isRegionValid(int[][] board, int rowStartIndex, int rowEndIndex,

    return true;
    }
    ```

    ### Multiples of 3
    * Given an int array, write a function that prints out the indices where the value at that index is a mulitple of 3. So for example if the int [] a = { 1, 2, 3, 5, 7, 8, 11, 12, 14, 15, 17} , then the output should be all on one line (no newlines) : 2, 7, 9

    ```java
    private String multiplesOfThree(int[] a){
    String indices = "";
    for(int i=0; i<a.length; i++){
    if(a[i] % 3 == 0){
    if(i == a.length){
    indices += i+"";
    } else {
    indices += i+",";
    }
    }
    }

    return indices.substring(0, indices.length()-1);
    }
    ```
  24. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 100 additions and 0 deletions.
    100 changes: 100 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -109,6 +109,7 @@
    * [Longest common subsequence] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#longest-common-subsequence)
    * [String compression] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#string-compression)
    * [Two Sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#two-sum)
    * [Sudoku Board Validator] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#sudoku-board-validator)

    ## Data Structures

    @@ -1733,4 +1734,103 @@ public void twoSum(int[] array, int sum){
    }
    }
    }
    ```

    ### Sudoku Board Validator
    * Given a sudoku board as a two-dimensional int array, write a method to validate if the board is valid.

    ```java
    public static int BOARD_DIMENSION = 9;

    public boolean isSudokuBoardValid(int[][] board){

    // check rows
    for(int i=0; i<BOARD_DIMENSION; i++){
    if(!isRowValid(board, i)){
    return false;
    }
    }

    // check columns
    for(int j=0; j<BOARD_DIMENSION; j++){
    if(!isColumnValid(board, j)){
    return false;
    }
    }

    // check sections
    int i=0;
    int j=0;
    for( ; i<BOARD_DIMENSION; ){
    for( ; j<BOARD_DIMENSION; ){
    if(!isRegionValid(board, i, i + 2, j, j + 2)){
    return false;
    }

    j+=3;
    }
    i+=3;
    }

    return true;
    }

    private boolean isRowValid(int[][] board, int row){
    Set<Integer> uniqueNumbers = new HashSet<>();

    for(int i=0; i<BOARD_DIMENSION; i++){
    int value = board[row][i];
    if(value<1 || value>9){
    return false;
    }

    if(uniqueNumbers.contains(i)){ // found duplicate
    return false;
    } else {
    uniqueNumbers.add(i);
    }
    }

    return true;
    }

    private boolean isColumnValid(int[][] board, int column){
    Set<Integer> uniqueNumbers = new HashSet<>();

    for(int i=0; i<BOARD_DIMENSION; i++){
    int value = board[i][column];
    if(value<1 || value>9){
    return false;
    }

    if(uniqueNumbers.contains(value)){ // found duplicate
    return false;
    } else {
    uniqueNumbers.add(value);
    }
    }

    return true;
    }

    private boolean isRegionValid(int[][] board, int rowStartIndex, int rowEndIndex, int columnStartIndex, int columnEndIndex){
    Set<Integer> uniqueNumbers = new HashSet<>();

    for(int i=rowStartIndex; i <rowEndIndex; i++){
    for(int j=columnStartIndex; j<columnEndIndex; j++){
    int value = board[i][j];
    if(value<1 || value>9){
    return false;
    }

    if(uniqueNumbers.contains(value)){ // found duplicate
    return false;
    } else {
    uniqueNumbers.add(value);
    }
    }
    }

    return true;
    }
    ```
  25. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 22 additions and 0 deletions.
    22 changes: 22 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -108,6 +108,7 @@
    * [Most frequent K words in a document] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#most-frequent-k-words-in-a-document)
    * [Longest common subsequence] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#longest-common-subsequence)
    * [String compression] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#string-compression)
    * [Two Sum] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#two-sum)

    ## Data Structures

    @@ -1712,3 +1713,24 @@ public String stringCompression(String uncompressedString){
    }
    ```

    ### Two Sum
    * You have an unsorted array, and you are given a value S. Print all pairs of elements in the array that add up to value S.

    ```java
    public void twoSum(int[] array, int sum){
    Map<Integer, Integer> map = new HashMap<>();

    for(int i=0; i<array.length; i++){
    map.put(array[i], i);
    }

    for(int i=0; i<array.length; i++){

    int b = sum - array[i];

    if(map.containsKey(b) && i!=map.get(b) && i < map.get(b)){
    System.out.println(String.format("twoSum() : Indices %d and %d add up to the target %d", i, map.get(b), sum));
    }
    }
    }
    ```
  26. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1678,7 +1678,7 @@ private String maxSequence(String firstSequence, String secondSequence){
    ```

    ### String compression
    * Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the "compressed" string would not become smaller than the orig- inal string, your method should return the original string.
    * Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the "compressed" string would not become smaller than the original string, your method should return the original string.

    ```java
    public String stringCompression(String uncompressedString){
  27. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 38 additions and 1 deletion.
    39 changes: 38 additions & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -107,6 +107,7 @@
    * [Questions] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#questions)
    * [Most frequent K words in a document] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#most-frequent-k-words-in-a-document)
    * [Longest common subsequence] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#longest-common-subsequence)
    * [String compression] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#string-compression)

    ## Data Structures

    @@ -1674,4 +1675,40 @@ private String maxSequence(String firstSequence, String secondSequence){
    return secondSequence;
    }
    }
    ```
    ```

    ### String compression
    * Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the "compressed" string would not become smaller than the orig- inal string, your method should return the original string.

    ```java
    public String stringCompression(String uncompressedString){
    String compressedString = "";
    if(TextUtils.isEmpty(uncompressedString))
    return "";

    int repeatedFreqCount = 0;
    for(int i=0; i<uncompressedString.length(); i++){
    if(i == 0){
    repeatedFreqCount++;
    } else {
    if(uncompressedString.charAt(i) == uncompressedString.charAt(i-1)){
    repeatedFreqCount++;
    } else {
    compressedString += uncompressedString.charAt(i-1)+""+repeatedFreqCount;
    repeatedFreqCount = 1;
    }

    if(i == uncompressedString.length()-1){
    compressedString += uncompressedString.charAt(i)+""+repeatedFreqCount;
    }
    }
    }

    if(compressedString.length() < uncompressedString.length()){
    return compressedString;
    } else {
    return uncompressedString;
    }
    }
    ```

  28. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 25 additions and 0 deletions.
    25 changes: 25 additions & 0 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -106,6 +106,7 @@
    * [Multidex] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multidex)
    * [Questions] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#questions)
    * [Most frequent K words in a document] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#most-frequent-k-words-in-a-document)
    * [Longest common subsequence] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#longest-common-subsequence)

    ## Data Structures

    @@ -1649,4 +1650,28 @@ private class Word{
    }
    // endregion
    }
    ```

    ### Longest common subsequence
    * Given two Strings, find the longest common subsequence?

    ```java
    public String lcs(String a, String b){
    if(TextUtils.isEmpty(a) || TextUtils.isEmpty(b))
    return "";
    else if(a.charAt(a.length()-1) == b.charAt(b.length()-1)){
    return lcs(a.substring(0, a.length()-1), b.substring(0, b.length()-1)) + a.substring(a.length()-1);
    } else {
    return maxSequence(lcs(a.substring(0, a.length()-1), b.substring(0, b.length())),
    lcs(a.substring(0, a.length()), b.substring(0, b.length()-1)) );
    }
    }

    private String maxSequence(String firstSequence, String secondSequence){
    if(firstSequence.length() > secondSequence.length()){
    return firstSequence;
    } else {
    return secondSequence;
    }
    }
    ```
  29. @lawloretienne lawloretienne revised this gist Oct 28, 2016. 1 changed file with 90 additions and 2 deletions.
    92 changes: 90 additions & 2 deletions Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -104,7 +104,8 @@
    * [Android Build Process] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#android-build-process)
    * [Proguard] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#proguard)
    * [Multidex] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#multidex)

    * [Questions] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#questions)
    * [Most frequent K words in a document] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#most-frequent-k-words-in-a-document)

    ## Data Structures

    @@ -1561,4 +1562,91 @@ WeakReference weakWidget = new WeakReference(widget);
    ### Multidex
    * Android application (APK) files contain executable bytecode files in the form of Dalvik Executable (DEX) files, which contain the compiled code used to run your app.
    * The Dalvik Executable specification limits the total number of methods that can be referenced within a single DEX file to 65,536, including Android framework methods, library methods, and methods in your own code.
    * Getting past this limit requires that you configure your app build process to generate more than one DEX file, known as a multidex configuration.
    * Getting past this limit requires that you configure your app build process to generate more than one DEX file, known as a multidex configuration.

    ## Questions

    ### Most frequent K words in a document
    * Given a word document as a String, find the K most frequent words in the document?

    ```java
    private List<String> getMostFrequentWords(String document, int numOfWords){
    List<String> mostFrequentWords = new ArrayList<>();

    if(numOfWords<=0 || TextUtils.isEmpty(document)){
    return mostFrequentWords;
    }

    String[] tokens = document.split("\\s*[^a-zA-Z']*?\\s+");

    Map<String, Integer> wordFrequencies = new HashMap<>();
    for(String token : tokens){
    if(wordFrequencies.containsKey(token))
    wordFrequencies.put(token, wordFrequencies.get(token) + 1);
    else
    wordFrequencies.put(token, 1);
    }

    PriorityQueue maxHeap = new PriorityQueue(wordFrequencies.size(), new Comparator<Object>() {
    @Override
    public int compare(Object lhs, Object rhs) {
    int freq1 = ((Word)lhs).getFrequency();
    int freq2 = ((Word)rhs).getFrequency();
    if(freq1 < freq2){
    return 1;
    } else if(freq1 > freq2){
    return -1;
    } else {
    return 0;
    }
    }
    });

    for ( String key : wordFrequencies.keySet() ) {
    Word word = new Word(key, wordFrequencies.get(key));
    maxHeap.add(word);
    }

    for(int i=0; maxHeap.size()>0 && i<numOfWords; i++){
    Word word = (Word) maxHeap.poll();
    mostFrequentWords.add(word.getText());
    }

    return mostFrequentWords;
    }

    private class Word{

    // region Member Variables
    private String text;
    private int frequency;
    // endregion

    // region Constructors
    public Word(String text, int frequency){
    this.text = text;
    this.frequency = frequency;
    }
    // endregion

    // region Getters
    public int getFrequency() {
    return this.frequency;
    }

    public String getText() {
    return this.text;
    }
    // endregion

    // region Setters
    public void setText(String text) {
    this.text = text;
    }

    public void setFrequency(int frequency) {
    this.frequency = frequency;
    }
    // endregion
    }
    ```
  30. @lawloretienne lawloretienne revised this gist Oct 27, 2016. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion Interview Topics.md
    View file
    Original file line number Diff line number Diff line change
    @@ -1367,7 +1367,7 @@ WeakReference weakWidget = new WeakReference(widget);
    * An iterator over a collection.
    * The Iterator interface allows us to remove an element while traversing the Collection object.
    * Iterator has remove() method which is not there in the Enumeration interface.
    * Iterator should be preferred over Enumeration, as "Iterator takes the place of Enumeration in the Java collections framework
    * Iterator should be preferred over Enumeration, as Iterator takes the place of Enumeration in the Java collections framework.

    ## Android