SYMBOL INDEX (1317 symbols across 515 files)

FILE: company/adobe/AddDigits.java
  class AddDigits (line 9) | class AddDigits {
    method addDigits (line 10) | public int addDigits(int num) {

FILE: company/adobe/MajorityElement.java
  class MajorityElement (line 4) | class MajorityElement {
    method majorityElement (line 5) | public int majorityElement(int[] nums) {

FILE: company/airbnb/AddTwoNumbers.java
  class AddTwoNumbers (line 16) | public class AddTwoNumbers {
    method addTwoNumbers (line 17) | public ListNode addTwoNumbers(ListNode l1, ListNode l2) {

FILE: company/airbnb/ContainsDuplicate.java
  class ContainsDuplicate (line 4) | class ContainsDuplicate {
    method containsDuplicate (line 5) | public boolean containsDuplicate(int[] nums) {

FILE: company/airbnb/ContainsDuplicatesII.java
  class ContainsDuplicatesII (line 4) | class ContainsDuplicatesII {
    method containsNearbyDuplicate (line 5) | public boolean containsNearbyDuplicate(int[] nums, int k) {

FILE: company/airbnb/ConvertSortedArrayToBinarySearchTree.java
  class Solution (line 12) | public class Solution {
    method sortedArrayToBST (line 13) | public TreeNode sortedArrayToBST(int[] nums) {
    method helper (line 23) | private TreeNode helper(int[] nums, int start, int end) {

FILE: company/airbnb/HouseRobber.java
  class HouseRobber (line 5) | public class HouseRobber {
    method rob (line 6) | public int rob(int[] nums) {

FILE: company/airbnb/MergeKSortedLists.java
  class MergeKSortedLists (line 11) | public class MergeKSortedLists {
    method mergeKLists (line 12) | public ListNode mergeKLists(ListNode[] lists) {

FILE: company/airbnb/RegularExpressionMatching.java
  class RegularExpressionMatching (line 20) | public class RegularExpressionMatching {
    method isMatch (line 21) | public boolean isMatch(String s, String p) {

FILE: company/airbnb/TwoSum.java
  class TwoSum (line 11) | public class TwoSum {
    method twoSum (line 12) | public int[] twoSum(int[] nums, int target) {

FILE: company/airbnb/ValidParentheses.java
  class ValidParentheses (line 5) | public class ValidParentheses {
    method isValid (line 6) | public boolean isValid(String s) {

FILE: company/amazon/3Sum.java
  class Sum (line 13) | public class 3Sum {
    method threeSum (line 14) | public List<List<Integer>> threeSum(int[] nums) {

FILE: company/amazon/AddTwoNumbers.java
  class AddTwoNumbers (line 16) | public class AddTwoNumbers {
    method addTwoNumbers (line 17) | public ListNode addTwoNumbers(ListNode l1, ListNode l2) {

FILE: company/amazon/BestTimeToBuyAndSellStock.java
  class BestTimeToBuyAndSellStock (line 16) | public class BestTimeToBuyAndSellStock {
    method maxProfit (line 17) | public int maxProfit(int[] prices) {

FILE: company/amazon/BinaryTreeLevelOrderTraversal.java
  class BinaryTreeLevelOrderTraversal (line 26) | public class BinaryTreeLevelOrderTraversal {
    method levelOrder (line 27) | public List<List<Integer>> levelOrder(TreeNode root) {

FILE: company/amazon/EncodeAndDecodeTinyURL.java
  class EncodeAndDecodeTinyURL (line 8) | public class EncodeAndDecodeTinyURL {
    method getKey (line 13) | public String getKey() {
    method encode (line 25) | public String encode(String longUrl) {
    method decode (line 34) | public String decode(String shortUrl) {

FILE: company/amazon/FirstUniqueCharacterInAString.java
  class FirstUniqueCharacterInAString (line 12) | class FirstUniqueCharacterInAString {
    method firstUniqChar (line 13) | public int firstUniqChar(String s) {

FILE: company/amazon/GroupAnagrams.java
  class GroupAnagrams (line 13) | public class GroupAnagrams {
    method groupAnagrams (line 14) | public List<List<String>> groupAnagrams(String[] strs) {

FILE: company/amazon/InsertDeleteGetRandomO1.java
  class RandomizedSet (line 32) | class RandomizedSet {
    method RandomizedSet (line 37) | public RandomizedSet() {
    method insert (line 43) | public boolean insert(int val) {
    method remove (line 55) | public boolean remove(int val) {
    method getRandom (line 65) | public int getRandom() {

FILE: company/amazon/KthLargestElementInAnArray.java
  class KthLargestElementInAnArray (line 9) | public class KthLargestElementInAnArray {
    method findKthLargest (line 10) | public int findKthLargest(int[] nums, int k) {

FILE: company/amazon/LetterCombinationsOfAPhoneNumber.java
  class LetterCombinationsOfAPhoneNumber (line 17) | class LetterCombinationsOfAPhoneNumber {
    method letterCombinations (line 18) | public List<String> letterCombinations(String digits) {
    method letterCombinationsRecursive (line 43) | public void letterCombinationsRecursive(List<String> result, String di...

FILE: company/amazon/LinkedListCycle.java
  class Solution (line 15) | public class Solution {
    method hasCycle (line 16) | public boolean hasCycle(ListNode head) {

FILE: company/amazon/LongestPalindromicSubstring.java
  class LongestPalindromicSubstring (line 13) | class LongestPalindromicSubstring {
    method longestPalindrome (line 14) | public String longestPalindrome(String s) {
    method isPalindrome (line 31) | public boolean isPalindrome(String s) {

FILE: company/amazon/LowestCommonAncestorOfABinaryTree.java
  class LowestCommonAncestorOfABinaryTree (line 23) | public class LowestCommonAncestorOfABinaryTree {
    method lowestCommonAncestor (line 24) | public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNo...

FILE: company/amazon/MergeKSortedLists.java
  class MergeKSortedLists (line 11) | public class MergeKSortedLists {
    method mergeKLists (line 12) | public ListNode mergeKLists(ListNode[] lists) {

FILE: company/amazon/MinCostClimbingStairs.java
  class MinCostClimbingStairs (line 17) | class MinCostClimbingStairs {
    method minCostClimbingStairs (line 18) | public int minCostClimbingStairs(int[] cost) {

FILE: company/amazon/MinStack.java
  class MinStack (line 15) | class MinStack {
    class Node (line 16) | class Node {
      method Node (line 21) | public Node(int data, int min) {
    method MinStack (line 30) | public MinStack() {
    method push (line 34) | public void push(int x) {
    method pop (line 44) | public void pop() {
    method top (line 48) | public int top() {
    method getMin (line 52) | public int getMin() {

FILE: company/amazon/NumberOfIslands.java
  class NumberOfIslands (line 19) | public class NumberOfIslands {
    method numIslands (line 22) | public int numIslands(char[][] grid) {
    method sink (line 42) | int sink(char[][] grid, int i, int j) {

FILE: company/amazon/PalindromeLinkedList.java
  class PalindromeLinkedList (line 9) | public class PalindromeLinkedList {
    method isPalindrome (line 10) | public boolean isPalindrome(ListNode head) {

FILE: company/amazon/ProductOfArrayExceptSelf.java
  class ProductOfArrayExceptSelf (line 10) | public class ProductOfArrayExceptSelf {
    method productExceptSelf (line 11) | public int[] productExceptSelf(int[] nums) {

FILE: company/amazon/ReverseLinkedList.java
  class ReverseLinkedList (line 11) | public class ReverseLinkedList {
    method reverseList (line 12) | public ListNode reverseList(ListNode head) {

FILE: company/amazon/RotateImage.java
  class RotateImage (line 8) | public class RotateImage {
    method rotate (line 9) | public void rotate(int[][] matrix) {

FILE: company/amazon/Subsets.java
  class Subsets (line 19) | public class Subsets {
    method subsets (line 20) | public List<List<Integer>> subsets(int[] nums) {
    method recurse (line 29) | private void recurse(List<List<Integer>> result, int[] nums, Stack pat...

FILE: company/amazon/TrappingRainWater.java
  class TrappingRainWater (line 6) | public class TrappingRainWater {
    method trap (line 7) | public int trap(int[] height) {

FILE: company/amazon/TwoSum.java
  class TwoSum (line 11) | public class TwoSum {
    method twoSum (line 12) | public int[] twoSum(int[] nums, int target) {

FILE: company/amazon/ValidParentheses.java
  class ValidParentheses (line 5) | public class ValidParentheses {
    method isValid (line 6) | public boolean isValid(String s) {

FILE: company/amazon/ValidateBinarySearchTree.java
  class ValidateBinarySearchTree (line 28) | public class ValidateBinarySearchTree {
    method isValidBST (line 29) | public boolean isValidBST(TreeNode root) {
    method validBSTRecursive (line 37) | public boolean validBSTRecursive(TreeNode root, long minValue, long ma...

FILE: company/amazon/WordBreak.java
  class WordBreak (line 9) | public class WordBreak {
    method wordBreak (line 10) | public boolean wordBreak(String s, Set<String> wordDict) {

FILE: company/apple/ReverseWordsInAString.java
  class ReverseWordsInAString (line 6) | public class ReverseWordsInAString {
    method reverseWords (line 7) | public String reverseWords(String s) {

FILE: company/apple/ValidSudoku.java
  class ValidSudoku (line 8) | class ValidSudoku {
    method isValidSudoku (line 9) | public boolean isValidSudoku(char[][] board) {

FILE: company/bloomberg/FirstUniqueCharacterInAString.java
  class FirstUniqueCharacterInAString (line 12) | class FirstUniqueCharacterInAString {
    method firstUniqChar (line 13) | public int firstUniqChar(String s) {

FILE: company/bloomberg/LinkedListCycle.java
  class Solution (line 15) | public class Solution {
    method hasCycle (line 16) | public boolean hasCycle(ListNode head) {

FILE: company/bloomberg/LongestPalindromicSubstring.java
  class LongestPalindromicSubstring (line 13) | class LongestPalindromicSubstring {
    method longestPalindrome (line 14) | public String longestPalindrome(String s) {
    method isPalindrome (line 31) | public boolean isPalindrome(String s) {

FILE: company/bloomberg/MinStack.java
  class MinStack (line 15) | class MinStack {
    class Node (line 16) | class Node {
      method Node (line 21) | public Node(int data, int min) {
    method MinStack (line 30) | public MinStack() {
    method push (line 34) | public void push(int x) {
    method pop (line 44) | public void pop() {
    method top (line 48) | public int top() {
    method getMin (line 52) | public int getMin() {

FILE: company/bloomberg/ReverseWordsInAString.java
  class ReverseWordsInAString (line 6) | public class ReverseWordsInAString {
    method reverseWords (line 7) | public String reverseWords(String s) {

FILE: company/bloomberg/UniquePaths.java
  class UniquePaths (line 7) | class UniquePaths {
    method uniquePaths (line 8) | public int uniquePaths(int m, int n) {

FILE: company/facebook/3Sum.java
  class Sum (line 13) | public class 3Sum {
    method threeSum (line 14) | public List<List<Integer>> threeSum(int[] nums) {

FILE: company/facebook/AddAndSearchWordDataStructureDesign.java
  class AddAndSearchWordDataStructure (line 20) | public class AddAndSearchWordDataStructure {
    class TrieNode (line 21) | public class TrieNode {
    method addWord (line 28) | public void addWord(String word) {
    method search (line 42) | public boolean search(String word) {
    method match (line 46) | private boolean match(char[] chs, int k, TrieNode node) {

FILE: company/facebook/AddBinary.java
  class AddBinary (line 8) | public class AddBinary {
    method addBinary (line 9) | public String addBinary(String a, String b) {

FILE: company/facebook/BestTimeToBuyAndSellStock.java
  class BestTimeToBuyAndSellStock (line 16) | public class BestTimeToBuyAndSellStock {
    method maxProfit (line 17) | public int maxProfit(int[] prices) {

FILE: company/facebook/BinarySearchTreeIterator.java
  class BinarySearchTreeIterator (line 17) | public class BinarySearchTreeIterator {
    method BSTIterator (line 20) | public BSTIterator(TreeNode root) {
    method hasNext (line 30) | public boolean hasNext() {
    method next (line 35) | public int next() {

FILE: company/facebook/BinaryTreeLevelOrderTraversal.java
  class BinaryTreeLevelOrderTraversal (line 26) | public class BinaryTreeLevelOrderTraversal {
    method levelOrder (line 27) | public List<List<Integer>> levelOrder(TreeNode root) {

FILE: company/facebook/BinaryTreePaths.java
  class BinaryTreePaths (line 23) | public class BinaryTreePaths {
    method binaryTreePaths (line 24) | public List<String> binaryTreePaths(TreeNode root) {
    method helper (line 36) | public void helper(String current, TreeNode root, List<String> result) {

FILE: company/facebook/BinaryTreeVerticalOrderTraversal.java
  class BinaryTreeVerticalOrderTraversal (line 67) | public class BinaryTreeVerticalOrderTraversal {
    method verticalOrder (line 68) | public List<List<Integer>> verticalOrder(TreeNode root) {

FILE: company/facebook/CloneGraph.java
  class CloneGraph (line 31) | public class CloneGraph {
    method cloneGraph (line 34) | public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {

FILE: company/facebook/CombinationSumIV.java
  class Solution (line 26) | public class Solution {
    method combinationSum4 (line 28) | public int combinationSum4(int[] nums, int target) {

FILE: company/facebook/CountAndSay.java
  class Solution (line 11) | public class Solution {
    method countAndSay (line 13) | public String countAndSay(int n) {
    method helper (line 27) | public String helper(String s) {

FILE: company/facebook/DecodeWays.java
  class DecodeWays (line 15) | public class DecodeWays {
    method numDecodings (line 16) | public int numDecodings(String s) {

FILE: company/facebook/EncodeAndDecodeTinyURL.java
  class EncodeAndDecodeTinyURL (line 8) | public class EncodeAndDecodeTinyURL {
    method getKey (line 13) | public String getKey() {
    method encode (line 25) | public String encode(String longUrl) {
    method decode (line 34) | public String decode(String shortUrl) {

FILE: company/facebook/ExclusiveTimeOfFunctions.java
  class ExclusiveTimeOfFunctions (line 30) | class ExclusiveTimeOfFunctions {
    method exclusiveTime (line 31) | public int[] exclusiveTime(int n, List<String> logs) {

FILE: company/facebook/ExpressionAddOperators.java
  class ExpressionAddOperators (line 10) | public class ExpressionAddOperators {
    method addOperators (line 11) | public List<String> addOperators(String num, int target) {
    method helper (line 23) | public void helper(List<String> result, String path, String num, int t...

FILE: company/facebook/FindTheCelebrity.java
  class FindTheCelebrity (line 12) | public class FindTheCelebrity extends Relation {
    method findCelebrity (line 13) | public int findCelebrity(int n) {

FILE: company/facebook/FirstBadVersion.java
  class FirstBadVersion (line 10) | public class FirstBadVersion extends VersionControl {
    method firstBadVersion (line 11) | public int firstBadVersion(int n) {

FILE: company/facebook/FlattenNestedListIterator.java
  class FlattenNestedListIterator (line 32) | public class FlattenNestedListIterator implements Iterator<Integer> {
    method NestedIterator (line 35) | public NestedIterator(List<NestedInteger> nestedList) {
    method next (line 41) | @Override
    method hasNext (line 46) | @Override

FILE: company/facebook/GroupAnagrams.java
  class GroupAnagrams (line 13) | public class GroupAnagrams {
    method groupAnagrams (line 14) | public List<List<String>> groupAnagrams(String[] strs) {

FILE: company/facebook/HammingDistance.java
  class HammingDistance (line 21) | public class HammingDistance {
    method hammingDistance (line 22) | public int hammingDistance(int x, int y) {

FILE: company/facebook/ImplementTrie.java
  class TrieNode (line 11) | class TrieNode {
    method TrieNode (line 17) | public TrieNode(char character) {
  class ImplementTrie (line 24) | public class ImplementTrie {
    method Trie (line 27) | public Trie() {
    method insert (line 32) | public void insert(String word) {
    method search (line 47) | public boolean search(String word) {
    method startsWith (line 67) | public boolean startsWith(String prefix) {

FILE: company/facebook/InorderSuccessorInBST.java
  class InorderSuccessorInBST (line 14) | public class InorderSuccessorInBST {
    method inorderSuccessor (line 15) | public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {

FILE: company/facebook/InsertDeleteGetRandomO1.java
  class RandomizedSet (line 32) | class RandomizedSet {
    method RandomizedSet (line 37) | public RandomizedSet() {
    method insert (line 43) | public boolean insert(int val) {
    method remove (line 55) | public boolean remove(int val) {
    method getRandom (line 65) | public int getRandom() {

FILE: company/facebook/InsertInterval.java
  class InsertInterval (line 22) | public class InsertInterval {
    method insert (line 23) | public List<Interval> insert(List<Interval> intervals, Interval newInt...

FILE: company/facebook/IntegerToEnglishWords.java
  class IntegerToEnglishWords (line 9) | public class IntegerToEnglishWords {
    method numberToWords (line 14) | public String numberToWords(int num) {
    method helper (line 35) | private String helper(int num) {

FILE: company/facebook/KthLargestElementInAnArray.java
  class KthLargestElementInAnArray (line 9) | public class KthLargestElementInAnArray {
    method findKthLargest (line 10) | public int findKthLargest(int[] nums, int k) {

FILE: company/facebook/LetterCombinationsOfAPhoneNumber.java
  class LetterCombinationsOfAPhoneNumber (line 17) | class LetterCombinationsOfAPhoneNumber {
    method letterCombinations (line 18) | public List<String> letterCombinations(String digits) {
    method letterCombinationsRecursive (line 43) | public void letterCombinationsRecursive(List<String> result, String di...

FILE: company/facebook/LongestConsecutiveSequence.java
  class LongestConsecutiveSequence (line 9) | class LongestConsecutiveSequence {
    method longestConsecutive (line 10) | public int longestConsecutive(int[] nums) {

FILE: company/facebook/LowestCommonAncestorOfABinaryTree.java
  class LowestCommonAncestorsOfABinaryTree (line 23) | public class LowestCommonAncestorsOfABinaryTree {
    method lowestCommonAncestor (line 24) | public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNo...

FILE: company/facebook/MaximumSizeSubarraySumEqualsK.java
  class MaximumSizeSubarraySumEqualsK (line 17) | public class MaximumSizeSubarraySumEqualsK {
    method maxSubArrayLen (line 18) | public int maxSubArrayLen(int[] nums, int k) {

FILE: company/facebook/MeetingRooms.java
  class MeetingRooms (line 16) | public class MeetingRooms {
    method canAttendMeetings (line 17) | public boolean canAttendMeetings(Interval[] intervals) {

FILE: company/facebook/MergeIntervals.java
  class MergeIntervals (line 16) | class MergeIntervals {
    method merge (line 17) | public List<Interval> merge(List<Interval> intervals) {

FILE: company/facebook/MergeKSortedLists.java
  class MergeKSortedLists (line 11) | public class MergeKSortedLists {
    method mergeKLists (line 12) | public ListNode mergeKLists(ListNode[] lists) {

FILE: company/facebook/MergeSortedArray.java
  class MergeSortedArray (line 6) | public class MergeSortedArray {
    method merge (line 7) | public void merge(int[] A, int m, int[] B, int n) {

FILE: company/facebook/MinStack.java
  class MinStack (line 9) | class MinStack {
    class Node (line 10) | class Node {
      method Node (line 15) | public Node(int data, int min) {
    method MinStack (line 24) | public MinStack() {
    method push (line 28) | public void push(int x) {
    method pop (line 38) | public void pop() {
    method top (line 42) | public int top() {
    method getMin (line 46) | public int getMin() {

FILE: company/facebook/MinimumSizeSubarraySum.java
  class MinimumSizeSubarraySum (line 6) | public class MinimumSizeSubarraySum {
    method minSubArrayLen (line 7) | public int minSubArrayLen(int s, int[] nums) {

FILE: company/facebook/MinimumWindowSubstring.java
  class MinimumWindowSubstring (line 13) | public class MinimumWindowSubstring {
    method minWindow (line 14) | public String minWindow(String s, String t) {

FILE: company/facebook/MoveZeros.java
  class MoveZeros (line 9) | public class MoveZeros {
    method moveZeroes (line 10) | public void moveZeroes(int[] nums) {

FILE: company/facebook/MultiplyStrings.java
  class MultiplyStrings (line 10) | public class MultiplyStrings {
    method multiply (line 11) | public String multiply(String num1, String num2) {

FILE: company/facebook/NumberOfIslands.java
  class NumberOfIslands (line 19) | public class NumberOfIslands {
    method numIslands (line 22) | public int numIslands(char[][] grid) {
    method sink (line 41) | int sink(char[][] grid, int i, int j) {

FILE: company/facebook/OneEditDistance.java
  class OneEditDistance (line 3) | public class OneEditDistance {
    method isOneEditDistance (line 4) | public boolean isOneEditDistance(String s, String t) {

FILE: company/facebook/PaintHouseII.java
  class PaintHouseII (line 11) | public class PaintHouseII {
    method minCostII (line 12) | public int minCostII(int[][] costs) {

FILE: company/facebook/PalindromeLinkedList.java
  class PalindromeLinkedList (line 9) | public class PalindromeLinkedList {
    method isPalindrome (line 10) | public boolean isPalindrome(ListNode head) {

FILE: company/facebook/PalindromicSubstrings.java
  class PalindromicSubstrings (line 16) | class PalindromicSubstrings {
    method countSubstrings (line 18) | public int countSubstrings(String s) {
    method extendPalindrome (line 31) | public void extendPalindrome(String s, int left, int right) {

FILE: company/facebook/PowerOfXToTheN.java
  class PowerOfXToTheN (line 3) | public class PowerOfXToTheN {
    method myPow (line 4) | public double myPow(double x, int n) {

FILE: company/facebook/ProductOfArrayExceptSelf.java
  class ProductOfArrayExceptSelf (line 10) | public class ProductOfArrayExceptSelf {
    method productExceptSelf (line 11) | public int[] productExceptSelf(int[] nums) {

FILE: company/facebook/RegularExpressionMatching.java
  class RegularExpressionMatching (line 20) | public class RegularExpressionMatching {
    method isMatch (line 21) | public boolean isMatch(String s, String p) {

FILE: company/facebook/RemoveDuplicatesFromSortedArray.java
  class RemoveDuplicatesFromSortedArray (line 10) | public class RemoveDuplicatesFromSortedArray {
    method removeDuplicates (line 11) | public int removeDuplicates(int[] nums) {

FILE: company/facebook/RemoveInvalidParentheses.java
  class RemoveInvalidParentheses (line 10) | public class RemoveInvalidParentheses {
    method removeInvalidParentheses (line 11) | public List<String> removeInvalidParentheses(String s) {
    method remove (line 19) | public void remove(String s, List<String> result, int last_i, int last...

FILE: company/facebook/ReverseLinkedList.java
  class ReverseLinkedList (line 11) | public class ReverseLinkedList {
    method reverseList (line 12) | public ListNode reverseList(ListNode head) {

FILE: company/facebook/RomanToInteger.java
  class RomanToInteger (line 5) | public class RomanToInteger {
    method romanToInt (line 6) | public int romanToInt(String s) {

FILE: company/facebook/SearchInRotatedSortedArray.java
  class SearchInRotatedSortedArray (line 9) | public class SearchInRotatedSortedArray {
    method search (line 10) | public int search(int[] nums, int target) {

FILE: company/facebook/SortColors.java
  class SortColors (line 8) | public class SortColors {
    method sortColors (line 9) | public void sortColors(int[] nums) {

FILE: company/facebook/SparseMatrixMultiplication.java
  class SparseMatrixMultiplication (line 23) | public class SparseMatrixMultiplication {
    method multiply (line 24) | public int[][] multiply(int[][] A, int[][] B) {

FILE: company/facebook/SquareRootX.java
  class SquareRootX (line 5) | public class SquareRootX {
    method mySqrt (line 6) | public int mySqrt(int x) {

FILE: company/facebook/Subsets.java
  class Subsets (line 19) | public class Subsets {
    method subsets (line 20) | public List<List<Integer>> subsets(int[] nums) {
    method recurse (line 29) | private void recurse(List<List<Integer>> result, int[] nums, Stack pat...

FILE: company/facebook/SubsetsII.java
  class SubsetsII (line 17) | public class SubsetsII {
    method subsetsWithDup (line 18) | public List<List<Integer>> subsetsWithDup(int[] nums) {
    method helper (line 33) | public void helper(int[] nums, ArrayList<Integer> current, int index, ...

FILE: company/facebook/SumOfLeftLeaves.java
  class SumOfLeftLeaves (line 22) | public class SumOfLeftLeaves {
    method sumOfLeftLeaves (line 23) | public int sumOfLeftLeaves(TreeNode root) {

FILE: company/facebook/TwoSum.java
  class TwoSum (line 11) | public class TwoSum {
    method twoSum (line 12) | public int[] twoSum(int[] nums, int target) {

FILE: company/facebook/ValidPalindrome.java
  class ValidPalindrome (line 1) | public class ValidPalindrome {
    method isPalindrome (line 2) | public boolean isPalindrome(String s) {

FILE: company/facebook/ValidParentheses.java
  class ValidParentheses (line 5) | public class ValidParentheses {
    method isValid (line 6) | public boolean isValid(String s) {

FILE: company/facebook/ValidateBinarySearchTree.java
  class ValidateBinarySearchTree (line 28) | public class ValidateBinarySearchTree {
    method isValidBST (line 29) | public boolean isValidBST(TreeNode root) {
    method validBSTRecursive (line 37) | public boolean validBSTRecursive(TreeNode root, long minValue, long ma...

FILE: company/facebook/WallsAndGates.java
  class WallsAndGates (line 19) | public class WallsAndGates {
    method wallsAndGates (line 20) | public void wallsAndGates(int[][] rooms) {
    method dfs (line 31) | void dfs(int[][] rooms, int i, int j, int distance) {

FILE: company/facebook/WordBreak.java
  class WordBreak (line 9) | public class WordBreak {
    method wordBreak (line 10) | public boolean wordBreak(String s, Set<String> wordDict) {

FILE: company/facebook/WordSearch.java
  class WordSearch (line 17) | public class WordSearch {
    method exist (line 18) | public boolean exist(char[][] board, String word) {
    method search (line 33) | public boolean search(char[][] board, int i, int j, char[] w, int inde...

FILE: company/google/3SumSmaller.java
  class SumSmaller (line 13) | public class 3SumSmaller {
    method threeSumSmaller (line 14) | public int threeSumSmaller(int[] nums, int target) {

FILE: company/google/AndroidUnlockPatterns.java
  class AndroidUnlockPatterns (line 28) | public class AndroidUnlockPatterns {
    method numberOfPatterns (line 29) | public int numberOfPatterns(int m, int n) {
    method DFS (line 56) | int DFS(boolean visited[], int[][] skip, int current, int remaining) {

FILE: company/google/BinarySearchTreeIterator.java
  class BinarySearchTreeIterator (line 17) | public class BinarySearchTreeIterator {
    method BSTIterator (line 20) | public BSTIterator(TreeNode root) {
    method hasNext (line 30) | public boolean hasNext() {
    method next (line 35) | public int next() {

FILE: company/google/BinaryTreePaths.java
  class BinaryTreePaths (line 23) | public class BinaryTreePaths {
    method binaryTreePaths (line 24) | public List<String> binaryTreePaths(TreeNode root) {
    method helper (line 36) | public void helper(String current, TreeNode root, List<String> result) {

FILE: company/google/BinaryTreeVerticalOrderTraversal.java
  class BinaryTreeVerticalOrderTraversal (line 67) | public class BinaryTreeVerticalOrderTraversal {
    method verticalOrder (line 68) | public List<List<Integer>> verticalOrder(TreeNode root) {

FILE: company/google/BinaryWatch.java
  class BinaryWatch (line 18) | public class BinaryWatch {
    method readBinaryWatch (line 19) | public List<String> readBinaryWatch(int num) {

FILE: company/google/BombEnemy.java
  class BombEnemy (line 14) | public class BombEnemy {
    method maxKilledEnemies (line 15) | public int maxKilledEnemies(char[][] grid) {
    method killedEnemiesRow (line 48) | private int killedEnemiesRow(char[][] grid, int i, int j) {
    method killedEnemiesCol (line 63) | private int killedEnemiesCol(char[][] grid, int i, int j) {

FILE: company/google/BullsAndCows.java
  class BullsAndCows (line 23) | class BullsAndCows {
    method getHint (line 24) | public String getHint(String secret, String guess) {

FILE: company/google/CloneGraph.java
  class CloneGraph (line 31) | public class CloneGraph {
    method cloneGraph (line 34) | public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {

FILE: company/google/ClosestBinarySearchTreeValue.java
  class ClosestBinarySearchTreeValue (line 16) | public class ClosestBinarySearchTreeValue {
    method closestValue (line 17) | public int closestValue(TreeNode root, double target) {

FILE: company/google/CombinationSumIV.java
  class CombinationSumIV (line 26) | public class CombinationSumIV {
    method combinationSum4 (line 27) | public int combinationSum4(int[] nums, int target) {

FILE: company/google/DailyTemperatures.java
  class DailyTemperatures (line 7) | class DailyTemperatures {
    method dailyTemperatures (line 8) | public int[] dailyTemperatures(int[] temperatures) {

FILE: company/google/DecodeString.java
  class DecodeString (line 9) | public class DecodeString {
    method decodeString (line 10) | public String decodeString(String s) {

FILE: company/google/EncodeAndDecodeTinyURL.java
  class EncodeAndDecodeTinyURL (line 8) | public class EncodeAndDecodeTinyURL {
    method getKey (line 13) | public String getKey() {
    method encode (line 25) | public String encode(String longUrl) {
    method decode (line 34) | public String decode(String shortUrl) {

FILE: company/google/ExpressionAddOperators.java
  class ExpressionAddOperator (line 10) | public class ExpressionAddOperator {
    method addOperators (line 11) | public List<String> addOperators(String num, int target) {
    method helper (line 23) | public void helper(List<String> result, String path, String num, int t...

FILE: company/google/FindAllNumbersDisappearedInAnArray.java
  class FindAllNumbersDisappearedInAnArray (line 15) | class FindAllNumbersDisappearedInAnArray {
    method findDisappearedNumbers (line 16) | public List<Integer> findDisappearedNumbers(int[] nums) {

FILE: company/google/FindTheDifference.java
  class FindTheDifference (line 19) | public class FindTheDifference {
    method findTheDifference (line 20) | public char findTheDifference(String s, String t) {

FILE: company/google/FirstUniqueCharacterInAString.java
  class FirstUniqueCharacterInAString (line 12) | class FirstUniqueCharacterInAString {
    method firstUniqChar (line 13) | public int firstUniqChar(String s) {

FILE: company/google/FlattenNestedListIterator.java
  class FlattenNestedListIterator (line 32) | public class FlattenNestedListIterator implements Iterator<Integer> {
    method NestedIterator (line 35) | public NestedIterator(List<NestedInteger> nestedList) {
    method next (line 41) | @Override
    method hasNext (line 46) | @Override

FILE: company/google/GameOfLife.java
  class GameOfLife (line 15) | public class GameOfLife {
    method gameOfLife (line 16) | public void gameOfLife(int[][] board) {
    method liveNeighbors (line 45) | private int liveNeighbors(int[][] board, int m, int n, int i, int j) {

FILE: company/google/GeneralizedAbbreviation.java
  class GeneralizedAbbreviation (line 7) | public class GeneralizedAbbreviation {
    method generateAbbreviations (line 8) | public List<String> generateAbbreviations(String word) {
    method backtrack (line 16) | void backtrack(List result, String word, int position, String current,...

FILE: company/google/GenerateParentheses.java
  class GenerateParentheses (line 13) | class GenerateParentheses {
    method generateParenthesis (line 14) | public List<String> generateParenthesis(int n) {
    method generateParenthesisRecursive (line 21) | public void generateParenthesisRecursive(List<String> result, String c...

FILE: company/google/GroupShiftedStrings.java
  class GroupShiftedStrings (line 16) | public class GroupShiftedStrings {
    method groupStrings (line 17) | public List<List<String>> groupStrings(String[] strings) {

FILE: company/google/GuessNumberHigherOrLower.java
  class GuessNumberHigherOrLower (line 22) | public class GuessNumberHigherOrLower extends GuessGame {
    method guessNumber (line 23) | public int guessNumber(int n) {

FILE: company/google/ImplementTrie.java
  class TrieNode (line 11) | class TrieNode {
    method TrieNode (line 17) | public TrieNode(char character) {
  class Trie (line 24) | public class Trie {
    method Trie (line 27) | public Trie() {
    method insert (line 32) | public void insert(String word) {
    method search (line 47) | public boolean search(String word) {
    method startsWith (line 67) | public boolean startsWith(String prefix) {

FILE: company/google/InsertDeleteGetRandomO1.java
  class RandomizedSet (line 32) | class RandomizedSet {
    method RandomizedSet (line 37) | public RandomizedSet() {
    method insert (line 43) | public boolean insert(int val) {
    method remove (line 55) | public boolean remove(int val) {
    method getRandom (line 65) | public int getRandom() {

FILE: company/google/InsertInterval.java
  class InsertInterval (line 22) | public class InsertInterval {
    method insert (line 23) | public List<Interval> insert(List<Interval> intervals, Interval newInt...

FILE: company/google/IslandPerimeter.java
  class IslandPerimeter (line 12) | class IslandPerimeter {
    method islandPerimeter (line 13) | public int islandPerimeter(int[][] grid) {
    method numNeighbors (line 31) | public int numNeighbors(int[][] grid, int x, int y) {

FILE: company/google/JudgeRouteCircle.java
  class JudgeRouteCircle (line 12) | class JudgeRouteCircle {
    method judgeCircle (line 13) | public boolean judgeCircle(String moves) {

FILE: company/google/LetterCombinationsOfAPhoneNumber.java
  class LetterCombinationsOfAPhoneNumber (line 17) | class LetterCombinationsOfAPhoneNumber {
    method letterCombinations (line 18) | public List<String> letterCombinations(String digits) {
    method letterCombinationsRecursive (line 43) | public void letterCombinationsRecursive(List<String> result, String di...

FILE: company/google/LoggerRateLimiter.java
  class LoggerRateLimiter (line 29) | public class LoggerRateLimiter {
    method Logger (line 33) | public Logger() {
    method shouldPrintMessage (line 40) | public boolean shouldPrintMessage(int timestamp, String message) {

FILE: company/google/LongestConsecutiveSequence.java
  class LongestConsecutiveSequence (line 9) | class LongestConsecutiveSequence {
    method longestConsecutive (line 10) | public int longestConsecutive(int[] nums) {

FILE: company/google/LongestSubstringWithAtMostKDistinctCharacters.java
  class LongestSubstringWithAtMostKDistinctCharacters (line 7) | public class LongestSubstringWithAtMostKDistinctCharacters {
    method lengthOfLongestSubstringKDistinct (line 8) | public int lengthOfLongestSubstringKDistinct(String s, int k) {

FILE: company/google/MaximumProductOfWordLengths.java
  class MaximumProductOfWordLengths (line 18) | public class MaximumProductOfWordLengths {
    method maxProduct (line 19) | public int maxProduct(String[] words) {

FILE: company/google/MergeIntervals.java
  class MergeIntervals (line 16) | class MergeIntervals {
    method merge (line 17) | public List<Interval> merge(List<Interval> intervals) {

FILE: company/google/MinStack.java
  class MinStack (line 15) | class MinStack {
    class Node (line 16) | class Node {
      method Node (line 21) | public Node(int data, int min) {
    method MinStack (line 30) | public MinStack() {
    method push (line 34) | public void push(int x) {
    method pop (line 44) | public void pop() {
    method top (line 48) | public int top() {
    method getMin (line 52) | public int getMin() {

FILE: company/google/MissingRanges.java
  class MissingRanges (line 5) | public class MissingRanges {
    method findMissingRanges (line 6) | public List<String> findMissingRanges(int[] nums, int lower, int upper) {
    method addMissing (line 19) | void addMissing(ArrayList<String> result, long start, long end) {

FILE: company/google/MovingAverageFromDataStream.java
  class MovingAverageFromDataStream (line 16) | public class MovingAverageFromDataStream {
    method MovingAverage (line 22) | public MovingAverage(int size) {
    method next (line 27) | public double next(int val) {

FILE: company/google/NumberOfIslands.java
  class NumberOfIslands (line 19) | public class NumberOfIslands {
    method numIslands (line 22) | public int numIslands(char[][] grid) {
    method sink (line 41) | int sink(char[][] grid, int i, int j) {

FILE: company/google/PacificAtlanticWaterFlow.java
  class PacificAtlanticWaterFlow (line 27) | public class PacificAtlanticWaterFlow {
    method pacificAtlantic (line 28) | public List<int[]> pacificAtlantic(int[][] matrix) {
    method dfs (line 64) | public void dfs(int[][] matrix, boolean[][] visited, int height, int x...

FILE: company/google/PaintFence.java
  class PaintFence (line 10) | public class PaintFence {
    method numWays (line 11) | public int numWays(int n, int k) {

FILE: company/google/PlusOne.java
  class Solution (line 18) | class Solution {
    method plusOne (line 19) | public int[] plusOne(int[] digits) {

FILE: company/google/PlusOneLinkedList.java
  class PlusOneLinkedList (line 22) | public class PlusOneLinkedList {
    method plusOne (line 23) | public ListNode plusOne(ListNode head) {
    method plusOneRecursive (line 34) | private int plusOneRecursive(ListNode head) {

FILE: company/google/PowerOfTwo.java
  class PowerOfTwo (line 16) | class PowerOfTwo {
    method isPowerOfTwo (line 17) | public boolean isPowerOfTwo(int n) {

FILE: company/google/PowerOfXToTheN.java
  class PowerOfXToTheN (line 3) | public class PowerOfXToTheN {
    method myPow (line 4) | public double myPow(double x, int n) {

FILE: company/google/ReverseVowelsOfAString.java
  class ReverseVowelsOfAString (line 12) | public class ReverseVowelsOfAString {
    method reverseVowels (line 13) | public String reverseVowels(String s) {

FILE: company/google/SentenceScreenFitting.java
  class SentenceScreenFitting (line 54) | public class SentenceScreenFitting {
    method wordsTyping (line 55) | public int wordsTyping(String[] sentence, int rows, int cols) {

FILE: company/google/ShortestDistanceFromAllBuildings.java
  class ShortestDistanceFromAllBuildings (line 18) | public class ShortestDistanceFromAllBuildings {
    method shortestDistance (line 19) | public int shortestDistance(int[][] grid) {

FILE: company/google/SpiralMatrix.java
  class SpiralMatrix (line 22) | class SpiralMatrix {
    method spiralOrder (line 23) | public List<Integer> spiralOrder(int[][] matrix) {

FILE: company/google/StrobogrammaticNumber.java
  class StrobogrammaticNumber (line 7) | public class StrobogrammaticNumber {
    method isStrobogrammatic (line 8) | public boolean isStrobogrammatic(String num) {

FILE: company/google/SummaryRanges.java
  class SummaryRanges (line 5) | public class SummaryRanges {
    method summaryRanges (line 6) | public List<String> summaryRanges(int[] nums) {

FILE: company/google/TrappingRainWater.java
  class TrappingRainWater (line 6) | public class TrappingRainWater {
    method trap (line 7) | public int trap(int[] height) {

FILE: company/google/UniqueWordAbbreviation.java
  class UniqueWordAbbreviation (line 34) | public class UniqueWordAbbreviation {
    method ValidWordAbbr (line 37) | public ValidWordAbbr(String[] dictionary) {
    method isUnique (line 53) | public boolean isUnique(String word) {
    method getKey (line 57) | public String getKey(String word) {

FILE: company/google/Utf8Validation.java
  class Utf8Validation (line 34) | public class Utf8Validation {
    method validUtf8 (line 35) | public boolean validUtf8(int[] data) {

FILE: company/google/ValidParentheses.java
  class ValidParentheses (line 5) | public class ValidParentheses {
    method isValid (line 6) | public boolean isValid(String s) {

FILE: company/google/WallsAndGates.java
  class WallsAndGates (line 19) | public class WallsAndGates {
    method wallsAndGates (line 20) | public void wallsAndGates(int[][] rooms) {
    method dfs (line 31) | void dfs(int[][] rooms, int i, int j, int distance) {

FILE: company/google/WiggleSort.java
  class WiggleSort (line 5) | public class WiggleSort {
    method wiggleSort (line 6) | public void wiggleSort(int[] nums) {

FILE: company/google/WordBreak.java
  class WordBreak (line 9) | public class WordBreak {
    method wordBreak (line 10) | public boolean wordBreak(String s, Set<String> wordDict) {

FILE: company/google/WordSquares.java
  class WordSquares (line 18) | public class WordSquares {
    method wordSquares (line 19) | public List<List<String>> wordSquares(String[] words) {
    method helper (line 46) | public void helper(List<List<String>> ret, List<String> cur, int match...

FILE: company/google/ZigZagIterator.java
  class ZigZagIterator (line 17) | public class ZigZagIterator {
    method ZigzagIterator (line 22) | public ZigzagIterator(List<Integer> v1, List<Integer> v2) {
    method next (line 27) | public int next() {
    method hasNext (line 38) | public boolean hasNext() {

FILE: company/linkedin/BinarySearchTreeIterator.java
  class BinarySearchTreeIterator (line 17) | public class BinarySearchTreeIterator {
    method BSTIterator (line 20) | public BSTIterator(TreeNode root) {
    method hasNext (line 30) | public boolean hasNext() {
    method next (line 35) | public int next() {

FILE: company/linkedin/BinaryTreeLevelOrderTraversal.java
  class BinaryTreeLevelOrderTraversal (line 26) | public class BinaryTreeLevelOrderTraversal {
    method levelOrder (line 27) | public List<List<Integer>> levelOrder(TreeNode root) {

FILE: company/linkedin/FindTheCelebrity.java
  class FindTheCelebrity (line 12) | public class FindTheCelebrity extends Relation {
    method findCelebrity (line 13) | public int findCelebrity(int n) {

FILE: company/linkedin/HouseRobber.java
  class HouseRobber (line 5) | public class HouseRobber {
    method rob (line 6) | public int rob(int[] nums) {

FILE: company/linkedin/InsertInterval.java
  class InsertInterval (line 22) | public class InsertInterval {
    method insert (line 23) | public List<Interval> insert(List<Interval> intervals, Interval newInt...

FILE: company/linkedin/LowestCommonAncestorOfABinaryTree.java
  class LowestCommonAncestorOfABinaryTree (line 23) | public class LowestCommonAncestorOfABinaryTree {
    method lowestCommonAncestor (line 24) | public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNo...

FILE: company/linkedin/MaximumDepthOfABinaryTree.java
  class MaximumDepthOfABinaryTree (line 14) | public class MaximumDepthOfABinaryTree {
    method maxDepth (line 15) | public int maxDepth(TreeNode root) {

FILE: company/linkedin/MaximumProductSubarray.java
  class MaximumProductSubarray (line 6) | public class MaximumProductSubarray {
    method maxProduct (line 7) | public int maxProduct(int[] nums) {

FILE: company/linkedin/MaximumSubarray.java
  class MaximumSubarray (line 6) | public class MaximumSubarray {
    method maxSubArray (line 7) | public int maxSubArray(int[] nums) {

FILE: company/linkedin/MergeIntervals.java
  class MergeIntervals (line 16) | class MergeIntervals {
    method merge (line 17) | public List<Interval> merge(List<Interval> intervals) {

FILE: company/linkedin/MergeKSortedLists.java
  class MergeKSortedLists (line 11) | public class MergeKSortedLists {
    method mergeKLists (line 12) | public ListNode mergeKLists(ListNode[] lists) {

FILE: company/linkedin/MinimumWindowSubstring.java
  class MinimumWindowSubstring (line 13) | public class MinimumWindowSubstring {
    method minWindow (line 14) | public String minWindow(String s, String t) {

FILE: company/linkedin/PaintHouse.java
  class PaintHouse (line 12) | class PaintHouse {
    method minCost (line 13) | public int minCost(int[][] costs) {

FILE: company/linkedin/PalindromicSubstrings.java
  class PalindromicSubstrings (line 16) | class PalindromicSubstrings {
    method countSubstrings (line 18) | public int countSubstrings(String s) {
    method extendPalindrome (line 31) | public void extendPalindrome(String s, int left, int right) {

FILE: company/linkedin/Permutations.java
  class Permutations (line 14) | class Permutations {
    method permute (line 15) | public List<List<Integer>> permute(int[] nums) {

FILE: company/linkedin/PowerOfXToTheN.java
  class PowerOfXToTheN (line 3) | public class PowerOfXToTheN {
    method myPow (line 4) | public double myPow(double x, int n) {

FILE: company/linkedin/ProductOfArrayExceptSelf.java
  class ProductOfArrayExceptSelf (line 10) | public class ProductOfArrayExceptSelf {
    method productExceptSelf (line 11) | public int[] productExceptSelf(int[] nums) {

FILE: company/linkedin/SearchInRotatedSortedArray.java
  class SearchInRotatedSortedArray (line 9) | public class SearchInRotatedSortedArray {
    method search (line 10) | public int search(int[] nums, int target) {

FILE: company/linkedin/SparseMatrixMultiplication.java
  class SparseMatrixMultiplication (line 23) | public class SparseMatrixMultiplication {
    method multiply (line 24) | public int[][] multiply(int[][] A, int[][] B) {

FILE: company/linkedin/SymmetricTree.java
  class SymmetricTree (line 26) | public class SymmetricTree {
    method isSymmetric (line 27) | public boolean isSymmetric(TreeNode root) {
    method helper (line 35) | public boolean helper(TreeNode left, TreeNode right) {

FILE: company/linkedin/TwoSum.java
  class TwoSum (line 11) | public class TwoSum {
    method twoSum (line 12) | public int[] twoSum(int[] nums, int target) {

FILE: company/microsoft/AddDigits.java
  class AddDigits (line 9) | class AddDigits {
    method addDigits (line 10) | public int addDigits(int num) {

FILE: company/microsoft/FirstUniqueCharacterInAString.java
  class FirstUniqueCharacterInAString (line 12) | class FirstUniqueCharacterInAString {
    method firstUniqChar (line 13) | public int firstUniqChar(String s) {

FILE: company/microsoft/HouseRobberII.java
  class HouseRobberII (line 9) | class HouseRobberII {
    method rob (line 10) | public int rob(int[] nums) {

FILE: company/microsoft/LinkedListCycle.java
  class Solution (line 15) | public class Solution {
    method hasCycle (line 16) | public boolean hasCycle(ListNode head) {

FILE: company/microsoft/LongestIncreasingSubsequence.java
  class LongestIncreasingSubsequence (line 11) | class LongestIncreasingSubsequence {
    method lengthOfLIS (line 12) | public int lengthOfLIS(int[] nums) {

FILE: company/microsoft/LongestPalindromicSubstring.java
  class LongestPalindromicSubstring (line 13) | class LongestPalindromicSubstring {
    method longestPalindrome (line 14) | public String longestPalindrome(String s) {
    method isPalindrome (line 31) | public boolean isPalindrome(String s) {

FILE: company/microsoft/Permutations.java
  class Permutations (line 14) | class Permutations {
    method permute (line 15) | public List<List<Integer>> permute(int[] nums) {

FILE: company/microsoft/ReverseWordsInAString.java
  class ReverseWordsInAString (line 6) | public class ReverseWordsInAString {
    method reverseWords (line 7) | public String reverseWords(String s) {

FILE: company/microsoft/SpiralMatrix.java
  class SpiralMatrix (line 22) | class SpiralMatrix {
    method spiralOrder (line 23) | public List<Integer> spiralOrder(int[][] matrix) {

FILE: company/palantir/ContainsDuplicate.java
  class ContainsDuplicate (line 4) | class ContainsDuplicate {
    method containsDuplicate (line 5) | public boolean containsDuplicate(int[] nums) {

FILE: company/palantir/ContainsDuplicatesII.java
  class ContainsDuplicatesII (line 4) | class ContainsDuplicatesII {
    method containsNearbyDuplicate (line 5) | public boolean containsNearbyDuplicate(int[] nums, int k) {

FILE: company/snapchat/MinStack.java
  class MinStack (line 15) | class MinStack {
    class Node (line 16) | class Node {
      method Node (line 21) | public Node(int data, int min) {
    method MinStack (line 30) | public MinStack() {
    method push (line 34) | public void push(int x) {
    method pop (line 44) | public void pop() {
    method top (line 48) | public int top() {
    method getMin (line 52) | public int getMin() {

FILE: company/snapchat/ReverseWordsInAString.java
  class ReverseWordsInAString (line 6) | public class ReverseWordsInAString {
    method reverseWords (line 7) | public String reverseWords(String s) {

FILE: company/snapchat/ValidSudoku.java
  class ValidSudoku (line 8) | class ValidSudoku {
    method isValidSudoku (line 9) | public boolean isValidSudoku(char[][] board) {

FILE: company/twitter/FlattenNestedListIterator.java
  class FlattenNestedListIterator (line 32) | public class FlattenNestedListIterator implements Iterator<Integer> {
    method NestedIterator (line 35) | public NestedIterator(List<NestedInteger> nestedList) {
    method next (line 41) | @Override
    method hasNext (line 46) | @Override

FILE: company/twitter/ImplementTrie.java
  class TrieNode (line 11) | class TrieNode {
    method TrieNode (line 17) | public TrieNode(char character) {
  class Trie (line 24) | public class Trie {
    method Trie (line 27) | public Trie() {
    method insert (line 32) | public void insert(String word) {
    method search (line 48) | public boolean search(String word) {
    method startsWith (line 68) | public boolean startsWith(String prefix) {

FILE: company/twitter/InsertDeleteGetRandomO1.java
  class RandomizedSet (line 32) | class RandomizedSet {
    method RandomizedSet (line 37) | public RandomizedSet() {
    method insert (line 43) | public boolean insert(int val) {
    method remove (line 55) | public boolean remove(int val) {
    method getRandom (line 65) | public int getRandom() {

FILE: company/twitter/LowestCommonAncestorOfABinaryTree.java
  class LowestCommonAncestorOfABinaryTree (line 23) | public class LowestCommonAncestorOfABinaryTree {
    method lowestCommonAncestor (line 24) | public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNo...

FILE: company/twitter/MergeIntervals.java
  class MergeIntervals (line 16) | class MergeIntervals {
    method merge (line 17) | public List<Interval> merge(List<Interval> intervals) {

FILE: company/twitter/MergeKSortedLists.java
  class MergeKSortedLists (line 11) | public class MergeKSortedLists {
    method mergeKLists (line 12) | public ListNode mergeKLists(ListNode[] lists) {

FILE: company/twitter/MultiplyStrings.java
  class MultiplyStrings (line 10) | public class MultiplyStrings {
    method multiply (line 11) | public String multiply(String num1, String num2) {

FILE: company/twitter/OneEditDistance.java
  class OneEditDistance (line 3) | public class OneEditDistance {
    method isOneEditDistance (line 4) | public boolean isOneEditDistance(String s, String t) {

FILE: company/twitter/RegularExpressionMatching.java
  class RegularExpressionMatching (line 20) | public class RegularExpressionMatching {
    method isMatch (line 21) | public boolean isMatch(String s, String p) {

FILE: company/twitter/ReverseLinkedList.java
  class ReverseLinkedList (line 11) | public class ReverseLinkedList {
    method reverseList (line 12) | public ListNode reverseList(ListNode head) {

FILE: company/twitter/TrappingRainWater.java
  class TrappingRainWater (line 6) | public class TrappingRainWater {
    method trap (line 7) | public int trap(int[] height) {

FILE: company/twitter/ValidParentheses.java
  class ValidParentheses (line 5) | public class ValidParentheses {
    method isValid (line 6) | public boolean isValid(String s) {

FILE: company/uber/BestTimeToBuyOrSellStock.java
  class BestTimeToBuyAndSellStock (line 16) | public class BestTimeToBuyAndSellStock {
    method maxProfit (line 17) | public int maxProfit(int[] prices) {

FILE: company/uber/CloneGraph.java
  class CloneGraph (line 31) | public class CloneGraph {
    method cloneGraph (line 34) | public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {

FILE: company/uber/DecodeWays.java
  class DecodeWays (line 15) | public class DecodeWays {
    method numDecodings (line 16) | public int numDecodings(String s) {

FILE: company/uber/EncodeAndDecodeTinyURL.java
  class EncodeAndDecodeTinyURL (line 8) | public class EncodeAndDecodeTinyURL {
    method getKey (line 13) | public String getKey() {
    method encode (line 25) | public String encode(String longUrl) {
    method decode (line 34) | public String decode(String shortUrl) {

FILE: company/uber/ExclusiveTimeOfFunctions.java
  class ExclusiveTimeOfFunctions (line 30) | class ExclusiveTimeOfFunctions {
    method exclusiveTime (line 31) | public int[] exclusiveTime(int n, List<String> logs) {

FILE: company/uber/GenerateParentheses.java
  class GenerateParentheses (line 1) | class GenerateParentheses {
    method generateParenthesis (line 2) | public List<String> generateParenthesis(int n) {
    method generateParenthesisRecursive (line 9) | public void generateParenthesisRecursive(List<String> result, String c...

FILE: company/uber/GroupAnagrams.java
  class GroupAnagrams (line 13) | public class GroupAnagrams {
    method groupAnagrams (line 14) | public List<List<String>> groupAnagrams(String[] strs) {

FILE: company/uber/GroupShiftedStrings.java
  class GroupShiftedStrings (line 16) | public class GroupShiftedStrings {
    method groupStrings (line 17) | public List<List<String>> groupStrings(String[] strings) {

FILE: company/uber/ImplementTrie.java
  class TrieNode (line 11) | class TrieNode {
    method TrieNode (line 17) | public TrieNode(char character) {
  class ImplementTrie (line 24) | public class ImplementTrie {
    method Trie (line 27) | public Trie() {
    method insert (line 32) | public void insert(String word) {
    method search (line 47) | public boolean search(String word) {
    method startsWith (line 67) | public boolean startsWith(String prefix) {

FILE: company/uber/InsertDeleteGetRandomO1.java
  class RandomizedSet (line 32) | class RandomizedSet {
    method RandomizedSet (line 37) | public RandomizedSet() {
    method insert (line 43) | public boolean insert(int val) {
    method remove (line 55) | public boolean remove(int val) {
    method getRandom (line 65) | public int getRandom() {

FILE: company/uber/LetterCombinationsOfAPhoneNumber.java
  class LetterCombinationsOfAPhoneNumber (line 17) | class LetterCombinationsOfAPhoneNumber {
    method letterCombinations (line 18) | public List<String> letterCombinations(String digits) {
    method letterCombinationsRecursive (line 43) | public void letterCombinationsRecursive(List<String> result, String di...

FILE: company/uber/MaximumDepthOfABinaryTree.java
  class MaximumDepthOfABinaryTree (line 14) | public class MaximumDepthOfABinaryTree {
    method maxDepth (line 15) | public int maxDepth(TreeNode root) {

FILE: company/uber/MergeKSortedLists.java
  class MergeKSortedLists (line 11) | public class MergeKSortedLists {
    method mergeKLists (line 12) | public ListNode mergeKLists(ListNode[] lists) {

FILE: company/uber/MinStack.java
  class MinStack (line 15) | class MinStack {
    class Node (line 16) | class Node {
      method Node (line 21) | public Node(int data, int min) {
    method MinStack (line 30) | public MinStack() {
    method push (line 34) | public void push(int x) {
    method pop (line 44) | public void pop() {
    method top (line 48) | public int top() {
    method getMin (line 52) | public int getMin() {

FILE: company/uber/MinimumWindowSubstring.java
  class MinimumWindowSubstring (line 13) | public class MinimumWindowSubstring {
    method minWindow (line 14) | public String minWindow(String s, String t) {

FILE: company/uber/OneEditDistance.java
  class OneEditDistance (line 3) | public class OneEditDistance {
    method isOneEditDistance (line 4) | public boolean isOneEditDistance(String s, String t) {

FILE: company/uber/PalindromePermutation.java
  class PalindromePermutation (line 1) | public class PalindromePermutation {
    method canPermutePalindrome (line 2) | public boolean canPermutePalindrome(String s) {

FILE: company/uber/RegularExpressionMatching.java
  class RegularExpressionMatching (line 20) | public class RegularExpressionMatching {
    method isMatch (line 21) | public boolean isMatch(String s, String p) {

FILE: company/uber/ReverseLinkedList.java
  class ReverseLinkedList (line 11) | public class ReverseLinkedList {
    method reverseList (line 12) | public ListNode reverseList(ListNode head) {

FILE: company/uber/RomanToInteger.java
  class RomanToInteger (line 5) | public class RomanToInteger {
    method romanToInt (line 6) | public int romanToInt(String s) {

FILE: company/uber/SearchInRotatedSortedArray.java
  class SearchInRotatedSortedArray (line 9) | public class SearchInRotatedSortedArray {
    method search (line 10) | public int search(int[] nums, int target) {

FILE: company/uber/SpiralMatrix.java
  class SpiralMatrix (line 22) | class SpiralMatrix {
    method spiralOrder (line 23) | public List<Integer> spiralOrder(int[][] matrix) {

FILE: company/uber/Subsets.java
  class Subsets (line 19) | public class Subsets {
    method subsets (line 20) | public List<List<Integer>> subsets(int[] nums) {
    method recurse (line 29) | private void recurse(List<List<Integer>> result, int[] nums, Stack pat...

FILE: company/uber/TwoSum.java
  class TwoSum (line 11) | public class TwoSum {
    method twoSum (line 12) | public int[] twoSum(int[] nums, int target) {

FILE: company/uber/ValidPalindrome.java
  class ValidPalindrome (line 1) | public class ValidPalindrome {
    method isPalindrome (line 2) | public boolean isPalindrome(String s) {

FILE: company/uber/ValidSudoku.java
  class ValidSudoku (line 8) | class ValidSudoku {
    method isValidSudoku (line 9) | public boolean isValidSudoku(char[][] board) {

FILE: company/uber/WordBreak.java
  class WordBreak (line 9) | public class WordBreak {
    method wordBreak (line 10) | public boolean wordBreak(String s, Set<String> wordDict) {

FILE: company/yahoo/ContainsDuplicate.java
  class ContainsDuplicate (line 4) | class ContainsDuplicate {
    method containsDuplicate (line 5) | public boolean containsDuplicate(int[] nums) {

FILE: company/yahoo/LinkedListCycle.java
  class Solution (line 15) | public class Solution {
    method hasCycle (line 16) | public boolean hasCycle(ListNode head) {

FILE: company/yelp/InsertDeleteGetRandomO1.java
  class RandomizedSet (line 32) | class RandomizedSet {
    method RandomizedSet (line 37) | public RandomizedSet() {
    method insert (line 43) | public boolean insert(int val) {
    method remove (line 55) | public boolean remove(int val) {
    method getRandom (line 65) | public int getRandom() {

FILE: company/yelp/ReverseWordsInAString.java
  class ReverseWordsInAString (line 6) | public class ReverseWordsInAString {
    method reverseWords (line 7) | public String reverseWords(String s) {

FILE: cracking-the-coding-interview/chapter-five-bit-manipulation/BinaryRepresentation.java
  class BinaryRepresentation (line 5) | public class BinaryRepresentation {
    method printBinary (line 6) | public static String printBinary(double num) {

FILE: cracking-the-coding-interview/chapter-five-bit-manipulation/FindMissingInteger.java
  class FindMissingInteger (line 7) | public class FindMissingInteger {
    method findMissing (line 8) | public int findMissing(ArrayList<BigInteger> array) {
    method findMissing (line 13) | public int findMissing(ArrayList<BigInteger> input, int column) {

FILE: cracking-the-coding-interview/chapter-five-bit-manipulation/InsertMIntoN.java
  class InsertMIntoN (line 10) | public class InsertMIntoN {
    method updateBits (line 11) | int updateBits(int n, int m, int i, int j) {

FILE: cracking-the-coding-interview/chapter-five-bit-manipulation/SwapBits.java
  class SwapBits (line 4) | public class SwapBits {
    method swapOddEvenBits (line 5) | public int swapOddEvenBits(int x) {

FILE: cracking-the-coding-interview/chapter-four-trees-and-graphs/BinaryTreeIsBalanced.java
  class BinaryTreeIsBalanaced (line 5) | public class BinaryTreeIsBalanaced {
    method getHeight (line 6) | public static int getHeight(TreeNode root) {
    method isBalanced (line 13) | public static boolean isBalanced(TreeNode root) {

FILE: cracking-the-coding-interview/chapter-four-trees-and-graphs/CreateBinarySearchTree.java
  class CreateBinarySearchTree (line 4) | public class CreateBinarySearchTree {
    method createMinimalBST (line 5) | TreeNode createMinimalBST(int arr[], int start, int end) {
    method createMinimalBST (line 16) | TreeNode createMinimalBST(int array[]) {

FILE: cracking-the-coding-interview/chapter-four-trees-and-graphs/CreateLinkedListForEachLevel.java
  class CreateLinkedListForEachLevel (line 4) | public class CreateLinkedListForEachLevel {
    method createLinkedList (line 5) | ArrayList<LinkedList<TreeNode>> createLinkedList(TreeNode root) {

FILE: cracking-the-coding-interview/chapter-four-trees-and-graphs/FindPath.java
  class FindPath (line 3) | public class FindPath {
    type State (line 4) | public enum State {
    method search (line 8) | public static boolean search(Graph g, Node start, Node end) {

FILE: cracking-the-coding-interview/chapter-four-trees-and-graphs/IsSubtree.java
  class IsSubtree (line 6) | public class IsSubtree {
    method containsTree (line 7) | boolean containsTree(TreeNode t1, TreeNode t2) {
    method subTree (line 14) | boolean subTree(TreeNode r1, TreeNode r2) {
    method matchTree (line 24) | boolean matchTree(TreeNode r1, TreeNode r2) {

FILE: cracking-the-coding-interview/chapter-four-trees-and-graphs/PrintPaths.java
  class PrintPaths (line 5) | public class PrintPaths {
    method findSum (line 6) | void findSum(TreeNode node, int sum, int[] path, int level) {
    method findSum (line 32) | void findSum(TreeNode node, int sum) {
    method print (line 38) | void print(int[] path, int start, int end) {
    method depth (line 45) | int depth(TreeNode node) {

FILE: cracking-the-coding-interview/chapter-four-trees-and-graphs/ValidBinarySearchTree.java
  class ValidBinarySearchTree (line 3) | public class ValidBinarySearchTree {
    method checkBST (line 4) | boolean checkBST(TreeNode n) {
    method checkBST (line 8) | boolean checkBST(TreeNode n, Integer min, Integer max) {

FILE: cracking-the-coding-interview/chapter-nine-recursion-and-dynamic-programming/AllPermutations.java
  class AllPermutations (line 3) | public class AllPermutations {
    method getPerms (line 4) | public static ArrayList<String> getPerms(String str) {
    method insertCharAt (line 26) | public static String insertCharAt(String word, char c, int i) {

FILE: cracking-the-coding-interview/chapter-nine-recursion-and-dynamic-programming/AllSubsets.java
  class AllSubsets (line 3) | public class AllSubsets {
    method getSubsets (line 4) | ArrayList<ArrayList<Integer>> getSubsets(ArrayList<Integer> set, int i...

FILE: cracking-the-coding-interview/chapter-nine-recursion-and-dynamic-programming/EightQueens.java
  class EightQueens (line 5) | public class EightQueens {
    method placeQueens (line 8) | void placeQueens(int row, Integer[] columns, ArrayList<Integer[]> resu...
    method checkValid (line 26) | boolean checkValid(Integer[] columns, int row1, int column1) {

FILE: cracking-the-coding-interview/chapter-nine-recursion-and-dynamic-programming/MagicIndex.java
  class MagicIndex (line 4) | public class MagicIndex {
    method magicFast (line 5) | public static int magicFast(int[] array, int start, int end) {
    method magicFast (line 21) | public static int magicFast(int[] array) {

FILE: cracking-the-coding-interview/chapter-nine-recursion-and-dynamic-programming/RepresentingNCents.java
  class RepresentingNCents (line 4) | public class RepresentingNCents {
    method makeChange (line 5) | int makeChange(int n) {
    method makeChange (line 11) | int makeChange(int amount, int[] denoms, int index, int[][] map) {

FILE: cracking-the-coding-interview/chapter-nine-recursion-and-dynamic-programming/StackBoxes.java
  class StackBoxes (line 6) | public class StackBoxes {
    method createStackDP (line 7) | public ArrayList<Box> createStackDP(Box[] boxes, Box bottom, HashMap<B...

FILE: cracking-the-coding-interview/chapter-nine-recursion-and-dynamic-programming/Staircase.java
  class Staircase (line 4) | public class Staircase {
    method countWaysDP (line 5) | public static int countWaysDP(int n, int[] map) {

FILE: cracking-the-coding-interview/chapter-one-arrays-and-strings/DeleteDups.java
  class RemoveDups (line 3) | public class RemoveDups {
    method deleteDups (line 4) | void deleteDups(LinkedListNode n) {

FILE: cracking-the-coding-interview/chapter-one-arrays-and-strings/IsRotation.java
  class IsRotation (line 5) | public class IsRotation {
    method isRotation (line 6) | public boolean isRotation(String s1, String s2) {

FILE: cracking-the-coding-interview/chapter-one-arrays-and-strings/IsUniqueChars.java
  class IsUniqueChars (line 3) | public class IsUniqueChars {
    method isUniqueChars (line 4) | public boolean isUniqueChars(String str) {

FILE: cracking-the-coding-interview/chapter-one-arrays-and-strings/NthToLast.java
  class NthToLast (line 3) | public class NthToLast {
    method nthToLast (line 4) | LinkedListNode nthToLast(LinkedListNode head, int k) {

FILE: cracking-the-coding-interview/chapter-one-arrays-and-strings/Permutation.java
  class Permutation (line 3) | public class Permutation {
    method permutation (line 4) | public boolean permutation(String s, String t) {

FILE: cracking-the-coding-interview/chapter-one-arrays-and-strings/ReplaceSpaces.java
  class ReplaceSpaces (line 6) | public class ReplaceSpaces {
    method replaceSpaces (line 7) | public void replaceSpaces(char[] str, int length) {

FILE: cracking-the-coding-interview/chapter-seven-mathematics-and-probability/Operations.java
  class Operations (line 3) | public class Operations {
    method negate (line 5) | public static int negate(int a) {
    method minus (line 16) | public static int minus(int a, int b) {
    method multiply (line 21) | public static int multiply(int a, int b) {
    method abs (line 36) | public static int abs(int a) {
    method divide (line 45) | public int divide(int a, int b) throws ArithmeticException {

FILE: cracking-the-coding-interview/chapter-seven-mathematics-and-probability/WouldIntersect.java
  class WouldIntersect (line 3) | public class WouldIntersect {
  class Line (line 7) | class Line {
    method Line (line 12) | public Line(double s, double y) {
    method Intersect (line 17) | public boolean Intersect(Line line2) {

FILE: cracking-the-coding-interview/chapter-three-stacks-and-queues/BinaryTreeIsBalanced.java
  class BinaryTreeIsBalanaced (line 5) | public class BinaryTreeIsBalanaced {
    method getHeight (line 6) | public static int getHeight(TreeNode root) {
    method isBalanced (line 13) | public static boolean isBalanced(TreeNode root) {

FILE: cracking-the-coding-interview/chapter-three-stacks-and-queues/MyQUeue.java
  class MyQueue (line 3) | public class MyQueue<T> {
    method MyQueue (line 6) | public MyQueue() {
    method size (line 11) | public int size() {
    method add (line 15) | public void add(T value) {
    method shiftStacks (line 23) | private void shiftStacks() {
    method peek (line 31) | public T peek() {
    method remove (line 36) | public T remove() {

FILE: cracking-the-coding-interview/chapter-three-stacks-and-queues/MyQueue.java
  class MyQueue (line 3) | public class MyQueue<T> {
    method MyQueue (line 6) | public MyQueue() {
    method size (line 11) | public int size() {
    method add (line 15) | public void add(T value) {
    method shiftStacks (line 23) | private void shiftStacks() {
    method peek (line 31) | public T peek() {
    method remove (line 36) | public T remove() {

FILE: cracking-the-coding-interview/chapter-three-stacks-and-queues/QueueUsingTwoStacks.java
  class QueueUsingTwoStacks (line 3) | public class QueueUsingTwoStacks {

FILE: cracking-the-coding-interview/chapter-three-stacks-and-queues/SetOfStacks.java
  class SetOfStacks (line 10) | public class SetOfStacks {
    method push (line 15) | public void push(int v) {
    method pop (line 27) | public void pop() {
    method getLastStack (line 36) | public Stack getLastStack() {

FILE: cracking-the-coding-interview/chapter-three-stacks-and-queues/SortStack.java
  class SortStack (line 6) | public class SortStack {
    method sort (line 7) | public static Stack<Integer> sort(Stack<Integer> s) {

FILE: cracking-the-coding-interview/chapter-three-stacks-and-queues/StackWithMin.java
  class StackWithMin (line 3) | public class StackWithMin extends Stack<NodeWithMin> {
    method push (line 4) | public void push(int value) {
    method min (line 9) | public int min() {
  class NodeWithMin (line 19) | class NodeWithMin {
    method NodeWithMin (line 22) | public NodeWithMin(int v, int min) {

FILE: cracking-the-coding-interview/chapter-three-stacks-and-queues/ThreeStacks.java
  class ThreeStacks (line 3) | public class ThreeStacks {
    method push (line 8) | void push(int stackNum, int value) throws Exception {
    method pop (line 18) | int pop(int stackNum) throws Exception {
    method peek (line 28) | int peek(int stackNum) {
    method isEmpty (line 36) | boolean isEmpty(int stackNum) {
    method absTopOfStack (line 41) | int absTopOfStack(int stasckNum) {

FILE: cracking-the-coding-interview/chapter-three-stacks-and-queues/TowersOfHanoi.java
  class TowersOfHanoi (line 10) | public class TowersOfHanoi {
    method main (line 11) | public static void main(String args[]) {
  class Tower (line 25) | public class Tower {
    method Tower (line 28) | public Tower(int i) {
    method index (line 33) | public int index() {
    method add (line 37) | public void add(int d) {
    method moveTopTo (line 46) | public void moveTopTo(Tower t) {
    method moveDisks (line 52) | public void moveDisks(int n, Tower destination, Tower buffer) {

FILE: cracking-the-coding-interview/chapter-two-linked-lists/DeleteDups.java
  class RemoveDups (line 3) | public class RemoveDups {
    method deleteDups (line 4) | void deleteDups(LinkedListNode n) {

FILE: cracking-the-coding-interview/chapter-two-linked-lists/DeleteNode.java
  class DeleteNode (line 3) | public class DeleteNode {
    method deleteNode (line 4) | public static boolean deleteNode(LinkedListNode n) {

FILE: cracking-the-coding-interview/chapter-two-linked-lists/FindBeginning.java
  class FindBeginning (line 4) | public class FindBeginning {
    method findBeginning (line 5) | LinkedListNode findBeginning(LinkedListNode head) {

FILE: cracking-the-coding-interview/chapter-two-linked-lists/IsPalindrome.java
  class IsPalindrome (line 4) | public class IsPalindrome {
    method isPalindrome (line 5) | boolean isPalindrome(LinkedListNode head) {

FILE: cracking-the-coding-interview/chapter-two-linked-lists/Partition.java
  class Partition (line 4) | public class Partition {
    method partition (line 5) | LinkedListNode partition(LinkedListNode node, int x) {

FILE: leetcode/array/BestTimeToBuyAndSellStock.java
  class BestTimeToBuyAndSellStock (line 16) | public class BestTimeToBuyAndSellStock {
    method maxProfit (line 17) | public int maxProfit(int[] prices) {

FILE: leetcode/array/ContainsDuplicatesII.java
  class ContainsDuplicatesII (line 4) | class ContainsDuplicatesII {
    method containsNearbyDuplicate (line 5) | public boolean containsNearbyDuplicate(int[] nums, int k) {

FILE: leetcode/array/FindAllNumbersDisappearedInAnArray.java
  class FindAllNumbersDisappearedInAnArray (line 15) | class FindAllNumbersDisappearedInAnArray {
    method findDisappearedNumbers (line 16) | public List<Integer> findDisappearedNumbers(int[] nums) {

FILE: leetcode/array/FindTheCelebrity.java
  class FindTheCelebrity (line 12) | public class FindTheCelebrity extends Relation {
    method findCelebrity (line 13) | public int findCelebrity(int n) {

FILE: leetcode/array/GameOfLife.java
  class GameOfLife (line 15) | public class GameOfLife {
    method gameOfLife (line 16) | public void gameOfLife(int[][] board) {
    method liveNeighbors (line 45) | private int liveNeighbors(int[][] board, int m, int n, int i, int j) {

FILE: leetcode/array/IncreasingTripletSubsequence.java
  class IncreasingTripletSequence (line 15) | public class IncreasingTripletSequence {
    method increasingTriplet (line 16) | public boolean increasingTriplet(int[] nums) {

FILE: leetcode/array/InsertDeleteGetRandomO1.java
  class RandomizedSet (line 32) | class RandomizedSet {
    method RandomizedSet (line 37) | public RandomizedSet() {
    method insert (line 43) | public boolean insert(int val) {
    method remove (line 55) | public boolean remove(int val) {
    method getRandom (line 65) | public int getRandom() {

FILE: leetcode/array/InsertInterval.java
  class InsertInterval (line 22) | public class InsertInterval {
    method insert (line 23) | public List<Interval> insert(List<Interval> intervals, Interval newInt...

FILE: leetcode/array/LongestConsecutiveSequence.java
  class LongestConsecutiveSequence (line 9) | class LongestConsecutiveSequence {
    method longestConsecutive (line 10) | public int longestConsecutive(int[] nums) {

FILE: leetcode/array/MajorityElement.java
  class MajorityElement (line 4) | class MajorityElement {
    method majorityElement (line 5) | public int majorityElement(int[] nums) {

FILE: leetcode/array/MaximumProductSubarray.java
  class MaximumProductSubarray (line 6) | public class MaximumProductSubarray {
    method maxProduct (line 7) | public int maxProduct(int[] nums) {

FILE: leetcode/array/MaximumSubarray.java
  class Solution (line 6) | public class Solution {
    method maxSubArray (line 8) | public int maxSubArray(int[] nums) {

FILE: leetcode/array/MergeIntervals.java
  class MergeIntervals (line 16) | class MergeIntervals {
    method merge (line 17) | public List<Interval> merge(List<Interval> intervals) {

FILE: leetcode/array/MinCostClimbingStairs.java
  class MinCostClimbingStairs (line 17) | class MinCostClimbingStairs {
    method minCostClimbingStairs (line 18) | public int minCostClimbingStairs(int[] cost) {

FILE: leetcode/array/MinimumPathSum.java
  class MinimumPathSum (line 10) | class MinimumPathSum {
    method minPathSum (line 11) | public int minPathSum(int[][] grid) {

FILE: leetcode/array/MissingRanges.java
  class MissingRanges (line 5) | public class MissingRanges {
    method findMissingRanges (line 6) | public List<String> findMissingRanges(int[] nums, int lower, int upper) {
    method addMissing (line 17) | void addMissing(ArrayList<String> result, long start, long end) {

FILE: leetcode/array/PlusOne.java
  class Solution (line 18) | class Solution {
    method plusOne (line 19) | public int[] plusOne(int[] digits) {

FILE: leetcode/array/ProductofArrayExceptSelf.java
  class ProductOfArrayExceptSelf (line 10) | public class ProductOfArrayExceptSelf {
    method productExceptSelf (line 11) | public int[] productExceptSelf(int[] nums) {

FILE: leetcode/array/RemoveElement.java
  class RemoveElement (line 9) | class RemoveElement {
    method removeElement (line 10) | public int removeElement(int[] nums, int val) {

FILE: leetcode/array/RotateImage.java
  class RotateImage (line 8) | public class RotateImage {
    method rotate (line 9) | public void rotate(int[][] matrix) {

FILE: leetcode/array/SearchInRotatedSortedArray.java
  class SearchInRotatedSortedArray (line 9) | public class SearchInRotatedSortedArray {
    method search (line 10) | public int search(int[] nums, int target) {

FILE: leetcode/array/SpiralMatrix.java
  class SpiralMatrix (line 22) | class SpiralMatrix {
    method spiralOrder (line 23) | public List<Integer> spiralOrder(int[][] matrix) {

FILE: leetcode/array/SpiralMatrixII.java
  class SpiralMatrix (line 13) | public class SpiralMatrix {
    method generateMatrix (line 14) | public int[][] generateMatrix(int n) {

FILE: leetcode/array/Subsets.java
  class Subsets (line 19) | public class Subsets {
    method subsets (line 20) | public List<List<Integer>> subsets(int[] nums) {
    method recurse (line 28) | private void recurse(List<List<Integer>> result, int[] nums, Stack pat...

FILE: leetcode/array/SubsetsII.java
  class SubsetsII (line 17) | public class SubsetsII {
    method subsetsWithDup (line 18) | public List<List<Integer>> subsetsWithDup(int[] nums) {
    method helper (line 33) | public void helper(int[] nums, ArrayList<Integer> current, int index, ...

FILE: leetcode/array/SummaryRanges.java
  class SummaryRanges (line 5) | public class SummaryRanges {
    method summaryRanges (line 6) | public List<String> summaryRanges(int[] nums) {

FILE: leetcode/array/UniquePaths.java
  class UniquePaths (line 7) | class UniquePaths {
    method uniquePaths (line 8) | public int uniquePaths(int m, int n) {

FILE: leetcode/array/WiggleSort.java
  class WiggleSort (line 5) | public class WiggleSort {
    method wiggleSort (line 6) | public void wiggleSort(int[] nums) {

FILE: leetcode/array/WordSearch.java
  class WordSearch (line 17) | public class WordSearch {
    method exist (line 18) | public boolean exist(char[][] board, String word) {
    method search (line 32) | public boolean search(char[][] board, int i, int j, char[] w, int inde...

FILE: leetcode/backtracking/AndroidUnlockPatterns.java
  class AndroidUnlockPatterns (line 28) | public class AndroidUnlockPatterns {
    method numberOfPatterns (line 29) | public int numberOfPatterns(int m, int n) {
    method DFS (line 56) | int DFS(boolean visited[], int[][] skip, int current, int remaining) {

FILE: leetcode/backtracking/GeneralizedAbbreviation.java
  class GeneralizedAbbreviation (line 7) | public class GeneralizedAbbreviation {
    method generateAbbreviations (line 8) | public List<String> generateAbbreviations(String word) {
    method backtrack (line 16) | void backtrack(List result, String word, int position, String current,...

FILE: leetcode/backtracking/GenerateParentheses.java
  class GenerateParentheses (line 13) | class GenerateParentheses {
    method generateParenthesis (line 14) | public List<String> generateParenthesis(int n) {
    method generateParenthesisRecursive (line 21) | public void generateParenthesisRecursive(List<String> result, String c...

FILE: leetcode/backtracking/LetterCombinationsOfAPhoneNumber.java
  class LetterCombinationsOfAPhoneNumber (line 17) | class LetterCombinationsOfAPhoneNumber {
    method letterCombinations (line 18) | public List<String> letterCombinations(String digits) {
    method letterCombinationsRecursive (line 43) | public void letterCombinationsRecursive(List<String> result, String di...

FILE: leetcode/backtracking/Permutations.java
  class Permutations (line 14) | class Permutations {
    method permute (line 15) | public List<List<Integer>> permute(int[] nums) {

FILE: leetcode/binary-search/ClosestBinarySearchTreeValue.java
  class ClosestBinarySearchTreeValue (line 16) | public class ClosestBinarySearchTreeValue {
    method closestValue (line 17) | public int closestValue(TreeNode root, double target) {

FILE: leetcode/binary-search/FirstBadVersion.java
  class FirstBadVersion (line 10) | public class FirstBadVersion extends VersionControl {
    method firstBadVersion (line 11) | public int firstBadVersion(int n) {

FILE: leetcode/binary-search/GuessNumberHigherOrLower.java
  class GuessNumberHigherOrLower (line 17) | public class GuessNumberHigherOrLower extends GuessGame {
    method guessNumber (line 18) | public int guessNumber(int n) {

FILE: leetcode/binary-search/PowerOfXToTheN.java
  class PowerOfXToTheN (line 3) | public class PowerOfXToTheN {
    method myPow (line 4) | public double myPow(double x, int n) {

FILE: leetcode/binary-search/SquareRootX.java
  class Solution (line 5) | public class Solution {
    method mySqrt (line 6) | public int mySqrt(int x) {

FILE: leetcode/bit-manipulation/BinaryWatch.java
  class BinaryWatch (line 18) | public class BinaryWatch {
    method readBinaryWatch (line 19) | public List<String> readBinaryWatch(int num) {

FILE: leetcode/bit-manipulation/CountingBits.java
  class CountingBits (line 6) | public class CountingBits {
    method countBits (line 7) | public int[] countBits(int num) {

FILE: leetcode/bit-manipulation/HammingDistance.java
  class HammingDistance (line 21) | public class HammingDistance {
    method hammingDistance (line 22) | public int hammingDistance(int x, int y) {

FILE: leetcode/bit-manipulation/MaximumProductOfWordLengths.java
  class MaximumProductOfWordLengths (line 18) | public class MaximumProductOfWordLengths {
    method maxProduct (line 19) | public int maxProduct(String[] words) {

FILE: leetcode/bit-manipulation/NumberOfOneBits.java
  class NumberOfOneBits (line 5) | public class NumberOfOneBits {
    method hammingWeight (line 7) | public int hammingWeight(int n) {

FILE: leetcode/bit-manipulation/PowerOfTwo.java
  class PowerOfTwo (line 16) | class PowerOfTwo {
    method isPowerOfTwo (line 17) | public boolean isPowerOfTwo(int n) {

FILE: leetcode/bit-manipulation/SumOfTwoInteger.java
  class SumOfTwoIntegers (line 6) | public class SumOfTwoIntegers {
    method getSum (line 7) | public int getSum(int a, int b) {

FILE: leetcode/bit-manipulation/Utf8Validation.java
  class Utf8Validation (line 34) | public class Utf8Validation {
    method validUtf8 (line 35) | public boolean validUtf8(int[] data) {

FILE: leetcode/brainteaser/BulbSwitcher.java
  class BulbSwitcher (line 12) | class BulbSwitcher {
    method bulbSwitch (line 13) | public int bulbSwitch(int n) {

FILE: leetcode/breadth-first-search/BinaryTreeLevelOrderTraversal.java
  class BinarySearchTreeLevelOrderTraversal (line 26) | public class BinarySearchTreeLevelOrderTraversal {
    method levelOrder (line 27) | public List<List<Integer>> levelOrder(TreeNode root) {

FILE: leetcode/breadth-first-search/CloneGraph.java
  class CloneGraph (line 31) | public class CloneGraph {
    method cloneGraph (line 34) | public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {

FILE: leetcode/breadth-first-search/PacificAtlanticWaterFlow.java
  class PacificAtlanticWaterFlow (line 27) | public class PacificAtlanticWaterFlow {
    method pacificAtlantic (line 28) | public List<int[]> pacificAtlantic(int[][] matrix) {
    method dfs (line 63) | public void dfs(int[][] matrix, boolean[][] visited, int height, int x...

FILE: leetcode/breadth-first-search/RemoveInvalidParentheses.java
  class RemoveInvalidParentheses (line 10) | public class RemoveInvalidParentheses {
    method removeInvalidParentheses (line 11) | public List<String> removeInvalidParentheses(String s) {
    method remove (line 17) | public void remove(String s, List<String> result, int last_i, int last...

FILE: leetcode/breadth-first-search/ShortestDistanceFromAllBuildings.java
  class Shortest (line 18) | public class Shortest {
    method shortestDistance (line 19) | public int shortestDistance(int[][] grid) {

FILE: leetcode/breadth-first-search/SymmetricTree.java
  class SymmetricTree (line 26) | public class SymmetricTree {
    method isSymmetric (line 27) | public boolean isSymmetric(TreeNode root) {
    method helper (line 35) | public boolean helper(TreeNode left, TreeNode right) {

FILE: leetcode/breadth-first-search/WallsAndGates.java
  class Solution (line 19) | public class Solution {
    method wallsAndGates (line 20) | public void wallsAndGates(int[][] rooms) {
    method dfs (line 31) | void dfs(int[][] rooms, int i, int j, int distance) {

FILE: leetcode/depth-first-search/BalancedBinaryTree.java
  class BalancedBinaryTree (line 14) | public class BalancedBinaryTree {
    method isBalanced (line 17) | public boolean isBalanced(TreeNode root) {
    method height (line 22) | private int height(TreeNode root) {

FILE: leetcode/depth-first-search/BattleshipsInABoard.java
  class BattleshipsInABoard (line 22) | public class BattleshipsInABoard {
    method countBattleships (line 23) | public int countBattleships(char[][] board) {
    method sink (line 38) | public void sink(char[][] board, int i, int j, int numberOfShips) {

FILE: leetcode/depth-first-search/ConvertSortedArrayToBinarySearchTree.java
  class ConvertSortedArrayToBinarySearchTree (line 12) | public class ConvertSortedArrayToBinarySearchTree {
    method sortedArrayToBST (line 13) | public TreeNode sortedArrayToBST(int[] nums) {
    method helper (line 23) | private TreeNode helper(int[] nums, int start, int end) {

FILE: leetcode/depth-first-search/MaximumDepthOfABinaryTree.java
  class MaximumDepthOfABinaryTree (line 14) | public class MaximumDepthOfABinaryTree {
    method maxDepth (line 15) | public int maxDepth(TreeNode root) {

FILE: leetcode/depth-first-search/NumberOfIslands.java
  class NumberOfIslands (line 19) | public class NumberOfIslands {
    method numIslands (line 22) | public int numIslands(char[][] grid) {
    method sink (line 41) | int sink(char[][] grid, int i, int j) {

FILE: leetcode/depth-first-search/PopulatingNextRightPointersInEachNode.java
  class PopulatingNextRightPointersInEachNode (line 38) | public class PopulatingNextRightPointersInEachNode {
    method connect (line 39) | public void connect(TreeLinkNode root) {

FILE: leetcode/depth-first-search/SameTree.java
  class SameTree (line 14) | public class SameTree {
    method isSameTree (line 15) | public boolean isSameTree(TreeNode p, TreeNode q) {

FILE: leetcode/design/InsertDeleteGetRandomO1.java
  class RandomizedSet (line 32) | class RandomizedSet {
    method RandomizedSet (line 37) | public RandomizedSet() {
    method insert (line 43) | public boolean insert(int val) {
    method remove (line 55) | public boolean remove(int val) {
    method getRandom (line 65) | public int getRandom() {

FILE: leetcode/design/MinStack.java
  class MinStack (line 15) | class MinStack {
    class Node (line 16) | class Node {
      method Node (line 21) | public Node(int data, int min) {
    method MinStack (line 30) | public MinStack() {
    method push (line 34) | public void push(int x) {
    method pop (line 44) | public void pop() {
    method top (line 48) | public int top() {
    method getMin (line 52) | public int getMin() {

FILE: leetcode/design/ZigZagIterator.java
  class ZigZagIterator (line 17) | public class ZigZagIterator {
    method ZigzagIterator (line 22) | public ZigzagIterator(List<Integer> v1, List<Integer> v2) {
    method next (line 27) | public int next() {
    method hasNext (line 37) | public boolean hasNext() {

FILE: leetcode/divide-and-conquer/ExpressionAddOperators.java
  class ExpressionAddOperators (line 10) | public class ExpressionAddOperators {
    method addOperators (line 11) | public List<String> addOperators(String num, int target) {
    method helper (line 22) | public void helper(List<String> result, String path, String num, int t...

FILE: leetcode/divide-and-conquer/KthLargestElementInAnArray.java
  class KthLargestElementInAnArray (line 9) | public class KthLargestElementInAnArray {
    method findKthLargest (line 10) | public int findKthLargest(int[] nums, int k) {

FILE: leetcode/dynamic-programming/BombEnemy.java
  class BombEnemy (line 14) | public class BombEnemy {
    method maxKilledEnemies (line 15) | public int maxKilledEnemies(char[][] grid) {
    method killedEnemiesRow (line 48) | private int killedEnemiesRow(char[][] grid, int i, int j) {
    method killedEnemiesCol (line 63) | private int killedEnemiesCol(char[][] grid, int i, int j) {

FILE: leetcode/dynamic-programming/ClimbingStairs.java
  class ClimbingStairs (line 7) | public class ClimbingStairs {
    method climbStairs (line 8) | public int climbStairs(int n) {

FILE: leetcode/dynamic-programming/CoinChange.java
  class CoinChange (line 14) | class CoinChange {
    method coinChange (line 15) | public int coinChange(int[] coins, int amount) {
    method coinChangeRecursive (line 23) | public int coinChangeRecursive(int[] coins, int amount, int[] dp) {

FILE: leetcode/dynamic-programming/CombinationSumIV.java
  class CombinationSumIV (line 26) | public class CombinationSumIV {
    method combinationSum4 (line 27) | public int combinationSum4(int[] nums, int target) {

FILE: leetcode/dynamic-programming/CountingBits.java
  class CountingBits (line 11) | public class CountingBits {
    method countBits (line 12) | public int[] countBits(int num) {

FILE: leetcode/dynamic-programming/EditDistance.java
  class EditDistance (line 9) | public class EditDistance {
    method minDistance (line 10) | public int minDistance(String word1, String word2) {

FILE: leetcode/dynamic-programming/HouseRobber.java
  class Solution (line 5) | public class Solution {
    method rob (line 6) | public int rob(int[] nums) {

FILE: leetcode/dynamic-programming/HouseRobberII.java
  class HouseRobberII (line 9) | class HouseRobberII {
    method rob (line 10) | public int rob(int[] nums) {

FILE: leetcode/dynamic-programming/LongestIncreasingSubsequence.java
  class LongestIncreasingSubsequence (line 11) | class LongestIncreasingSubsequence {
    method lengthOfLIS (line 12) | public int lengthOfLIS(int[] nums) {

FILE: leetcode/dynamic-programming/MinCostClimbingStairs.java
  class MinCostClimbingStairs (line 17) | class MinCostClimbingStairs {
    method minCostClimbingStairs (line 18) | public int minCostClimbingStairs(int[] cost) {

FILE: leetcode/dynamic-programming/MinimumPathSum.java
  class MinimumPathSum (line 10) | class MinimumPathSum {
    method minPathSum (line 11) | public int minPathSum(int[][] grid) {

FILE: leetcode/dynamic-programming/PaintFence.java
  class PaintFence (line 10) | public class PaintFence {
    method numWays (line 11) | public int numWays(int n, int k) {

FILE: leetcode/dynamic-programming/PaintHouse.java
  class PaintHouse (line 12) | class PaintHouse {
    method minCost (line 13) | public int minCost(int[][] costs) {

FILE: leetcode/dynamic-programming/PaintHouseII.java
  class PaintHouseII (line 11) | public class PaintHouseII {
    method minCostII (line 12) | public int minCostII(int[][] costs) {

FILE: leetcode/dynamic-programming/PalindromicSubstrings.java
  class PalindromicSubstrings (line 16) | class PalindromicSubstrings {
    method countSubstrings (line 18) | public int countSubstrings(String s) {
    method extendPalindrome (line 31) | public void extendPalindrome(String s, int left, int right) {

FILE: leetcode/dynamic-programming/RegularExpressionMatching.java
  class RegularExpressionMatching (line 20) | public class RegularExpressionMatching {
    method isMatch (line 21) | public boolean isMatch(String s, String p) {

FILE: leetcode/dynamic-programming/SentenceScreenFitting.java
  class SentenceScreenFitting (line 54) | public class SentenceScreenFitting {
    method wordsTyping (line 55) | public int wordsTyping(String[] sentence, int rows, int cols) {

FILE: leetcode/dynamic-programming/UniqueBinarySearchTrees.java
  class UniqueBinarySearchTree (line 12) | public class UniqueBinarySearchTree {
    method numTrees (line 13) | public int numTrees(int n) {

FILE: leetcode/dynamic-programming/UniquePaths.java
  class UniquePaths (line 7) | class UniquePaths {
    method uniquePaths (line 8) | public int uniquePaths(int m, int n) {

FILE: leetcode/dynamic-programming/WordBreak.java
  class WordBreak (line 9) | public class WordBreak {
    method wordBreak (line 10) | public boolean wordBreak(String s, Set<String> wordDict) {

FILE: leetcode/greedy/BestTimeToBuyAndSellStockII.java
  class BestTimeToBuyAndSellStockII (line 6) | class BestTimeToBuyAndSellStockII {
    method maxProfit (line 7) | public int maxProfit(int[] prices) {

FILE: leetcode/hash-table/BinaryTreeVerticalOrderTraversal.java
  class BinaryTreeVerticalOrderTraversal (line 67) | public class BinaryTreeVerticalOrderTraversal {
    method verticalOrder (line 68) | public List<List<Integer>> verticalOrder(TreeNode root) {

FILE: leetcode/hash-table/BullsAndCows.java
  class BullsAndCows (line 23) | class BullsAndCows {
    method getHint (line 24) | public String getHint(String secret, String guess) {

FILE: leetcode/hash-table/ContainsDuplicate.java
  class ContainsDuplicate (line 4) | class ContainsDuplicate {
    method containsDuplicate (line 5) | public boolean containsDuplicate(int[] nums) {

FILE: leetcode/hash-table/ContainsDuplicatesII.java
  class ContainsDuplicatesII (line 4) | class ContainsDuplicatesII {
    method containsNearbyDuplicate (line 5) | public boolean containsNearbyDuplicate(int[] nums, int k) {

FILE: leetcode/hash-table/DailyTemperatures.java
  class DailyTemperatures (line 7) | class DailyTemperatures {
    method dailyTemperatures (line 8) | public int[] dailyTemperatures(int[] temperatures) {

FILE: leetcode/hash-table/EncodeAndDecodeTinyURL.java
  class EncodeAndDecodeTinyURL (line 8) | public class EncodeAndDecodeTinyURL {
    method getKey (line 13) | public String getKey() {
    method encode (line 25) | public String encode(String longUrl) {
    method decode (line 34) | public String decode(String shortUrl) {

FILE: leetcode/hash-table/FindAnagramMappings.java
  class FindAnagramMappings (line 13) | class FindAnagramMappings {
    method anagramMappings (line 14) | public int[] anagramMappings(int[] A, int[] B) {

FILE: leetcode/hash-table/FindTheDifference.java
  class FindTheDifference (line 19) | public class FindTheDifference {
    method findTheDifference (line 20) | public char findTheDifference(String s, String t) {

FILE: leetcode/hash-table/FirstUniqueCharacterInAString.java
  class FirstUniqueCharacterInAString (line 12) | class FirstUniqueCharacterInAString {
    method firstUniqChar (line 13) | public int firstUniqChar(String s) {

FILE: leetcode/hash-table/GroupAnagrams.java
  class GroupAnagrams (line 13) | public class GroupAnagrams {
    method groupAnagrams (line 14) | public List<List<String>> groupAnagrams(String[] strs) {

FILE: leetcode/hash-table/GroupShiftedStrings.java
  class GroupShiftedStrings (line 16) | public class GroupShiftedStrings {
    method groupStrings (line 17) | public List<List<String>> groupStrings(String[] strings) {

FILE: leetcode/hash-table/InsertDeleteGetRandomO1.java
  class RandomizedSet (line 32) | class RandomizedSet {
    method RandomizedSet (line 37) | public RandomizedSet() {
    method insert (line 43) | public boolean insert(int val) {
    method remove (line 55) | public boolean remove(int val) {
    method getRandom (line 65) | public int getRandom() {

FILE: leetcode/hash-table/IslandPerimeter.java
  class IslandPerimeter (line 12) | class IslandPerimeter {
    method islandPerimeter (line 13) | public int islandPerimeter(int[][] grid) {
    method numNeighbors (line 31) | public int numNeighbors(int[][] grid, int x, int y) {

FILE: leetcode/hash-table/JewelsAndStones.java
  class JewelsAndStones (line 7) | class JewelsAndStones {
    method numJewelsInStones (line 8) | public int numJewelsInStones(String J, String S) {

FILE: leetcode/hash-table/LoggerRateLimiter.java
  class LoggerRateLimiter (line 29) | public class LoggerRateLimiter {
    method Logger (line 33) | public Logger() {
    method shouldPrintMessage (line 40) | public boolean shouldPrintMessage(int timestamp, String message) {

FILE: leetcode/hash-table/MaximumSizeSubarraySumEqualsK.java
  class MaximumSizeSubarraySumEqualsK (line 17) | public class MaximumSizeSubarraySumEqualsK {
    method maxSubArrayLen (line 18) | public int maxSubArrayLen(int[] nums, int k) {

FILE: leetcode/hash-table/MinimumWindowSubstring.java
  class MinimumWindowSubstring (line 13) | public class MinimumWindowSubstring {
    method minWindow (line 14) | public String minWindow(String s, String t) {

FILE: leetcode/hash-table/SingleNumberII.java
  class SingleNumberII (line 7) | class SingleNumberII {
    method singleNumber (line 8) | public int singleNumber(int[] nums) {

FILE: leetcode/hash-table/SparseMatrixMultiplication.java
  class SparseMatrixMultiplication (line 23) | public class SparseMatrixMultiplication {
    method multiply (line 24) | public int[][] multiply(int[][] A, int[][] B) {

FILE: leetcode/hash-table/StrobogrammaticNumber.java
  class StrobogrammaticNumber (line 7) | public class StrobogrammaticNumber {
    method isStrobogrammatic (line 8) | public boolean isStrobogrammatic(String num) {

FILE: leetcode/hash-table/TwoSum.java
  class TwoSum (line 11) | public class TwoSum {
    method twoSum (line 12) | public int[] twoSum(int[] nums, int target) {

FILE: leetcode/hash-table/UniqueWordAbbreviation.java
  class UniqueWordAbbreviation (line 34) | public class UniqueWordAbbreviation {
    method ValidWordAbbr (line 37) | public ValidWordAbbr(String[] dictionary) {
    method isUnique (line 53) | public boolean isUnique(String word) {
    method getKey (line 57) | public String getKey(String word) {

FILE: leetcode/hash-table/ValidAnagram.java
  class ValidAnagram (line 1) | class ValidAnagram {
    method isAnagram (line 2) | public boolean isAnagram(String s, String t) {

FILE: leetcode/hash-table/ValidSudoku.java
  class ValidSudoku (line 8) | class ValidSudoku {
    method isValidSudoku (line 9) | public boolean isValidSudoku(char[][] board) {

FILE: leetcode/linked-list/AddTwoNumbers.java
  class AddTwoNumbers (line 16) | public class AddTwoNumbers {
    method addTwoNumbers (line 17) | public ListNode addTwoNumbers(ListNode l1, ListNode l2) {

FILE: leetcode/linked-list/DeleteNodeInALinkedList.java
  class DeleteNodeInALinkedList (line 13) | public class DeleteNodeInALinkedList {
    method deleteNode (line 14) | public void deleteNode(ListNode node) {

FILE: leetcode/linked-list/LinkedListCycle.java
  class Solution (line 15) | public class Solution {
    method hasCycle (line 16) | public boolean hasCycle(ListNode head) {

FILE: leetcode/linked-list/MergeKSortedLists.java
  class MergeKSortedLists (line 11) | public class MergeKSortedLists {
    method mergeKLists (line 12) | public ListNode mergeKLists(ListNode[] lists) {

FILE: leetcode/linked-list/PalindromeLinkedList.java
  class PalindromeLinkedList (line 9) | public class PalindromeLinkedList {
    method isPalindrome (line 10) | public boolean isPalindrome(ListNode head) {

FILE: leetcode/linked-list/PlusOneLinkedList.java
  class PlusOneLinkedList (line 22) | public class PlusOneLinkedList {
    method plusOne (line 23) | public ListNode plusOne(ListNode head) {
    method plusOneRecursive (line 34) | private int plusOneRecursive(ListNode head) {

FILE: leetcode/linked-list/ReverseLinkedList.java
  class ReverseLinkedList (line 11) | public class ReverseLinkedList {
    method reverseList (line 12) | public ListNode reverseList(ListNode head) {

FILE: leetcode/math/AddDigits.java
  class AddDigits (line 9) | class AddDigits {
    method addDigits (line 10) | public int addDigits(int num) {

FILE: leetcode/math/BulbSwitcher.java
  class BulbSwitcher (line 12) | class BulbSwitcher {
    method bulbSwitch (line 13) | public int bulbSwitch(int n) {

FILE: leetcode/math/EncodeAndDecodeTinyURL.java
  class EncodeAndDecodeTinyURL (line 8) | public class EncodeAndDecodeTinyURL {
    method getKey (line 13) | public String getKey() {
    method encode (line 25) | public String encode(String longUrl) {
    method decode (line 34) | public String decode(String shortUrl) {

FILE: leetcode/math/PalindromeNumber.java
  class PalindromeNumber (line 3) | class PalindromeNumber {
    method isPalindrome (line 4) | public boolean isPalindrome(int x) {

FILE: leetcode/math/PlusOne.java
  class Solution (line 18) | class Solution {
    method plusOne (line 19) | public int[] plusOne(int[] digits) {

FILE: leetcode/math/PoorPigs.java
  class PoorPigs (line 11) | class PoorPigs {
    method poorPigs (line 12) | public int poorPigs(int buckets, int minutesToDie, int minutesToTest) {

FILE: leetcode/math/PowerOfTwo.java
  class PowerOfTwo (line 16) | class PowerOfTwo {
    method isPowerOfTwo (line 17) | public boolean isPowerOfTwo(int n) {

FILE: leetcode/queue/MovingAverageFromDataStream.java
  class MovingAverageFromDataStream (line 16) | public class MovingAverageFromDataStream {
    method MovingAverage (line 22) | public MovingAverage(int size) {
    method next (line 27) | public double next(int val) {

FILE: leetcode/sort/MeetingRooms.java
  class MeetingRooms (line 16) | public class MeetingRooms {
    method canAttendMeetings (line 17) | public boolean canAttendMeetings(Interval[] intervals) {

FILE: leetcode/sort/MeetingRoomsII.java
  class MeetingRoomsII (line 16) | public class MeetingRoomsII {
    method minMeetingRooms (line 17) | public int minMeetingRooms(Interval[] intervals) {

FILE: leetcode/stack/BinarySearchTreeIterator.java
  class BinarySearchTreeIterator (line 17) | public class BinarySearchTreeIterator {
    method BSTIterator (line 20) | public BSTIterator(TreeNode root) {
    method hasNext (line 30) | public boolean hasNext() {
    method next (line 35) | public int next() {

FILE: leetcode/stack/DailyTemperatures.java
  class DailyTemperatures (line 7) | class DailyTemperatures {
    method dailyTemperatures (line 8) | public int[] dailyTemperatures(int[] temperatures) {

FILE: leetcode/stack/DecodeString.java
  class DecodeString (line 9) | public class DecodeString {
    method decodeString (line 10) | public String decodeString(String s) {

FILE: leetcode/stack/ExclusiveTimeOfFunctions.java
  class ExclusiveTimeOfFunctions (line 30) | class ExclusiveTimeOfFunctions {
    method exclusiveTime (line 31) | public int[] exclusiveTime(int n, List<String> logs) {

FILE: leetcode/stack/FlattenNestedListIterator.java
  class FlattenNestedListIterator (line 32) | public class FlattenNestedListIterator implements Iterator<Integer> {
    method NestedIterator (line 35) | public NestedIterator(List<NestedInteger> nestedList) {
    method next (line 41) | @Override
    method hasNext (line 46) | @Override

FILE: leetcode/stack/MinStack.java
  class MinStack (line 15) | class MinStack {
    class Node (line 16) | class Node {
      method Node (line 21) | public Node(int data, int min) {
    method MinStack (line 30) | public MinStack() {
    method push (line 34) | public void push(int x) {
    method pop (line 44) | public void pop() {
    method top (line 48) | public int top() {
    method getMin (line 52) | public int getMin() {

FILE: leetcode/stack/TrappingRainWater.java
  class TrappingRainWater (line 6) | public class TrappingRainWater {
    method trap (line 7) | public int trap(int[] height) {

FILE: leetcode/string/AddBinary.java
  class AddBinary (line 8) | public class AddBinary {
    method addBinary (line 9) | public String addBinary(String a, String b) {

FILE: leetcode/string/CountAndSay.java
  class CountAndSay (line 11) | public class CountAndSay {
    method countAndSay (line 12) | public String countAndSay(int n) {
    method helper (line 22) | public String helper(String s) {

FILE: leetcode/string/DecodeWays.java
  class DecodeWays (line 15) | public class DecodeWays {
    method numDecodings (line 16) | public int numDecodings(String s) {

FILE: leetcode/string/EditDistance.java
  class EditDistance (line 9) | public class EditDistance {
    method minDistance (line 10) | public int minDistance(String word1, String word2) {

FILE: leetcode/string/FirstUniqueCharacterInAString.java
  class FirstUniqueCharacterInAString (line 12) | class FirstUniqueCharacterInAString {
    method firstUniqChar (line 13) | public int firstUniqChar(String s) {

FILE: leetcode/string/GenerateParentheses.java
  class GenerateParentheses (line 13) | class GenerateParentheses {
    method generateParenthesis (line 14) | public List<String> generateParenthesis(int n) {
    method generateParenthesisRecursive (line 21) | public void generateParenthesisRecursive(List<String> result, String c...

FILE: leetcode/string/IntegerToEnglishWords.java
  class IntegerToEnglishWords (line 9) | public class IntegerToEnglishWords {
    method numberToWords (line 14) | public String numberToWords(int num) {
    method helper (line 34) | private String helper(int num) {

FILE: leetcode/string/JudgeRouteCircle.java
  class JudgeRouteCircle (line 12) | class JudgeRouteCircle {
    method judgeCircle (line 13) | public boolean judgeCircle(String moves) {

FILE: leetcode/string/LongestCommonPrefix.java
  class LongestCommonPrefix (line 1) | class LongestCommonPrefix {
    method longestCommonPrefix (line 2) | public String longestCommonPrefix(String[] strs) {

FILE: leetcode/string/LongestPalindrome.java
  class LongestPalindrome (line 1) | public class LongestPalindrome {
    method longestPalindrome (line 2) | public int longestPalindrome(String s) {

FILE: leetcode/string/LongestPalindromicSubstring.java
  class LongestPalindromicSubstring (line 13) | class LongestPalindromicSubstring {
    method longestPalindrome (line 14) | public String longestPalindrome(String s) {
    method isPalindrome (line 31) | public boolean isPalindrome(String s) {

FILE: leetcode/string/LongestSubstringWithAtMostKDistinctCharacters.java
  class LongestSubstringWithAtMostKDistinctCharacters (line 7) | public class LongestSubstringWithAtMostKDistinctCharacters {
    method lengthOfLongestSubstringKDistinct (line 8) | public int lengthOfLongestSubstringKDistinct(String s, int k) {

FILE: leetcode/string/MinimumWindowSubstring.java
  class MinimumWindowSubstring (line 12) | public class MinimumWindowSubstring {
    method minWindow (line 13) | public String minWindow(String s, String t) {

FILE: leetcode/string/MultiplyStrings.java
  class MultiplyStrings (line 10) | public class MultiplyStrings {
    method multiply (line 11) | public String multiply(String num1, String num2) {

FILE: leetcode/string/OneEditDistance.java
  class OneEditDistance (line 3) | public class OneEditDistance {
    method isOneEditDistance (line 4) | public boolean isOneEditDistance(String s, String t) {

FILE: leetcode/string/PalindromePermutation.java
  class PalindromePermutation (line 1) | public class PalindromePermutation {
    method canPermutePalindrome (line 2) | public boolean canPermutePalindrome(String s) {

FILE: leetcode/string/PalindromicSubstrings.java
  class PalindromicSubstrings (line 16) | class PalindromicSubstrings {
    method countSubstrings (line 18) | public int countSubstrings(String s) {
    method extendPalindrome (line 31) | public void extendPalindrome(String s, int left, int right) {

FILE: leetcode/string/ReverseVowelsOfAString.java
  class ReverseVowelsOfAString (line 12) | public class ReverseVowelsOfAString {
    method reverseVowels (line 13) | public String reverseVowels(String s) {

FILE: leetcode/string/ReverseWordsInAString.java
  class ReverseWordsInAString (line 6) | public class ReverseWordsInAString {
    method reverseWords (line 7) | public String reverseWords(String s) {

FILE: leetcode/string/RomanToInteger.java
  class RomanToInteger (line 5) | public class RomanToInteger {
    method romanToInt (line 6) | public int romanToInt(String s) {

FILE: leetcode/string/ValidPalindrome.java
  class ValidPalindrome (line 1) | public class ValidPalindrome {
    method isPalindrome (line 2) | public boolean isPalindrome(String s) {

FILE: leetcode/string/ValidParentheses.java
  class ValidParentheses (line 5) | public class ValidParentheses {
    method isValid (line 6) | public boolean isValid(String s) {

FILE: leetcode/tree/BinaryTreeMaximumPathSum.java
  class BinaryTreeMaximumPathSum (line 22) | public class BinaryTreeMaximumPathSum {
    method maxPathSum (line 25) | public int maxPathSum(TreeNode root) {
    method maxPathSumRecursive (line 30) | private int maxPathSumRecursive(TreeNode root) {

FILE: leetcode/tree/BinaryTreePaths.java
  class BinaryTreePaths (line 23) | public class BinaryTreePaths {
    method binaryTreePaths (line 24) | public List<String> binaryTreePaths(TreeNode root) {
    method helper (line 36) | public void helper(String current, TreeNode root, List<String> result) {

FILE: leetcode/tree/InorderSuccessorInBST.java
  class InorderSuccessorInBST (line 14) | public class InorderSuccessorInBST {
    method inorderSuccessor (line 15) | public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {

FILE: leetcode/tree/InvertBinaryTree.java
  class InvertBinaryTree (line 26) | public class InvertBinaryTree {
    method invertTree (line 27) | public TreeNode invertTree(TreeNode root) {

FILE: leetcode/tree/LowestCommonAncestorOfABinaryTree.java
  class LowestCommonAncestorOfABinaryTree (line 23) | public class LowestCommonAncestorOfABinaryTree {
    method lowestCommonAncestor (line 24) | public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNo...

FILE: leetcode/tree/SumOfLeftLeaves.java
  class SumOfLeftLeaves (line 22) | public class SumOfLeftLeaves {
    method sumOfLeftLeaves (line 23) | public int sumOfLeftLeaves(TreeNode root) {

FILE: leetcode/tree/TrimABinarySearchTree.java
  class TrimABinarySearchTree (line 14) | class TrimABinarySearchTree {
    method trimBST (line 15) | public TreeNode trimBST(TreeNode root, int L, int R) {

FILE: leetcode/tree/ValidateBinarySearchTree.java
  class ValidateBinarySearchTree (line 28) | public class ValidateBinarySearchTree {
    method isValidBST (line 29) | public boolean isValidBST(TreeNode root) {
    method validBSTRecursive (line 37) | public boolean validBSTRecursive(TreeNode root, long minValue, long ma...

FILE: leetcode/trie/AddAndSearchWordDataStructureDesign.java
  class AddAndSearchWordDataStructure (line 20) | public class AddAndSearchWordDataStructure {
    class TrieNode (line 21) | public class TrieNode {
    method addWord (line 28) | public void addWord(String word) {
    method search (line 42) | public boolean search(String word) {
    method match (line 46) | private boolean match(char[] chs, int k, TrieNode node) {

FILE: leetcode/trie/ImplementTrie.java
  class TrieNode (line 11) | class TrieNode {
    method TrieNode (line 18) | public TrieNode(char character) {
  class ImplementTrie (line 28) | public class ImplementTrie {
    method Trie (line 31) | public Trie() {
    method insert (line 36) | public void insert(String word) {
    method search (line 51) | public boolean search(String word) {
    method startsWith (line 71) | public boolean startsWith(String prefix) {

FILE: leetcode/trie/WordSquares.java
  class WordSquares (line 18) | public class WordSquares {
    method wordSquares (line 19) | public List<List<String>> wordSquares(String[] words) {
    method helper (line 46) | public void helper(List<List<String>> ret, List<String> cur, int match...

FILE: leetcode/two-pointers/3Sum.java
  class Sum (line 13) | public class 3Sum {
    method threeSum (line 14) | public List<List<Integer>> threeSum(int[] nums) {

FILE: leetcode/two-pointers/3SumSmaller.java
  class SumSmaller (line 13) | public class 3SumSmaller {
    method threeSumSmaller (line 14) | public int threeSumSmaller(int[] nums, int target) {

FILE: leetcode/two-pointers/LinkedListCycle.java
  class Solution (line 15) | public class Solution {
    method hasCycle (line 16) | public boolean hasCycle(ListNode head) {

FILE: leetcode/two-pointers/MergeSortedArray.java
  class MergeSortedArray (line 6) | public class MergeSortedArray {
    method merge (line 7) | public void merge(int[] A, int m, int[] B, int n) {

FILE: leetcode/two-pointers/MinimumSizeSubarraySum.java
  class MinimumSizeSubarraySum (line 6) | public class MinimumSizeSubarraySum {
    method minSubArrayLen (line 7) | public int minSubArrayLen(int s, int[] nums) {

FILE: leetcode/two-pointers/MoveZeros.java
  class MoveZeros (line 9) | public class MoveZeros {
    method moveZeroes (line 10) | public void moveZeroes(int[] nums) {

FILE: leetcode/two-pointers/RemoveDuplicatesFromSortedArray.java
  class RemoveDuplicatesFromSortedArray (line 10) | public class RemoveDuplicatesFromSortedArray {
    method removeDuplicates (line 11) | public int removeDuplicates(int[] nums) {

FILE: leetcode/two-pointers/RemoveElement.java
  class RemoveElement (line 9) | class RemoveElement {
    method removeElement (line 10) | public int removeElement(int[] nums, int val) {

FILE: leetcode/two-pointers/ReverseString.java
  class ReverseString (line 6) | public class ReverseString {
    method reverseString (line 7) | public String reverseString(String s) {

FILE: leetcode/two-pointers/SortColors.java
  class SortColors (line 8) | public class SortColors {
    method sortColors (line 9) | public void sortColors(int[] nums) {

FILE: uva/AddingReversedNumbers.java
  class AddingReversedNumbers (line 39) | public class AddingReversedNumbers {
    method main (line 41) | public static void main(String[] args) {

FILE: uva/Ants.java
  class Ants (line 34) | public class Ants {
    method main (line 36) | public static void main(String args[]) throws Exception {

FILE: uva/ArchaeologistsDilemma.java
  class ArchaeologistsDilemma (line 34) | public class ArchaeologistsDilemma {
    method main (line 42) | public static void main(String[] args) {

FILE: uva/AverageSpeed.java
  class AverageSpeed (line 34) | public class AverageSpeed {
    method main (line 36) | public static void main(String[] args) {
    method calcHours (line 64) | private static double calcHours(String s) {

FILE: uva/BackToIntermediateMath.java
  class BackToIntermediateMath (line 37) | public class BackToIntermediateMath {
    method main (line 39) | public static void main(String[] args) {

FILE: uva/BasicRemains.java
  class BasicRemains (line 31) | public class BasicRemains {
    method main (line 33) | public static void main(String[] args) {

FILE: uva/BasicallySpeaking.java
  class BasicallySpeaking (line 46) | public class BasicallySpeaking {
    method main (line 48) | public static void main(String[] args) {

FILE: uva/BigMod.java
  class BigMod (line 35) | public class BigMod {
    method main (line 37) | public static void main(String[] args) {

FILE: uva/BrickGame.java
  class BrickGame (line 37) | public class BrickGame {
    method main (line 39) | public static void main(String[] args) {

FILE: uva/CoconutsRevisited.java
  class CoconutsRevisited (line 40) | public class CoconutsRevisited {
    method main (line 42) | public static void main(String[] args) {

FILE: uva/DigitCounting.java
  class DigitCounting (line 36) | public class DigitCounting {
    method main (line 38) | public static void main(String[] args) {

FILE: uva/FactorialFrequenices.java
  class FactorialFrequenices (line 42) | public class FactorialFrequenices {
    method main (line 44) | public static void main(String[] args) {
    method formatOutput (line 65) | private static void formatOutput(int number, int[] digits) {

FILE: uva/FiveHundredFactorial.java
  class FiveHundredFactorial (line 44) | public class FiveHundredFactorial {
    method main (line 46) | public static void main(String[] args) {

FILE: uva/Friends.java
  class Friends (line 47) | public class Friends {
    method main (line 53) | public static void main(String args[]) throws Exception {
    method startUnion (line 100) | public static void startUnion(int numberOfPeople, int[] people, int[] ...
    method union (line 114) | public static void union(int person, int friend) {
    method find (line 129) | public static int find(int person) {
    method join (line 142) | public static void join(int person, int friend) {

FILE: uva/GoldbachConjecture.java
  class GoldbachConjecture (line 40) | public class GoldbachConjecture {
    method main (line 42) | public static void main(String[] args) {
    method sieveOfEratosthenes (line 66) | private static boolean[] sieveOfEratosthenes(int number) {

FILE: uva/GoogleIsFeelingLucky.java
  class GoogleIsFeelingLucky (line 61) | public class GoogleIsFeelingLucky {
    method main (line 63) | public static void main(String args[]) {

FILE: uva/HashmatWarriors.java
  class HashmatWarriors (line 27) | public class HashmatWarriors {
    method main (line 29) | public static void main(String[] args) {

FILE: uva/HighPrecisionNumber.java
  class HighPrecisionNumber (line 46) | public class HighPrecisionNumber {
    method main (line 48) | public static void main(String[] args) {

FILE: uva/HighSchoolPhysics.java
  class HighSchoolPhysics (line 22) | public class HighSchoolPhysics {
    method main (line 24) | public static void main(String[] args) {

FILE: uva/ICanGuessTheDataStructure.java
  class ICanGuessTheDataStructure (line 69) | public class ICanGuessTheDataStructure {
    method main (line 71) | public static void main(String args[]) throws Exception {

FILE: uva/IntegerInquiry.java
  class IntegerInquiry (line 29) | public class IntegerInquiry {
    method main (line 31) | public static void main(String[] args) {

FILE: uva/JollyJumpers.java
  class JollyJumpers (line 28) | public class JollyJumpers {
    method main (line 30) | public static void main(String[] args) {

FILE: uva/LargestPrimeDivisor.java
  class LargestPrimeDivisor (line 29) | public class LargestPrimeDivisor {
    method main (line 31) | public static void main(String[] args) {

FILE: uva/LightMoreLight.java
  class LightMoreLight (line 30) | public class LightMoreLight {
    method main (line 32) | public static void main(String[] args) {
    method isAPerfectSquare (line 45) | private static boolean isAPerfectSquare(long number) {

FILE: uva/MischievousChildren.java
  class MischievousChildren (line 34) | public class MischievousChildren {
    method main (line 36) | public static void main(String[] args) {
    method computeFactorial (line 76) | private static long computeFactorial(int number) {

FILE: uva/Modex.java
  class Modex (line 34) | public class Modex {
    method main (line 36) | public static void main(String[] args) {

FILE: uva/MultipleOfSeventeen.java
  class MultipleOfSeventeen (line 30) | public class MultipleOfSeventeen {
    method main (line 35) | public static void main(String[] args) {

FILE: uva/Newspaper.java
  class Newspaper (line 45) | public class Newspaper {
    method main (line 47) | public static void main(String[] args) {

FILE: uva/NumberTheoryForNewbies.java
  class NumberTheoryForNewbies (line 28) | public class NumberTheoryForNewbies {
    method main (line 30) | public static void main(String[] args) {

FILE: uva/NumberingRoads.java
  class NumberingRoads (line 43) | public class NumberingRoads {
    method main (line 45) | public static void main(String[] args) {

FILE: uva/OpenSource.java
  class OpenSource (line 65) | public class OpenSource {
    method main (line 67) | public static void main(String args[]) throws Exception {
  class Pair (line 136) | class Pair {
    method Pair (line 140) | Pair(String name, int total) {

FILE: uva/Parity.java
  class Parity (line 29) | public class Parity {
    method main (line 31) | public static void main(String[] args) {
    method convertToBinary (line 51) | private static String convertToBinary(int number) {

FILE: uva/PeskyPalindromes.java
  class PeskyPalindromes (line 36) | public class PeskyPalindromes {
    method main (line 38) | public static void main(String args[]) {
    method generateSubstrings (line 58) | public static List<String> generateSubstrings(String s) {
    method findUniquePalindromes (line 82) | public static int findUniquePalindromes(List<String> allSubstrings) {

FILE: uva/PrimeFactors.java
  class PrimeFactors (line 60) | public class PrimeFactors {
    method main (line 62) | public static void main(String[] args) {
    method sieveOfEratosthenes (line 78) | public static List<Integer> sieveOfEratosthenes(boolean[] isPrime, int...
    method formatOutput (line 95) | static void formatOutput(int number, List<Integer> primeFactors, boole...
    method generatePrimeNumbers (line 120) | static boolean[] generatePrimeNumbers() {

FILE: uva/PseudoPrimeNumbers.java
  class PseudoPrimeNumbers (line 42) | public class PseudoPrimeNumbers {
    method main (line 44) | public static void main(String[] args) {

FILE: uva/SimplifyingFractions.java
  class SimplifyingFractions (line 26) | public class SimplifyingFractions {
    method main (line 28) | public static void main(String[] args) {

FILE: uva/SimplyEmirp.java
  class SimplyEmirp (line 39) | public class SimplyEmirp {
    method main (line 41) | public static void main(String[] args) {

FILE: uva/SkewBinary.java
  class SkewBinary (line 50) | public class SkewBinary {
    method main (line 52) | public static void main(String[] args) {

FILE: uva/SolveEquation.java
  class SolveEquation (line 19) | public class SolveEquation {
    method main (line 21) | public static void main(String[] args) {

FILE: uva/SplittingNumbers.java
  class SplittingNumbers (line 40) | public class SplittingNumbers {
    method main (line 42) | public static void main(String args[]) throws Exception {

FILE: uva/TheHugeOne.java
  class TheHugeOne (line 40) | public class TheHugeOne {
    method main (line 42) | public static void main(String[] args) {

FILE: uva/TheLastNonZeroDigit.java
  class TheLastNonZeroDigit (line 31) | public class TheLastNonZeroDigit {
    method main (line 33) | public static void main(String[] args) {

FILE: uva/TheSettlersOfCatan.java
  class TheSettlersOfCatan (line 56) | public class TheSettlersOfCatan {
    method main (line 61) | public static void main(String args[]) throws Exception {
    method dfs (line 108) | public static void dfs(int nd, int l, int nodes) {

FILE: uva/VeryEasy.java
  class VeryEasy (line 32) | public class VeryEasy {
    method main (line 34) | public static void main(String[] args) {

FILE: uva/VirtualFriends.java
  class VirtualFriends (line 37) | public class VirtualFriends {
    method main (line 42) | public static void main(String args[]) throws Exception {
    method startUnion (line 71) | public static void startUnion(int numberOfPeople) {
    method union (line 81) | public static int union(int person, int friend) {
    method find (line 104) | public static int find(int person) {

FILE: uva/WhatBaseIsThis.java
  class WhatBaseIsThis (line 54) | public class WhatBaseIsThis {
    method main (line 56) | public static void main(String[] args) {

FILE: uva/WhoSaidCrisis.java
  class WhoSaidCrisis (line 34) | public class WhoSaidCrisis {
    method main (line 36) | public static void main(String[] args) {