SYMBOL INDEX (2409 symbols across 1331 files) FILE: coding_interviews/algoexpert/array-of-products/array-of-products-optimized.js function initOutput (line 17) | function initOutput(length) { function arrayOfProducts (line 27) | function arrayOfProducts(array) { FILE: coding_interviews/algoexpert/array-of-products/array-of-products.js function initOutput (line 17) | function initOutput(length) { function arrayOfProducts (line 27) | function arrayOfProducts(array) { FILE: coding_interviews/algoexpert/best-seat/best-seat.js function bestSeat (line 25) | function bestSeat(seats) { FILE: coding_interviews/algoexpert/binary-search/binary-search.js function binarySearch (line 4) | function binarySearch(array, target) { FILE: coding_interviews/algoexpert/branch-sums/branch-sums-without-recreating-sums.js class BinaryTree (line 4) | class BinaryTree { method constructor (line 5) | constructor(value) { function branchSums (line 12) | function branchSums(root) { FILE: coding_interviews/algoexpert/branch-sums/branch-sums.js class BinaryTree (line 4) | class BinaryTree { method constructor (line 5) | constructor(value) { function branchSums (line 12) | function branchSums(root, sum = 0, sums = []) { FILE: coding_interviews/algoexpert/bst-construction/bst-construction.js class BST (line 19) | class BST { method constructor (line 20) | constructor(value) { method insert (line 26) | insert(value) { method contains (line 38) | contains(value) { method remove (line 54) | remove(value, parent = null) { method _findSmallestNodeValue (line 103) | _findSmallestNodeValue() { method _findGreatestNodeValue (line 107) | _findGreatestNodeValue() { FILE: coding_interviews/algoexpert/bst-traversal/bst-traversal.js function inOrderTraverse (line 1) | function inOrderTraverse(tree, array) { function preOrderTraverse (line 9) | function preOrderTraverse(tree, array) { function postOrderTraverse (line 17) | function postOrderTraverse(tree, array) { FILE: coding_interviews/algoexpert/bubble-sort/bubble-sort.js function bubbleSort (line 4) | function bubbleSort(array) { FILE: coding_interviews/algoexpert/caesar-cipher-encryptor/caesar-cipher-encryptor.js function getChar (line 4) | function getChar(char, key) { function caesarCipherEncryptor (line 9) | function caesarCipherEncryptor(string, key) { FILE: coding_interviews/algoexpert/class-photos/class-photos.js function classPhotos (line 1) | function classPhotos(redShirtHeights, blueShirtHeights) { FILE: coding_interviews/algoexpert/common-characters/common-characters.js function commonCharacters (line 17) | function commonCharacters(strings) { FILE: coding_interviews/algoexpert/depth-first-search/depth-first-search-cleaner.js class Node (line 4) | class Node { method constructor (line 5) | constructor(name) { method addChild (line 10) | addChild(name) { method depthFirstSearch (line 15) | depthFirstSearch(array) { FILE: coding_interviews/algoexpert/depth-first-search/depth-first-search.js class Node (line 4) | class Node { method constructor (line 5) | constructor(name) { method addChild (line 10) | addChild(name) { method depthFirstSearch (line 15) | depthFirstSearch(array) { FILE: coding_interviews/algoexpert/evaluate-expression-tree/evaluate-expression-tree-cleaner.js function evaluateExpressionTree (line 1) | function evaluateExpressionTree({value, left, right}) { FILE: coding_interviews/algoexpert/evaluate-expression-tree/evaluate-expression-tree-with-trunc.js function evaluateExpressionTree (line 1) | function evaluateExpressionTree(tree) { FILE: coding_interviews/algoexpert/evaluate-expression-tree/evaluate-expression-tree.js function evaluateExpressionTree (line 1) | function evaluateExpressionTree(tree) { FILE: coding_interviews/algoexpert/find-closest-value-in-bst/find-closest-value-in-bst-optimized-cleaner.js function abs (line 6) | function abs(value) { function findClosestValueInBst (line 10) | function findClosestValueInBst(tree, target, closest = Infinity) { FILE: coding_interviews/algoexpert/find-closest-value-in-bst/find-closest-value-in-bst-optimized.js function findClosestValueInBst (line 6) | function findClosestValueInBst(tree, target, closestValue = Infinity) { FILE: coding_interviews/algoexpert/find-closest-value-in-bst/find-closest-value-in-bst.js function findClosestValueInBst (line 4) | function findClosestValueInBst(tree, target, closestValue = Infinity) { FILE: coding_interviews/algoexpert/find-three-largest-numbers/find-three-largest-numbers.js function findThreeLargestNumbers (line 4) | function findThreeLargestNumbers(array) { FILE: coding_interviews/algoexpert/first-duplicate-value/first-duplicate-value-optimized.js function firstDuplicateValue (line 18) | function firstDuplicateValue(array) { FILE: coding_interviews/algoexpert/first-duplicate-value/first-duplicate-value.js function firstDuplicateValue (line 18) | function firstDuplicateValue(array) { FILE: coding_interviews/algoexpert/first-non-repeating-character/first-non-repeating-character.js function firstNonRepeatingCharacter (line 4) | function firstNonRepeatingCharacter(string) { FILE: coding_interviews/algoexpert/generate-document/generate-document.js function generateDocument (line 22) | function generateDocument(characters, document) { FILE: coding_interviews/algoexpert/insertion-sort/insertion-sort.js function swap (line 4) | function swap(array, i, j) { function insertionSort (line 10) | function insertionSort(array) { FILE: coding_interviews/algoexpert/longest-peak/longest-peak.js function longestPeak (line 20) | function longestPeak(array) { FILE: coding_interviews/algoexpert/majority-element/majority-element.js function majorityElement (line 4) | function majorityElement(array) { FILE: coding_interviews/algoexpert/merge-overlapping-intervals/merge-overlapping-intervals.js function mergeOverlappingIntervals (line 20) | function mergeOverlappingIntervals(array) { FILE: coding_interviews/algoexpert/middle-node/middle-node-slow-fast.js function middleNode (line 4) | function middleNode(linkedList) { FILE: coding_interviews/algoexpert/middle-node/middle-node.js function middleNode (line 4) | function middleNode(linkedList) { FILE: coding_interviews/algoexpert/minimum-waiting-time/minimum-waiting-time.js function minimumWaitingTime (line 1) | function minimumWaitingTime(queries) { FILE: coding_interviews/algoexpert/missing-numbers/missing-numbers.js function missingNumbers (line 4) | function missingNumbers(nums) { FILE: coding_interviews/algoexpert/monotonic-array/monotonic-array-optimization-1.js function isMonotonic (line 21) | function isMonotonic(array) { FILE: coding_interviews/algoexpert/monotonic-array/monotonic-array-optimization-2.js function isMonotonic (line 21) | function isMonotonic(array) { FILE: coding_interviews/algoexpert/monotonic-array/monotonic-array.js function isNonIncreasing (line 21) | function isNonIncreasing(array) { function isNonDecreasing (line 34) | function isNonDecreasing(array) { function isMonotonic (line 47) | function isMonotonic(array) { FILE: coding_interviews/algoexpert/move-element-to-end/move-element-to-end.js function moveElementToEnd (line 19) | function moveElementToEnd(array, toMove) { FILE: coding_interviews/algoexpert/node-depths/node-depths.js function nodeDepths (line 4) | function nodeDepths(root, sum = 0) { FILE: coding_interviews/algoexpert/non-constructible-change/non-constructible-change.js function nonConstructibleChange (line 4) | function nonConstructibleChange(coins) { FILE: coding_interviews/algoexpert/nth-fibonacci/nth-fibonacci-memo-no-space.js function getNthFib (line 4) | function getNthFib(n) { FILE: coding_interviews/algoexpert/nth-fibonacci/nth-fibonacci-memo.js function getNthFib (line 4) | function getNthFib(n) { FILE: coding_interviews/algoexpert/nth-fibonacci/nth-fibonacci.js function getNthFib (line 4) | function getNthFib(n) { FILE: coding_interviews/algoexpert/optimal-freelancing/optimal-freelancing-sorting.js function sortJobs (line 1) | function sortJobs(jobs) { function optimalFreelancing (line 9) | function optimalFreelancing(jobs) { FILE: coding_interviews/algoexpert/optimal-freelancing/optimal-freelancing.js function optimalFreelancing (line 1) | function optimalFreelancing(jobs) { FILE: coding_interviews/algoexpert/palindrome-check/palindrome-check.js function isPalindrome (line 4) | function isPalindrome(string) { FILE: coding_interviews/algoexpert/product-sum/product-sum-timer-later.js function productSum (line 4) | function productSum(array, depth = 1) { FILE: coding_interviews/algoexpert/product-sum/product-sum.js function productSum (line 4) | function productSum(array, product = 1) { FILE: coding_interviews/algoexpert/remove-duplicates-from-linked-list/remove-duplicates-from-linked-list.js function removeDuplicatesFromLinkedList (line 4) | function removeDuplicatesFromLinkedList(linkedList) { FILE: coding_interviews/algoexpert/remove-islands/remove-islands-optimized.js function markNonIsland (line 17) | function markNonIsland(matrix, rowIndex, colIndex) { function removeIslands (line 35) | function removeIslands(matrix) { FILE: coding_interviews/algoexpert/remove-islands/remove-islands.js function removeIsland (line 17) | function removeIsland(matrix, rowIndex, colIndex) { function removeIslands (line 38) | function removeIslands(matrix) { FILE: coding_interviews/algoexpert/run-length-encoding/run-length-encoding copy.js function runLengthEncoding (line 1) | function runLengthEncoding(string) { FILE: coding_interviews/algoexpert/run-length-encoding/run-length-encoding-cleaner.js function runLengthEncoding (line 1) | function runLengthEncoding(string) { FILE: coding_interviews/algoexpert/run-length-encoding/run-length-encoding.js function runLengthEncoding (line 1) | function runLengthEncoding(string) { FILE: coding_interviews/algoexpert/semordnilap/semordnilap.js function reverse (line 17) | function reverse(word) { function semordnilap (line 27) | function semordnilap(words) { FILE: coding_interviews/algoexpert/smallest-difference/smallest-difference.js function smallestDifference (line 23) | function smallestDifference(arrayOne, arrayTwo) { FILE: coding_interviews/algoexpert/sorted-squared-array/sorted-squared-array-insert-position.js function sortedSquaredArray (line 4) | function sortedSquaredArray(array) { FILE: coding_interviews/algoexpert/sorted-squared-array/sorted-squared-array-two-pointers.js function sortedSquaredArray (line 4) | function sortedSquaredArray(array) { FILE: coding_interviews/algoexpert/sorted-squared-array/sorted-squared-array.js function sortedSquaredArray (line 4) | function sortedSquaredArray(array) { FILE: coding_interviews/algoexpert/spiral-traverse/spiral-traverse.js function spiralTraverse (line 25) | function spiralTraverse(array) { FILE: coding_interviews/algoexpert/tandem-bicycle/tandem-bicycle-cleaner.js function getTotalSpeed (line 4) | function getTotalSpeed(redShirtSpeeds, blueShirtSpeeds) { function tandemBicycle (line 14) | function tandemBicycle(redShirtSpeeds, blueShirtSpeeds, fastest) { FILE: coding_interviews/algoexpert/tandem-bicycle/tandem-bicycle.js function getMinimumTotalSpeed (line 4) | function getMinimumTotalSpeed(redShirtSpeeds, blueShirtSpeeds) { function getMaximumTotalSpeed (line 14) | function getMaximumTotalSpeed(redShirtSpeeds, blueShirtSpeeds) { function tandemBicycle (line 27) | function tandemBicycle(redShirtSpeeds, blueShirtSpeeds, fastest) { FILE: coding_interviews/algoexpert/three-number-sum/three-number-sum.js function sortKey (line 1) | function sortKey(array) { function threeNumberSum (line 8) | function threeNumberSum(array, targetSum) { FILE: coding_interviews/algoexpert/tournament-winner/tournament-winner-optimized.js function tournamentWinner (line 4) | function tournamentWinner(competitions, results) { FILE: coding_interviews/algoexpert/tournament-winner/tournament-winner.js function tournamentWinner (line 4) | function tournamentWinner(competitions, results) { FILE: coding_interviews/algoexpert/transpose-matrix/transpose-matrix.js function transposeMatrix (line 4) | function transposeMatrix(matrix) { FILE: coding_interviews/algoexpert/two-number-sum/two-number-sum-optimized.js function twoNumberSum (line 4) | function twoNumberSum(array, targetSum) { FILE: coding_interviews/algoexpert/two-number-sum/two-number-sum-two-pointers.js function twoNumberSum (line 4) | function twoNumberSum(array, targetSum) { FILE: coding_interviews/algoexpert/two-number-sum/two-number-sum.js function twoNumberSum (line 4) | function twoNumberSum(array, targetSum) { FILE: coding_interviews/algoexpert/validate-bst/validate-bst.js class BST (line 1) | class BST { method constructor (line 2) | constructor(value) { function validateBst (line 9) | function validateBst(tree) { FILE: coding_interviews/algoexpert/validate-subsequence/validate-subsequence-two-pointers.js function isValidSubsequence (line 4) | function isValidSubsequence(array, sequence) { FILE: coding_interviews/algoexpert/validate-subsequence/validate-subsequence.js function isValidSubsequence (line 4) | function isValidSubsequence(array, sequence) { FILE: coding_interviews/algoexpert/zero-sum-subarray/zero-sum-subarray-optimized.js function zeroSumSubarray (line 4) | function zeroSumSubarray(nums) { FILE: coding_interviews/algoexpert/zero-sum-subarray/zero-sum-subarray.js function zeroSumSubarray (line 4) | function zeroSumSubarray(nums) { FILE: coding_interviews/algorithms_in_python/queue/R-6.7.py class Emptiness (line 7) | class Emptiness(Exception): class Queue (line 11) | class Queue: method __init__ (line 12) | def __init__(self): method enqueue (line 15) | def enqueue(self, item): method dequeue (line 18) | def dequeue(self): method is_empty (line 24) | def is_empty(self): method front (line 27) | def front(self): method back (line 33) | def back(self): method size (line 39) | def size(self): FILE: coding_interviews/algorithms_in_python/stack/R-6.1.py class Emptiness (line 8) | class Emptiness(Exception): class Stack (line 12) | class Stack: method __init__ (line 13) | def __init__(self): method push (line 16) | def push(self, item): method pop (line 19) | def pop(self): method is_empty (line 25) | def is_empty(self): method top (line 28) | def top(self): method size (line 34) | def size(self): FILE: coding_interviews/algorithms_in_python/stack/R-6.3.py class Emptiness (line 7) | class Emptiness(Exception): class Stack (line 11) | class Stack: method __init__ (line 12) | def __init__(self): method push (line 15) | def push(self, item): method pop (line 18) | def pop(self): method is_empty (line 24) | def is_empty(self): method top (line 27) | def top(self): method size (line 33) | def size(self): function transfer (line 37) | def transfer(S, T): FILE: coding_interviews/algorithms_in_python/stack/R-6.4.py class Emptiness (line 5) | class Emptiness(Exception): class Stack (line 9) | class Stack: method __init__ (line 10) | def __init__(self): method push (line 13) | def push(self, item): method pop (line 16) | def pop(self): method is_empty (line 22) | def is_empty(self): method top (line 25) | def top(self): method size (line 31) | def size(self): function remove_all (line 35) | def remove_all(stack): FILE: coding_interviews/algorithms_in_python/stack/R-6.5.py class Emptiness (line 6) | class Emptiness(Exception): class Stack (line 10) | class Stack: method __init__ (line 11) | def __init__(self): method push (line 14) | def push(self, item): method pop (line 17) | def pop(self): method is_empty (line 23) | def is_empty(self): method top (line 26) | def top(self): method size (line 32) | def size(self): function reverse (line 36) | def reverse(items): FILE: coding_interviews/coding_interview_questions/common_elements.py function common_elements (line 1) | def common_elements(list1, list2): FILE: coding_interviews/coding_interview_questions/decode-string/decode-string.js function decodeString (line 3) | function decodeString(encodedString) { FILE: coding_interviews/coding_interview_questions/mine_swipper.py function update_table_spot (line 8) | def update_table_spot(table, row, col, num_rows, num_cols): function mine_swipper (line 43) | def mine_swipper(bombs, num_rows, num_cols): FILE: coding_interviews/coding_interview_questions/most_frequently_occurring.py function most_frequent (line 1) | def most_frequent(given_list): FILE: coding_interviews/coding_interview_questions/non_repeating.py function non_repeating (line 10) | def non_repeating(string): FILE: coding_interviews/coding_interview_questions/nth_element_from_the_end.py class Node (line 2) | class Node: method __init__ (line 3) | def __init__(self, value, next=None): method __str__ (line 7) | def __str__(self): function nth_from_last (line 10) | def nth_from_last(head, n): function linked_list_to_string (line 27) | def linked_list_to_string(head): FILE: coding_interviews/coding_interview_questions/one_away_strings.py function handle_different_sized_strings (line 13) | def handle_different_sized_strings(s1, s2): function handle_same_sized_strings (line 29) | def handle_same_sized_strings(s1, s2): function is_one_away (line 38) | def is_one_away(s1, s2): FILE: coding_interviews/coding_interview_questions/optimized_common_elements.py function common_elements (line 1) | def common_elements(list1, list2): FILE: coding_interviews/coding_interview_questions/rotation_array.py function is_rotation (line 17) | def is_rotation(a, b): FILE: coding_interviews/coding_interview_questions/two-crystal-balls/index.js function twoCrystalBalls (line 1) | function twoCrystalBalls(breaks) { FILE: coding_interviews/cracking-the-coding-interview/big_o/aditional1.py function product (line 1) | def product(a, b): FILE: coding_interviews/cracking-the-coding-interview/big_o/aditional2.py function power (line 1) | def power(a, b): FILE: coding_interviews/cracking-the-coding-interview/big_o/aditional3.py function mod (line 1) | def mod(a, b): function mod (line 15) | def mod(a, b): FILE: coding_interviews/cracking-the-coding-interview/big_o/aditional4.py function div (line 1) | def div(a, b): FILE: coding_interviews/cracking-the-coding-interview/big_o/aditional5.py function sqrt (line 1) | def sqrt(n): function sqrt_helper (line 4) | def sqrt_helper(n, min, max): FILE: coding_interviews/cracking-the-coding-interview/big_o/aditional6.py function square_root (line 3) | def square_root(n): FILE: coding_interviews/cracking-the-coding-interview/big_o/example1.py function foo (line 1) | def foo(array): FILE: coding_interviews/cracking-the-coding-interview/big_o/example10.py function is_prime (line 3) | def is_prime(num): FILE: coding_interviews/cracking-the-coding-interview/big_o/example11.py function factorial (line 1) | def factorial(n): FILE: coding_interviews/cracking-the-coding-interview/big_o/example12.py function permutation (line 1) | def permutation(str): function handle_permutation (line 4) | def handle_permutation(str, prefix): FILE: coding_interviews/cracking-the-coding-interview/big_o/example13.py function fib (line 1) | def fib(n): FILE: coding_interviews/cracking-the-coding-interview/big_o/example14.py function all_fib (line 1) | def all_fib(n): function fib (line 5) | def fib(n): FILE: coding_interviews/cracking-the-coding-interview/big_o/example15.py function all_fib (line 1) | def all_fib(n): function fib (line 9) | def fib(n, memo): FILE: coding_interviews/cracking-the-coding-interview/big_o/example16.py function powers_of_2 (line 1) | def powers_of_2(n): FILE: coding_interviews/cracking-the-coding-interview/big_o/example2.py function print_pairs (line 1) | def print_pairs(array): FILE: coding_interviews/cracking-the-coding-interview/big_o/example3.py function print_unordered_pairs (line 1) | def print_unordered_pairs(array): FILE: coding_interviews/cracking-the-coding-interview/big_o/example4.py function print_unordered_pairs (line 1) | def print_unordered_pairs(array_a, array_b): FILE: coding_interviews/cracking-the-coding-interview/big_o/example5.py function print_unordered_pairs (line 1) | def print_unordered_pairs(array_a, array_b): FILE: coding_interviews/cracking-the-coding-interview/big_o/example6.py function reverse (line 1) | def reverse(array): FILE: coding_interviews/cracking-the-coding-interview/big_o/example9.py function sum (line 1) | def sum(node): FILE: coding_interviews/cracking-the-coding-interview/chapter-001/check-permutation/check-permutation.js function buildCharsMap (line 11) | function buildCharsMap(string) { function checkPermutation (line 22) | function checkPermutation(s1, s2) { FILE: coding_interviews/cracking-the-coding-interview/chapter-001/cpp/remove_specified_character.cpp function main (line 6) | int main() { FILE: coding_interviews/cracking-the-coding-interview/chapter-001/is-unique/is-unique.js function isUnique (line 8) | function isUnique(string) { function isUniqueWithSet (line 23) | function isUniqueWithSet(string) { function isUniqueWithSetSimplified (line 37) | function isUniqueWithSetSimplified(string) { function isUniqueNSquare (line 46) | function isUniqueNSquare(string) { function isUniqueWithoutDS (line 59) | function isUniqueWithoutDS(string) { FILE: coding_interviews/cracking-the-coding-interview/chapter-001/one-away/one-away.js function buildCharsCount (line 16) | function buildCharsCount(string) { function oneAway (line 27) | function oneAway(s1, s2) { FILE: coding_interviews/cracking-the-coding-interview/chapter-001/palindrome-permutation/palindrome-permutation.js function isAlpha (line 13) | function isAlpha(char) { function buildMapOsChars (line 17) | function buildMapOsChars(string) { function palindromePermutation (line 30) | function palindromePermutation(string) { FILE: coding_interviews/cracking-the-coding-interview/chapter-001/python/001.01.py function all_unique_characters (line 19) | def all_unique_characters(string): function all_unique_characters (line 43) | def all_unique_characters(string): FILE: coding_interviews/cracking-the-coding-interview/chapter-001/python/001.02.py function permutation (line 16) | def permutation(str1, str2): function permutation (line 35) | def permutation(str1, str2): function permutation (line 63) | def permutation(str1, str2): FILE: coding_interviews/cracking-the-coding-interview/chapter-001/python/001.03.py function urlify (line 11) | def urlify(string, length): FILE: coding_interviews/cracking-the-coding-interview/chapter-001/python/001.04.py function is_even (line 12) | def is_even(number): function is_even_length (line 16) | def is_even_length(string): function is_palindrome_permutation (line 20) | def is_palindrome_permutation(string): FILE: coding_interviews/cracking-the-coding-interview/chapter-001/python/001.05.py function is_two_chars_away (line 16) | def is_two_chars_away(str1, str2): function number_of_needed_changes (line 20) | def number_of_needed_changes(bigger_str, smaller_str): function one_away (line 41) | def one_away(str1, str2): FILE: coding_interviews/cracking-the-coding-interview/chapter-001/python/001.06.py function string_compression (line 12) | def string_compression(string): FILE: coding_interviews/cracking-the-coding-interview/chapter-001/python/bottlenecks.py function pairs_of_difference (line 7) | def pairs_of_difference(array, diff): FILE: coding_interviews/cracking-the-coding-interview/chapter-001/python/is_unique.py function is_unique_chars_using_dictionary (line 6) | def is_unique_chars_using_dictionary(text): class Test (line 19) | class Test(unittest.TestCase): method test_is_unique_chars (line 35) | def test_is_unique_chars(self): FILE: coding_interviews/cracking-the-coding-interview/chapter-001/string-compression/string-compression.js function compress (line 6) | function compress(chars) { FILE: coding_interviews/cracking-the-coding-interview/chapter-001/urlify/urlify.js function urlify (line 8) | function urlify(string, length, placeholder = '%20') { function urlifyForward (line 33) | function urlifyForward(string, length, placeholder = '%20') { FILE: coding_interviews/daily_code_problems/001.py function found_sum_of_two_numbers_brute_force (line 8) | def found_sum_of_two_numbers_brute_force(k, numbers): function found_sum_of_two_numbers (line 17) | def found_sum_of_two_numbers(k, numbers): function test_algorithm (line 33) | def test_algorithm(k, numbers): FILE: coding_interviews/daily_code_problems/002.py function product_with_exception (line 14) | def product_with_exception(integers): function test_product_with_exception (line 19) | def test_product_with_exception(integers, result): FILE: coding_interviews/daily_code_problems/003.py class Node (line 26) | class Node: method __init__ (line 27) | def __init__(self, val, left=None, right=None): function serialize (line 33) | def serialize(node): function deserialize_node (line 40) | def deserialize_node(nodes): function create_nodes_queue (line 52) | def create_nodes_queue(string): function deserialize (line 62) | def deserialize(string): function pre_order (line 68) | def pre_order(tree): FILE: coding_interviews/daily_code_problems/004.py function get_lowest (line 14) | def get_lowest(lowest, present_numbers): function lowest_positive_integer (line 21) | def lowest_positive_integer(numbers): FILE: coding_interviews/daily_code_problems/005.py function cons (line 19) | def cons(a, b): function list_pair (line 26) | def list_pair(a, b): function car (line 30) | def car(pair): function cdr (line 35) | def cdr(pair): FILE: coding_interviews/daily_code_problems/007.py function count_decoded_possibilities (line 11) | def count_decoded_possibilities(encoded_message): FILE: coding_interviews/elements_of_programming_interview/array.py function even_before_odd (line 5) | def even_before_odd(numbers): FILE: coding_interviews/elements_of_programming_interview/base_conversion.py function to_num_representation (line 28) | def to_num_representation(num): function base_conversion (line 34) | def base_conversion(string_num, base1, base2): FILE: coding_interviews/elements_of_programming_interview/buy_and_sell_stock_once.py function buy_and_sell_stock_once (line 3) | def buy_and_sell_stock_once(prices): FILE: coding_interviews/elements_of_programming_interview/can_reach_end.py function can_reach_end (line 15) | def can_reach_end(board_game): FILE: coding_interviews/elements_of_programming_interview/delete_duplicates_from_a_sorted_array.py function delete_duplicates (line 30) | def delete_duplicates(numbers): function test (line 51) | def test(input, expect): function delete_duplicates_2 (line 59) | def delete_duplicates_2(numbers): function test_2 (line 77) | def test_2(input, expect): FILE: coding_interviews/elements_of_programming_interview/interconvert_string_and_integer.py function to_int (line 8) | def to_int(string): function to_string (line 33) | def to_string(integer): FILE: coding_interviews/elements_of_programming_interview/longest_subarray_length_with_same_integers.py function longest_subarray_length_with_same_integers (line 6) | def longest_subarray_length_with_same_integers(numbers): FILE: coding_interviews/elements_of_programming_interview/multiply_two_arbitrary_precision_integers.py function multiply_two_arbitrary_precision_integers (line 16) | def multiply_two_arbitrary_precision_integers(int1, int2): FILE: coding_interviews/elements_of_programming_interview/spreadsheet_column_encoding.py function spreadcheet_column_encoding (line 30) | def spreadcheet_column_encoding(encoding): FILE: coding_interviews/hackerrank_interview_prep_kit/hash_tables/count_triplets.py function count_triplets (line 13) | def count_triplets(arr, r): FILE: coding_interviews/hackerrank_interview_prep_kit/hash_tables/ransom_note.py function build_word_counter (line 11) | def build_word_counter(magazine): function check_notes_on_magazine (line 22) | def check_notes_on_magazine(word_counter, note): function check_magazine (line 32) | def check_magazine(magazine, note): FILE: coding_interviews/hackerrank_interview_prep_kit/hash_tables/sherlock_and_anagrams.py function sherlock_and_anagrams (line 3) | def sherlock_and_anagrams(s): FILE: coding_interviews/hackerrank_interview_prep_kit/hash_tables/two_strings.py function two_strings (line 11) | def two_strings(s1, s2): FILE: coding_interviews/hackerrank_interview_prep_kit/warmup/counting_valleys.py function counting_valleys (line 11) | def counting_valleys(steps, path): FILE: coding_interviews/hackerrank_interview_prep_kit/warmup/jumping_on_the_clouds.py function won_the_game (line 11) | def won_the_game(current, end_game): function is_cumulus (line 14) | def is_cumulus(cloud): function jumping_on_clouds (line 17) | def jumping_on_clouds(c): FILE: coding_interviews/hackerrank_interview_prep_kit/warmup/repeated_string.py function repeatedString (line 19) | def repeatedString(s, n): FILE: coding_interviews/hackerrank_interview_prep_kit/warmup/sales_by_match.py function sock_merchant (line 11) | def sock_merchant(n, ar): FILE: coding_interviews/interviews/fair/decrementBinaryNumber.js function countOnes (line 1) | function countOnes(number) { function toBinary (line 11) | function toBinary(number) { function toDecimal (line 15) | function toDecimal(number) { function decrementBinary (line 19) | function decrementBinary(number) { function decrementBinaryNumber (line 23) | function decrementBinaryNumber(number, requests) { FILE: coding_interviews/interviews/fair/diceTotalScore.js function diceTotalScore (line 1) | function diceTotalScore(a, b, c) { FILE: coding_interviews/interviews/fair/isSubmatrixFull.js function isSubmatrixFull (line 1) | function isSubmatrixFull(numbers) { FILE: coding_interviews/interviews/fair/sortChessSubsquares.js function sortChessSubsquares (line 1) | function sortChessSubsquares(numbers, queries) { FILE: coding_interviews/interviews/google/printSequence/printSequence.js function printSequence (line 12) | function printSequence(rows, columns) { FILE: coding_interviews/interviews/mercari/products.js function Item (line 45) | function Item({ name, price, thumbnail }) { function RecommendedItems (line 64) | function RecommendedItems({ limit, component }) { FILE: coding_interviews/interviews/meta/compareLettersInArray/compareLettersInArray.js function hasSameLength (line 1) | function hasSameLength(words, letters) { function isArray (line 5) | function isArray(arr) { function bothArrays (line 9) | function bothArrays(words, letters) { function compareLettersInArray (line 13) | function compareLettersInArray(words, letters) { FILE: coding_interviews/interviews/meta/flatten/flatten.js function flatten (line 3) | function flatten(arr) { FILE: coding_interviews/interviews/meta/flatten/flatten2.js function isString (line 3) | function isString(str) { function flatten (line 7) | function flatten(arr) { FILE: coding_interviews/interviews/quintoandar/quinto1.py function group_by (line 1) | def group_by(parsed_phone, number): FILE: coding_interviews/interviews/smartnews/countries.js function solution (line 1) | function solution(A) { function buildCountriesMapper (line 16) | function buildCountriesMapper(A) { function verifyCountry (line 32) | function verifyCountry(A, country, row, col, countries) { FILE: coding_interviews/interviews/smartnews/emiter.js class EventEmiter (line 8) | class EventEmiter { method on (line 11) | on(eventName, fn) { method emit (line 19) | emit(eventName, ...args) { method off (line 31) | off(eventName, fn) { method once (line 39) | once(eventName, fn) { FILE: coding_interviews/interviews/uber/longest-words.js function buildCounter (line 23) | function buildCounter(letters) { function getLongestWords (line 37) | function getLongestWords(words, letters) { FILE: coding_interviews/interviews/uber/maxFrequency.js function maxFrequency (line 1) | function maxFrequency(numbers) { FILE: coding_interviews/interviews/uber/permutations.js function combine (line 30) | function combine(permutations, chars) { function permutations (line 42) | function permutations(numbers) { FILE: coding_interviews/javascript/array/binary-search.js function getMiddle (line 1) | function getMiddle(start, end) { function binarySearch (line 5) | function binarySearch(numbers, target) { function logResult (line 23) | function logResult(list, target) { FILE: coding_interviews/javascript/array/subarrays.js function generateSubarrays (line 1) | function generateSubarrays(arr, start, end, result) { FILE: coding_interviews/javascript/queue/queue.js function push (line 3) | function push(queue, value) { function pop (line 7) | function pop(queue) { function front (line 11) | function front(queue) { function isEmpty (line 15) | function isEmpty(queue) { FILE: coding_interviews/javascript/stack/stack.js function push (line 3) | function push(stack, value) { function pop (line 7) | function pop(stack) { function top (line 11) | function top(stack) { function isEmpty (line 15) | function isEmpty(stack) { FILE: coding_interviews/javascript/string/alphabet.js function getIndexFromChar (line 10) | function getIndexFromChar(char) { FILE: coding_interviews/javascript/string/isString.js function isString (line 1) | function isString(str) { FILE: coding_interviews/javascript/string/sort.js function sort (line 1) | function sort(string) { FILE: coding_interviews/javascript/tree/inorder.js function inorder (line 9) | function inorder(node) { FILE: coding_interviews/javascript/tree/postorder.js function postorder (line 9) | function postorder(node) { FILE: coding_interviews/javascript/tree/preorder.js function preorder (line 9) | function preorder(node) { FILE: coding_interviews/leetcode/easy/a-number-after-a-double-reversal/a-number-after-a-double-reversal.js function reverse (line 1) | function reverse(numString) { function removeLeadingZeros (line 11) | function removeLeadingZeros(numString) { function isSameAfterReversals (line 30) | function isSameAfterReversals(num) { FILE: coding_interviews/leetcode/easy/add-digits/add-digits.js function isSingleDigit (line 15) | function isSingleDigit(number) { function addDigits (line 19) | function addDigits(number) { FILE: coding_interviews/leetcode/easy/alternating-digit-sum/alternating-digit-sum.js function isEvent (line 1) | function isEvent(num) { function alternateDigitSum (line 5) | function alternateDigitSum(n) { FILE: coding_interviews/leetcode/easy/apply-operations-to-an-array/apply-operations-to-an-array.js function applyOperations (line 1) | function applyOperations(nums) { FILE: coding_interviews/leetcode/easy/arithmetic_progression/arithmetic_progression.py function can_make_arithmetic_progression (line 4) | def can_make_arithmetic_progression(arr): FILE: coding_interviews/leetcode/easy/array_partition.py function array_pair_sum (line 8) | def array_pair_sum(nums): FILE: coding_interviews/leetcode/easy/average-of-levels-in-binary-tree/average-of-levels-in-binary-tree.js function averageOfLevels (line 1) | function averageOfLevels(root) { FILE: coding_interviews/leetcode/easy/average-salary-excluding-the-minimum-and-maximum-salary/average-salary-excluding-the-minimum-and-maximum-salary.js function average (line 1) | function average(salaries) { FILE: coding_interviews/leetcode/easy/average-value-of-even-numbers-that-are-divisible-by-three/average-value-of-even-numbers-that-are-divisible-by-three.js function isEven (line 3) | function isEven(num) { function isDividedBy3 (line 7) | function isDividedBy3(num) { function averageValue (line 11) | function averageValue(nums) { FILE: coding_interviews/leetcode/easy/backspace-string-compare/index.js function buildStack (line 1) | function buildStack(string) { function isEqual (line 15) | function isEqual(stack1, stack2) { function backspaceCompare (line 29) | function backspaceCompare(s, t) { FILE: coding_interviews/leetcode/easy/baseball-game/baseball-game.js function calPoints (line 1) | function calPoints(ops) { FILE: coding_interviews/leetcode/easy/best-poker-hand/best-poker-hand.js function buildMap (line 3) | function buildMap(list) { function bestHand (line 14) | function bestHand(ranks, suits) { FILE: coding_interviews/leetcode/easy/best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock-tle.js function maxProfit (line 1) | function maxProfit(prices) { FILE: coding_interviews/leetcode/easy/best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.js function maxProfit (line 1) | function maxProfit(prices) { FILE: coding_interviews/leetcode/easy/binary-number-with-alternating-bits/binary-number-with-alternating-bits.js function toBinary (line 1) | function toBinary(n) { function isAlternating (line 12) | function isAlternating(binary) { function hasAlternatingBits (line 24) | function hasAlternatingBits(n) { FILE: coding_interviews/leetcode/easy/binary-search/binary-search.js function search (line 1) | function search(nums, target) { FILE: coding_interviews/leetcode/easy/binary-tree-inorder-traversal/binary-tree-inorder-traversal.js function inorderTraversal (line 1) | function inorderTraversal(root) { FILE: coding_interviews/leetcode/easy/binary-tree-paths/binary-tree-paths.js function traversal (line 1) | function traversal(node, paths, path) { function binaryTreePaths (line 15) | function binaryTreePaths(root) { FILE: coding_interviews/leetcode/easy/binary-tree-postorder-traversal/binary-tree-postorder-traversal.js function postorderTraversal (line 1) | function postorderTraversal(root) { FILE: coding_interviews/leetcode/easy/binary-tree-preorder-traversal/binary-tree-preorder-traversal.js function preorderTraversal (line 1) | function preorderTraversal(root) { FILE: coding_interviews/leetcode/easy/binary-tree-tilt/binary-tree-tilt-optimized.js function sumNodes (line 14) | function sumNodes(node) { function findTilt (line 25) | function findTilt(root) { FILE: coding_interviews/leetcode/easy/binary-tree-tilt/binary-tree-tilt.js function sumNodes (line 12) | function sumNodes(node) { function findTilt (line 17) | function findTilt(root) { FILE: coding_interviews/leetcode/easy/binary_in_linked_list/binary_in_linked_list.py function get_decimal_value (line 1) | def get_decimal_value(head): FILE: coding_interviews/leetcode/easy/build_an_array_with_stack_operations/build_an_array_with_stack_operations.py function build_array (line 3) | def build_array(target, n): function build_array (line 21) | def build_array(target, n): FILE: coding_interviews/leetcode/easy/buy-two-chocolates/buy-two-chocolates-on.js function buyChoco (line 3) | function buyChoco(prices, money) { FILE: coding_interviews/leetcode/easy/buy-two-chocolates/buy-two-chocolates-sort.js function buyChoco (line 3) | function buyChoco(prices, money) { FILE: coding_interviews/leetcode/easy/buy-two-chocolates/buy-two-chocolates.js function buyChocolate (line 3) | function buyChocolate(prices, money) { function buyChoco (line 18) | function buyChoco(prices, money) { FILE: coding_interviews/leetcode/easy/calculate-amount-paid-in-taxes/calculate-amount-paid-in-taxes.js function calculateTax (line 3) | function calculateTax(brackets, income) { FILE: coding_interviews/leetcode/easy/calculate-delayed-arrival-time/calculate-delayed-arrival-time.js function findDelayedArrivalTime (line 3) | function findDelayedArrivalTime(arrivalTime, delayedTime) { FILE: coding_interviews/leetcode/easy/calculate-digit-sum-of-a-string/calculate-digit-sum-of-a-string.js function buildSubsets (line 1) | function buildSubsets(s, k) { function sumDigits (line 11) | function sumDigits(digits) { function sumDigitsOfSubsets (line 21) | function sumDigitsOfSubsets(subsets) { function digitSum (line 25) | function digitSum(s, k) { FILE: coding_interviews/leetcode/easy/calculate-money-in-leetcode-bank/calculate-money-in-leetcode-bank.js function totalMoney (line 1) | function totalMoney(n) { FILE: coding_interviews/leetcode/easy/can-place-flowers/can-place-flowers.js function canPlaceFlowers (line 1) | function canPlaceFlowers(flowerbed, n) { FILE: coding_interviews/leetcode/easy/capitalize-the-title/capitalize-the-title.js function isUppercase (line 1) | function isUppercase(char) { function isLowercase (line 5) | function isLowercase(char) { function capitalizeChar (line 9) | function capitalizeChar(char) { function lowercaseChar (line 13) | function lowercaseChar(char) { function capitalize (line 17) | function capitalize(string) { function lowercase (line 21) | function lowercase(string) { function parse (line 25) | function parse(string) { function capitalizeTitle (line 29) | function capitalizeTitle(title) { FILE: coding_interviews/leetcode/easy/cells-in-a-range-on-an-excel-sheet/cells-in-a-range-on-an-excel-sheet.js function cellsInRange (line 3) | function cellsInRange(s) { FILE: coding_interviews/leetcode/easy/check-array-formation-through-concatenation/check-array-formation-through-concatenation.js function buildMap (line 1) | function buildMap(pieces) { function canFormArray (line 11) | function canFormArray(arr, pieces) { FILE: coding_interviews/leetcode/easy/check-distances-between-same-letters/check-distances-between-same-letters.js function getDistanceIndex (line 1) | function getDistanceIndex(char) { function checkDistances (line 5) | function checkDistances(string, distance) { FILE: coding_interviews/leetcode/easy/check-if-a-string-is-an-acronym-of-words/check-if-a-string-is-an-acronym-of-words.js function isAcronym (line 3) | function isAcronym(words, s) { FILE: coding_interviews/leetcode/easy/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.js function hasPrefix (line 1) | function hasPrefix(word, searchWord) { function isPrefixOfWord (line 11) | function isPrefixOfWord(sentence, searchWord) { FILE: coding_interviews/leetcode/easy/check-if-all-as-appears-before-all-bs/check-if-all-as-appears-before-all-bs.js function checkString (line 1) | function checkString(s) { FILE: coding_interviews/leetcode/easy/check-if-matrix-is-x-matrix/check-if-matrix-is-x-matrix.js function isInGrid (line 1) | function isInGrid(grid, row, col) { constant DIAGONAL (line 5) | const DIAGONAL = -1; function getDiagonalFromLeftToRight (line 7) | function getDiagonalFromLeftToRight(grid) { function getDiagonalFromRightToLeft (line 22) | function getDiagonalFromRightToLeft(grid) { function isDiagonalNonZero (line 40) | function isDiagonalNonZero(diagonal) { function isOtherZero (line 44) | function isOtherZero(grid) { function checkXMatrix (line 56) | function checkXMatrix(grid) { function checkXMatrix (line 72) | function checkXMatrix(grid) { FILE: coding_interviews/leetcode/easy/check-if-number-has-equal-digit-count-and-digit-value/check-if-number-has-equal-digit-count-and-digit-value.js function digitCount (line 1) | function digitCount(num) { FILE: coding_interviews/leetcode/easy/check-if-numbers-are-ascending-in-a-sentence/check-if-numbers-are-ascending-in-a-sentence.js function getNumbers (line 1) | function getNumbers(string) { function isIncreasing (line 7) | function isIncreasing(numbers) { function areNumbersAscending (line 15) | function areNumbersAscending(string) { FILE: coding_interviews/leetcode/easy/check-if-the-sentence-is-pangram/check-if-the-sentence-is-pangram.py function check_if_pangram (line 3) | def check_if_pangram(sentence): function check_if_pangram (line 13) | def check_if_pangram(sentence): FILE: coding_interviews/leetcode/easy/check-whether-two-strings-are-almost-equivalent/check-whether-two-strings-are-almost-equivalent.js function createCounter (line 1) | function createCounter(word) { function isSimilar (line 12) | function isSimilar(word, counter1, counter2) { function checkAlmostEquivalent (line 22) | function checkAlmostEquivalent(word1, word2) { FILE: coding_interviews/leetcode/easy/check_if_two_string_arrays_are_equivalent/check_if_two_string_arrays_are_equivalent.py function array_strings_are_equal (line 4) | def array_strings_are_equal(word1, word2): FILE: coding_interviews/leetcode/easy/circular-sentence/circular-sentence.js function isCircularSentence (line 1) | function isCircularSentence(sentence) { FILE: coding_interviews/leetcode/easy/climbing-stairs/climbing-stairs.js function climbStairs (line 1) | function climbStairs(n) { FILE: coding_interviews/leetcode/easy/climbing_stairs.py function climb_stairs (line 3) | def climb_stairs(n): FILE: coding_interviews/leetcode/easy/consecutive-characters/consecutive-characters.js function maxPower (line 1) | function maxPower(string) { FILE: coding_interviews/leetcode/easy/construct-string-from-binary-tree/construct-string-from-binary-tree.js function tree2str (line 15) | function tree2str(root) { FILE: coding_interviews/leetcode/easy/contains-duplicate/contains-duplicate-hashmap.js function containsDuplicate (line 11) | function containsDuplicate(nums) { FILE: coding_interviews/leetcode/easy/contains-duplicate/contains-duplicate.js function containsDuplicate (line 1) | function containsDuplicate(nums) { FILE: coding_interviews/leetcode/easy/contains-duplicate/contains-duplicate.py function contains_nearby_duplicate (line 3) | def contains_nearby_duplicate(nums, k): function contains_nearby_duplicate (line 11) | def contains_nearby_duplicate(nums, k): FILE: coding_interviews/leetcode/easy/convert-sorted-array-to-binary-search-tree/convert-sorted-array-to-binary-search-tree.js function sortedArrayToBST (line 1) | function sortedArrayToBST(nums) { FILE: coding_interviews/leetcode/easy/convert-the-temperature/convert-the-temperature.js function convertTemperature (line 1) | function convertTemperature(celsius) { FILE: coding_interviews/leetcode/easy/count-asterisks/count-asterisks.js function toggleCanCount (line 1) | function toggleCanCount(canCount) { function countAsterisks (line 5) | function countAsterisks(s) { FILE: coding_interviews/leetcode/easy/count-common-words-with-one-occurrence/count-common-words-with-one-occurrence.js function buildHashmap (line 1) | function buildHashmap(words) { function countWords (line 15) | function countWords(words1, words2) { FILE: coding_interviews/leetcode/easy/count-complete-tree-nodes/count-complete-tree-nodes.js function countNodes (line 11) | function countNodes(node) { FILE: coding_interviews/leetcode/easy/count-equal-and-divisible-pairs-in-an-array/count-equal-and-divisible-pairs-in-an-array-2.js function countPairs (line 17) | function countPairs(numbers, k) { FILE: coding_interviews/leetcode/easy/count-equal-and-divisible-pairs-in-an-array/count-equal-and-divisible-pairs-in-an-array.js function countPairs (line 17) | function countPairs(numbers, k) { FILE: coding_interviews/leetcode/easy/count-good-triplets/count-good-triplets.py function count_good_triplets (line 8) | def count_good_triplets(arr, a, b, c): FILE: coding_interviews/leetcode/easy/count-integers-with-even-digit-sum/count-integers-with-even-digit-sum.js function sumDigits (line 1) | function sumDigits(numString) { function isEven (line 11) | function isEven(num) { function countEven (line 15) | function countEven(num) { FILE: coding_interviews/leetcode/easy/count-k-difference/count-k-difference.js function countKDifference (line 32) | function countKDifference(nums, k) { FILE: coding_interviews/leetcode/easy/count-largest-group/count-largest-group.js function sumDigits (line 3) | function sumDigits(num) { function countLargestGroup (line 14) | function countLargestGroup(n) { FILE: coding_interviews/leetcode/easy/count-operations-to-obtain-zero/count-operations-to-obtain-zero.js function countOperations (line 1) | function countOperations(num1, num2) { FILE: coding_interviews/leetcode/easy/count-pairs-of-similar-strings/count-pairs-of-similar-strings.js function buildCharsMap (line 1) | function buildCharsMap(word) { function hasAllChars (line 12) | function hasAllChars(word, charsMap) { function isSimilar (line 20) | function isSimilar(word1, word2) { function similarPairs (line 26) | function similarPairs(words) { FILE: coding_interviews/leetcode/easy/count-pairs-whose-sum-is-less-than-target/count-pairs-whose-sum-is-less-than-target-two-pointers.js function countPairs (line 3) | function countPairs(nums, target) { FILE: coding_interviews/leetcode/easy/count-pairs-whose-sum-is-less-than-target/count-pairs-whose-sum-is-less-than-target.js function countPairs (line 3) | function countPairs(nums, target) { FILE: coding_interviews/leetcode/easy/count-prefixes-of-a-given-string/count-prefixes-of-a-given-string.js function hasPrefix (line 1) | function hasPrefix(word, s) { function countPrefixes (line 11) | function countPrefixes(words, s) { FILE: coding_interviews/leetcode/easy/count-square-sum-triples/count-square-sum-triples.js function countTriples (line 1) | function countTriples(n) { FILE: coding_interviews/leetcode/easy/count-symmetric-integers/count-symmetric-integers.js function isSymmetricIntegers (line 3) | function isSymmetricIntegers(num) { function countSymmetricIntegers (line 20) | function countSymmetricIntegers(low, high) { FILE: coding_interviews/leetcode/easy/count-the-digits-that-divide-a-number/count-the-digits-that-divide-a-number.js function countDigits (line 1) | function countDigits(num) { FILE: coding_interviews/leetcode/easy/count-the-number-of-vowel-strings-in-range/count-the-number-of-vowel-strings-in-range.js constant VOWELS (line 1) | const VOWELS = ['a', 'e', 'i', 'o', 'u']; function isVowelString (line 3) | function isVowelString(string) { function vowelStrings (line 9) | function vowelStrings(words, left, right) { FILE: coding_interviews/leetcode/easy/count-vowel-substrings-of-a-string/count-vowel-substrings-of-a-string.js constant VOWELS (line 1) | const VOWELS = ['a', 'e', 'i', 'o', 'u']; function isVowel (line 3) | function isVowel(char) { function hasAllVowels (line 7) | function hasAllVowels(foundVowels) { function countVowelSubstrings (line 17) | function countVowelSubstrings(word) { FILE: coding_interviews/leetcode/easy/count_good_rectangles/count_good_rectangles.py function count_good_rectangles (line 8) | def count_good_rectangles(rectangles): function count_good_rectangles_optimized (line 25) | def count_good_rectangles_optimized(rectangles): FILE: coding_interviews/leetcode/easy/count_matches/count_matches.py function count_matches (line 3) | def count_matches(items, ruleKey, ruleValue): FILE: coding_interviews/leetcode/easy/count_of_matches_in_tournament/count_of_matches_in_tournament.py function number_of_matches (line 8) | def number_of_matches(n): FILE: coding_interviews/leetcode/easy/count_students/count_students.py function is_empty (line 3) | def is_empty(arr): function count_students (line 6) | def count_students(students, sandwiches): function count_students (line 36) | def count_students(students, sandwiches): FILE: coding_interviews/leetcode/easy/count_the_number_of_consistent_strings/count_the_number_of_consistent_strings.py function count_consistent_strings (line 8) | def count_consistent_strings(allowed, words): function count_consistent_strings (line 34) | def count_consistent_strings(allowed, words): FILE: coding_interviews/leetcode/easy/counting-bits/counting-bits.js function countOnesInBinaryTransformation (line 1) | function countOnesInBinaryTransformation(number) { function countBits (line 13) | function countBits(n) { FILE: coding_interviews/leetcode/easy/counting-words-with-a-given-prefix/counting-words-with-a-given-prefix.js function hasPrefix (line 1) | function hasPrefix(word, pref) { function prefixCount (line 18) | function prefixCount(words, pref) { FILE: coding_interviews/leetcode/easy/crawler-log-folder/crawler-log-folder.js function minOperations (line 1) | function minOperations(logs) { FILE: coding_interviews/leetcode/easy/create_target_array/create_target_array.py function createTargetArray (line 4) | def createTargetArray(nums, index): FILE: coding_interviews/leetcode/easy/decode-the-message/decode-the-message.js function decodeMessage (line 1) | function decodeMessage(key, message) { FILE: coding_interviews/leetcode/easy/decode_xored_array/decode_xored_array.py function decode (line 3) | def decode(encoded, first): FILE: coding_interviews/leetcode/easy/decompressed_encoded_list/decompressed_encoded_list.py function build_frequencies (line 18) | def build_frequencies(frequency, num): function decompress_list (line 22) | def decompress_list(nums): FILE: coding_interviews/leetcode/easy/decrypt_string/decrypt_string.py function alpha (line 3) | def alpha(num): function freqAlphabets (line 6) | def freqAlphabets(s): FILE: coding_interviews/leetcode/easy/defanging_an_ip_address/defanging_an_ip_address.py function defang_ip_address (line 12) | def defang_ip_address(address): FILE: coding_interviews/leetcode/easy/defuse-the-bomb/defuse-the-bomb.js function sumNextK (line 1) | function sumNextK(code, from, k) { function decryptNext (line 11) | function decryptNext(code, k) { function sumPreviousK (line 24) | function sumPreviousK(code, from, k) { function decryptPrevious (line 34) | function decryptPrevious(code, k) { function decryptWithZeros (line 47) | function decryptWithZeros(code) { function decrypt (line 51) | function decrypt(code, k) { FILE: coding_interviews/leetcode/easy/delete-greatest-value-in-each-row/delete-greatest-value-in-each-row.js function isEmpty (line 1) | function isEmpty(grid) { function deleteGreatestValue (line 11) | function deleteGreatestValue(grid) { FILE: coding_interviews/leetcode/easy/delete_columns_to_make_sorted/delete_columns_to_make_sorted.py function min_deletion_size (line 3) | def min_deletion_size(strs): FILE: coding_interviews/leetcode/easy/design_parking_system/design_parking_system.py class ParkingSystem (line 3) | class ParkingSystem: method __init__ (line 4) | def __init__(self, big, medium, small): method add_car (line 9) | def add_car(self, car_type): FILE: coding_interviews/leetcode/easy/destination_city/destination_city.py function dest_city (line 1) | def dest_city(paths): function dest_city (line 12) | def dest_city(paths): FILE: coding_interviews/leetcode/easy/detect-capital/detect-capital.js function allCapitals (line 1) | function allCapitals(word) { function allNotCapitals (line 5) | function allNotCapitals(word) { function firstCapital (line 9) | function firstCapital(word) { function detectCapitalUse (line 13) | function detectCapitalUse(word) { FILE: coding_interviews/leetcode/easy/determine-if-string-halves-are-alike/determine-if-string-halves-are-alike.js constant VOWELS (line 1) | const VOWELS = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']; function getVowelsCount (line 3) | function getVowelsCount(string) { function halvesAreAlike (line 13) | function halvesAreAlike(s) { FILE: coding_interviews/leetcode/easy/determine_color_of_a_chessboard_square/determine_color_of_a_chessboard_square.py function is_even (line 14) | def is_even(num): function square_is_white (line 17) | def square_is_white(coordinates): function square_is_white (line 22) | def square_is_white(coordinates): function square_is_white (line 26) | def square_is_white(coordinates): FILE: coding_interviews/leetcode/easy/di_string_match/di_string_match.py function di_string_match (line 3) | def di_string_match(S): FILE: coding_interviews/leetcode/easy/difference-between-element-sum-and-digit-sum-of-an-array/difference-between-element-sum-and-digit-sum-of-an-array.js function getDigitsSum (line 1) | function getDigitsSum(num) { function differenceOfSum (line 12) | function differenceOfSum(nums) { FILE: coding_interviews/leetcode/easy/discount_price/discount_price.py function finalPrices (line 1) | def finalPrices(prices): function get_discount (line 11) | def get_discount(prices, index, price): FILE: coding_interviews/leetcode/easy/distribute-candies-among-children-i/distribute-candies-among-children-i.js function distributeCandies (line 3) | function distributeCandies(n, limit) { FILE: coding_interviews/leetcode/easy/distribute-candies-among-children-i/distribute-candies-among-children-ii.js function distributeCandies (line 3) | function distributeCandies(n, limit) { FILE: coding_interviews/leetcode/easy/distribute-candies-to-people/distribute-candies-to-people.js function initPeopleCandies (line 1) | function initPeopleCandies(numPeople) { function distributeCandies (line 11) | function distributeCandies(candies, numPeople) { FILE: coding_interviews/leetcode/easy/divide-a-string-into-groups-of-size-k/divide-a-string-into-groups-of-size-k.js function fillChar (line 1) | function fillChar(lastGroup, fill, length) { function divideString (line 11) | function divideString(s, k, fill) { FILE: coding_interviews/leetcode/easy/divide-array-into-equal-pairs/divide-array-into-equal-pairs.js function divideArray (line 1) | function divideArray(nums) { FILE: coding_interviews/leetcode/easy/divisible-and-non-divisible-sums-difference/divisible-and-non-divisible-sums-difference.js function differenceOfSums (line 3) | function differenceOfSums(n, m) { FILE: coding_interviews/leetcode/easy/divisor-game/divisor-game.js function divisorGame (line 3) | function divisorGame(n) { FILE: coding_interviews/leetcode/easy/equal_reversed_arrays/equal_reversed_arrays.py function can_be_equal (line 23) | def can_be_equal(target, arr): function can_be_equal (line 29) | def can_be_equal(target, arr): function can_be_equal (line 52) | def can_be_equal(target, arr): FILE: coding_interviews/leetcode/easy/evaluate-boolean-binary-tree/evaluate-boolean-binary-tree.js function evaluateTree (line 6) | function evaluateTree(root) { FILE: coding_interviews/leetcode/easy/even_digits/even_digits.py function find_numbers (line 4) | def find_numbers(nums): FILE: coding_interviews/leetcode/easy/excel-sheet-column-number/excel-sheet-column-number.js function toNumber (line 1) | function toNumber(char) { function titleToNumber (line 5) | function titleToNumber(columnTitle) { FILE: coding_interviews/leetcode/easy/fair-candy-swap/fair-candy-swap-optimized.js function sum (line 1) | function sum(nums) { function buildMap (line 11) | function buildMap(bobSizes) { function fairCandySwap (line 21) | function fairCandySwap(aliceSizes, bobSizes) { FILE: coding_interviews/leetcode/easy/fair-candy-swap/fair-candy-swap.js function sum (line 1) | function sum(nums) { function fairCandySwap (line 11) | function fairCandySwap(aliceSizes, bobSizes) { FILE: coding_interviews/leetcode/easy/faulty-keyboard/faulty-keyboard.js function reverse (line 3) | function reverse(s) { function finalString (line 13) | function finalString(s) { FILE: coding_interviews/leetcode/easy/fibonacci_number/fibonacci_number.py function fib (line 3) | def fib(n): FILE: coding_interviews/leetcode/easy/final-value-after-operations/final-value-after-operations.js function finalValueAfterOperations (line 46) | function finalValueAfterOperations(operations = []) { FILE: coding_interviews/leetcode/easy/find-all-k-distant-indices-in-an-array/find-all-k-distant-indices-in-an-array.js function getJs (line 1) | function getJs(nums, key) { function isKDistant (line 11) | function isKDistant(index, js, k) { function findKDistantIndices (line 19) | function findKDistantIndices(nums, key, k) { FILE: coding_interviews/leetcode/easy/find-all-numbers-disappeared-in-an-array/find-all-numbers-disappeared-in-an-array.js function buildMap (line 1) | function buildMap(nums) { function findDisappearedNumbers (line 11) | function findDisappearedNumbers(nums) { FILE: coding_interviews/leetcode/easy/find-center-of-star-graph/find-center-of-star-graph.js function addConnection (line 1) | function addConnection(nodeToConnectionsCount, node) { function findCenter (line 9) | function findCenter(edges) { FILE: coding_interviews/leetcode/easy/find-champion-i/find-champion-i-no-map.js function findChampion (line 3) | function findChampion(grid) { FILE: coding_interviews/leetcode/easy/find-champion-i/find-champion-i.js function findChampion (line 3) | function findChampion(grid) { FILE: coding_interviews/leetcode/easy/find-first-palindromic-string-in-the-array/find-first-palindromic-string-in-the-array.js function isPalindrome (line 1) | function isPalindrome(word) { function firstPalindrome (line 11) | function firstPalindrome(words) { FILE: coding_interviews/leetcode/easy/find-indices-with-index-and-value-difference-i/find-indices-with-index-and-value-difference-i.js function findIndices (line 3) | function findIndices(nums, indexDifference, valueDifference) { FILE: coding_interviews/leetcode/easy/find-lucky-integer-in-an-array/find-lucky-integer-in-an-array.js function buildNumCounter (line 1) | function buildNumCounter(nums) { function findLucky (line 12) | function findLucky(nums) { FILE: coding_interviews/leetcode/easy/find-maximum-number-of-string-pairs/find-maximum-number-of-string-pairs.js function paired (line 3) | function paired(s1, s2) { function maximumNumberOfStringPairs (line 13) | function maximumNumberOfStringPairs(words) { FILE: coding_interviews/leetcode/easy/find-subarrays-with-equal-sum/find-subarrays-with-equal-sum.js function findSubarrays (line 1) | function findSubarrays(nums) { FILE: coding_interviews/leetcode/easy/find-target-indices-after-sorting-array/find-target-indices-after-sorting-array.js function targetIndices (line 1) | function targetIndices(nums, target) { FILE: coding_interviews/leetcode/easy/find-the-array-concatenation-value/find-the-array-concatenation-value.js function concat (line 1) | function concat(num1, num2) { function findTheArrayConcVal (line 5) | function findTheArrayConcVal(nums) { FILE: coding_interviews/leetcode/easy/find-the-difference-of-two-arrays/find-the-difference-of-two-arrays.js function buildHashmap (line 1) | function buildHashmap(nums) { function buildDistinct (line 11) | function buildDistinct(nums, hashmap) { function findDifference (line 24) | function findDifference(nums1, nums2) { FILE: coding_interviews/leetcode/easy/find-the-difference/find-the-difference.js function buildMap (line 1) | function buildMap(string) { function findTheDifference (line 12) | function findTheDifference(s, t) { FILE: coding_interviews/leetcode/easy/find-the-distance-value-between-two-arrays/find-the-distance-value-between-two-arrays.js function hasSmallerValue (line 3) | function hasSmallerValue(num, arr, d) { function findTheDistanceValue (line 11) | function findTheDistanceValue(arr1, arr2, d) { FILE: coding_interviews/leetcode/easy/find-the-distinct-difference-array/find-the-distinct-difference-array.js function countDistinct (line 3) | function countDistinct(nums, startIndex, endIndex) { function countDistinctPrefix (line 17) | function countDistinctPrefix(nums, index) { function countDistinctSufix (line 21) | function countDistinctSufix(nums, index) { function distinctDifferenceArray (line 25) | function distinctDifferenceArray(nums) { FILE: coding_interviews/leetcode/easy/find-the-distinct-difference-array/optimized-find-the-distinct-difference-array.js function distinctDifferenceArray (line 3) | function distinctDifferenceArray(nums) { FILE: coding_interviews/leetcode/easy/find-the-maximum-achievable-number/find-the-maximum-achievable-number.js function theMaximumAchievableX (line 3) | function theMaximumAchievableX(num, t) { FILE: coding_interviews/leetcode/easy/find-the-middle-index-in-array/find-the-middle-index-in-array.js function sum (line 1) | function sum(nums) { function findMiddleIndex (line 5) | function findMiddleIndex(nums) { FILE: coding_interviews/leetcode/easy/find-the-pivot-integer/find-the-pivot-integer.js constant NO_PIVOT (line 1) | const NO_PIVOT = -1; function sum (line 3) | function sum(n) { function pivotInteger (line 13) | function pivotInteger(n) { FILE: coding_interviews/leetcode/easy/find-the-width-of-columns-of-a-grid/find-the-width-of-columns-of-a-grid.js function findColumnWidth (line 3) | function findColumnWidth(grid) { FILE: coding_interviews/leetcode/easy/find-words-containing-character/find-words-containing-character.js function findWordsContaining (line 3) | function findWordsContaining(words, x) { FILE: coding_interviews/leetcode/easy/find-words-that-can-be-formed-by-characters/find-words-that-can-be-formed-by-characters.js function buildCounter (line 1) | function buildCounter(chars) { function isGood (line 12) | function isGood(word, counterCopy) { function countCharacters (line 22) | function countCharacters(words, chars) { FILE: coding_interviews/leetcode/easy/find_common_characters/find_common_characters.py function common_chars (line 3) | def common_chars(A): FILE: coding_interviews/leetcode/easy/find_the_highest_altitude/find_the_highest_altitude.py function largest_altitude (line 3) | def largest_altitude(gain): FILE: coding_interviews/leetcode/easy/first-bad-version/first-bad-version-binary-search.js function getMiddle (line 1) | function getMiddle(start, end) { function binarySearchFirstBadVersion (line 5) | function binarySearchFirstBadVersion(isBadVersion) { function solution (line 30) | function solution(isBadVersion) { FILE: coding_interviews/leetcode/easy/first-bad-version/first-bad-version.js function solution (line 1) | function solution(isBadVersion) { FILE: coding_interviews/leetcode/easy/first-letter-to-appear-twice/first-letter-to-appear-twice.js function repeatedCharacter (line 1) | function repeatedCharacter(s) { FILE: coding_interviews/leetcode/easy/first-unique-character-in-a-string/first-unique-character-in-a-string.js function firstUniqChar (line 1) | function firstUniqChar(s) { FILE: coding_interviews/leetcode/easy/first_bad_version/first_bad_version.py function is_bad_version (line 54) | def is_bad_version(version): function first_bad_version (line 58) | def first_bad_version(n): FILE: coding_interviews/leetcode/easy/fizz-buzz/fizz-buzz.js function fizzBuzz (line 1) | function fizzBuzz(n) { FILE: coding_interviews/leetcode/easy/flipping_an_image.py function flip_and_invert_image (line 6) | def flip_and_invert_image(image): FILE: coding_interviews/leetcode/easy/flood-fill/flood-fill-without-visited.js function isInsideTheGrid (line 1) | function isInsideTheGrid(image, row, col) { function dfs (line 7) | function dfs(image, row, col, newColor, startingPixel) { function floodFill (line 17) | function floodFill(image, row, col, newColor) { FILE: coding_interviews/leetcode/easy/flood-fill/flood-fill.js function isInsideTheGrid (line 8) | function isInsideTheGrid(image, row, col) { function floodFillHelper (line 14) | function floodFillHelper(image, sr, sc, newColor, startingPixel, visited) { function buildVisitedMatrix (line 81) | function buildVisitedMatrix(image) { function floodFill (line 97) | function floodFill(image, sr, sc, newColor) { FILE: coding_interviews/leetcode/easy/furthest-point-from-origin/furthest-point-from-origin.js function furthestDistanceFromOrigin (line 3) | function furthestDistanceFromOrigin(moves) { FILE: coding_interviews/leetcode/easy/generate_the_string/generate_the_string.py function generate_the_string (line 3) | def generate_the_string(n): FILE: coding_interviews/leetcode/easy/goal_parser_interpretation/goal_parser_interpretation.py function interpret (line 4) | def interpret(command): FILE: coding_interviews/leetcode/easy/greatest-english-letter-in-upper-and-lower-case/greatest-english-letter-in-upper-and-lower-case.js function greatestLetter (line 1) | function greatestLetter(string) { FILE: coding_interviews/leetcode/easy/greatest_candies/greatest_candies.py function kids_with_candies (line 9) | def kids_with_candies(candies, extra_candies): function map_can_be_greatest (line 14) | def map_can_be_greatest(candies, extra_candies, greatest_candy): function get_greatest (line 23) | def get_greatest(candies): FILE: coding_interviews/leetcode/easy/guess-number-higher-or-lower/guess-number-higher-or-lower.js function guessNumber (line 3) | function guessNumber(n) { FILE: coding_interviews/leetcode/easy/halves_are_alike/halves_are_alike.py function halves_are_alike (line 4) | def halves_are_alike(s): FILE: coding_interviews/leetcode/easy/hamming_distance/hamming_distance.py function get_bit (line 1) | def get_bit(number): function hamming_distance (line 4) | def hamming_distance(x, y): function hamming_distance_2 (line 28) | def hamming_distance_2(x, y): FILE: coding_interviews/leetcode/easy/height_checker/height_checker.py function height_checker (line 3) | def height_checker(heights): FILE: coding_interviews/leetcode/easy/implement-stack-using-queues/implement-stack-using-queues.js function MyStack (line 1) | function MyStack() { FILE: coding_interviews/leetcode/easy/increasing_decreasing_string/incresing_decreasin_string.py function sort_string (line 5) | def sort_string(s): FILE: coding_interviews/leetcode/easy/increasing_order_search_tree/increasing_order_search_tree.py function increasingBST (line 1) | def increasingBST(root): function helper (line 13) | def helper(self, old_tree, arr): FILE: coding_interviews/leetcode/easy/intersection-of-multiple-arrays/intersection-of-multiple-arrays.js function intersection (line 1) | function intersection(nums) { FILE: coding_interviews/leetcode/easy/intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.js function intersect (line 14) | function intersect(nums1, nums2) { FILE: coding_interviews/leetcode/easy/intersection_of_two_arrays/intersection_of_two_arrays.py function intersection (line 4) | def intersection(nums1, nums2): function intersection (line 14) | def intersection(nums1, nums2): function intersection (line 18) | def intersection(nums1, nums2): FILE: coding_interviews/leetcode/easy/intersection_of_two_arrays_ii/intersection_of_two_arrays.py function intersection (line 4) | def intersection(nums1, nums2): FILE: coding_interviews/leetcode/easy/invert-binary-tree/invert-binary-tree.js function invertTree (line 1) | function invertTree(root) { FILE: coding_interviews/leetcode/easy/is-subsequence/is-subsequence.js function isSubsequence (line 3) | function isSubsequence(s, t) { FILE: coding_interviews/leetcode/easy/is_palindrome.py function is_palindrome (line 3) | def is_palindrome(x): FILE: coding_interviews/leetcode/easy/is_sum_equal/is_sum_equal.py function get_numerical_value (line 16) | def get_numerical_value(word): function is_sum_equal (line 24) | def is_sum_equal(first_word, second_word, target_word): FILE: coding_interviews/leetcode/easy/island-perimeter/island-perimeter.js function isOffGrid (line 1) | function isOffGrid(grid, row, col) { function isWater (line 5) | function isWater(grid, row, col) { function isPartOfIsland (line 9) | function isPartOfIsland(grid, row, col) { function wasAlreadyVisited (line 13) | function wasAlreadyVisited(grid, row, col) { function dfs (line 17) | function dfs(grid, row, col) { function islandPerimeter (line 36) | function islandPerimeter(grid) { FILE: coding_interviews/leetcode/easy/jewels_and_stones.py function num_jewels_in_stones (line 12) | def num_jewels_in_stones(J, S): function num_jewels_in_stones_opt (line 29) | def num_jewels_in_stones_opt(J, S): FILE: coding_interviews/leetcode/easy/judge_route_circle.py function judge_circle (line 13) | def judge_circle(moves): FILE: coding_interviews/leetcode/easy/judge_route_circle_one_line.py function judge_circle (line 13) | def judge_circle(moves): FILE: coding_interviews/leetcode/easy/k-items-with-the-maximum-sum/k-items-with-the-maximum-sum-second.js function kItemsWithMaximumSum (line 3) | function kItemsWithMaximumSum(numOnes, numZeros, numNegOnes, k) { FILE: coding_interviews/leetcode/easy/k-items-with-the-maximum-sum/k-items-with-the-maximum-sum.js function kItemsWithMaximumSum (line 3) | function kItemsWithMaximumSum(numOnes, numZeros, numNegOnes, k) { FILE: coding_interviews/leetcode/easy/keep-multiplying-found-values-by-two/keep-multiplying-found-values-by-two.js function findFinalValue (line 1) | function findFinalValue(nums, original) { FILE: coding_interviews/leetcode/easy/keyboard-row/keyboard-row.js function stringToMap (line 1) | function stringToMap(string) { function belongsToRow (line 15) | function belongsToRow(word, row) { function belongsToSomeRow (line 25) | function belongsToSomeRow(word) { function findWords (line 34) | function findWords(words) { FILE: coding_interviews/leetcode/easy/kth-distinct-string-in-an-array/kth-distinct-string-in-an-array.js function kthDistinct (line 1) | function kthDistinct(arr, k) { function kthDistinct (line 29) | function kthDistinct(arr, k) { FILE: coding_interviews/leetcode/easy/largest-local-values-in-a-matrix/largest-local-values-in-a-matrix.js function getLargestFromGrid (line 1) | function getLargestFromGrid(grid, startRow, startCol, endRow, endCol) { function largestLocal (line 13) | function largestLocal(grid) { FILE: coding_interviews/leetcode/easy/largest-number-after-digit-swaps-by-parity/largest-number-after-digit-swaps-by-parity.js function largestInteger (line 6) | function largestInteger(num) { FILE: coding_interviews/leetcode/easy/largest-positive-integer-that-exists-with-its-negative/largest-positive-integer-that-exists-with-its-negative.js function findMaxK (line 1) | function findMaxK(nums) { FILE: coding_interviews/leetcode/easy/last-stone-weight/last-stone-weight.js function getTwoHaviest (line 1) | function getTwoHaviest(stones) { function removeStone (line 26) | function removeStone(stones, stoneToBeRemoved) { function updateStone (line 35) | function updateStone(stones, stone, stoneWeight) { function lastStoneWeight (line 44) | function lastStoneWeight(stones) { FILE: coding_interviews/leetcode/easy/last-visited-integers/last-visited-integers.js function getLastInteger (line 3) | function getLastInteger(words, lastNumberIndex, consecutivePrevs) { function lastVisitedIntegers (line 25) | function lastVisitedIntegers(words) { FILE: coding_interviews/leetcode/easy/leaf-similar-trees/leaf-similar-trees.js function getLeafValueSequence (line 10) | function getLeafValueSequence(node, leafValueSequence) { function hasSimilarLeafSequence (line 21) | function hasSimilarLeafSequence(leafValueSequence1, leafValueSequence2) { function leafSimilar (line 31) | function leafSimilar(root1, root2) { FILE: coding_interviews/leetcode/easy/left-and-right-sum-differences/left-and-right-sum-differences.js function sum (line 1) | function sum(nums) { function leftRigthDifference (line 11) | function leftRigthDifference(nums) { FILE: coding_interviews/leetcode/easy/lexicographically-smallest-palindrome/lexicographically-smallest-palindrome.js function makeSmallestPalindrome (line 1) | function makeSmallestPalindrome(string) { FILE: coding_interviews/leetcode/easy/linked-list-cycle/linked-list-cycle.js function hasCycle (line 1) | function hasCycle(head) { FILE: coding_interviews/leetcode/easy/longer-contiguous-segments-of-ones-than-zeros/longer-contiguous-segments-of-ones-than-zeros.js function checkZeroOnes (line 1) | function checkZeroOnes(s) { FILE: coding_interviews/leetcode/easy/longest-nice-substring/longest-nice-substring.js function isNice (line 1) | function isNice(substring, map) { function longestNiceSubstring (line 11) | function longestNiceSubstring(s) { FILE: coding_interviews/leetcode/easy/longest-subsequence-with-limited-sum/longest-subsequence-with-limited-sum.js function immutableSort (line 1) | function immutableSort(nums) { function buildAllSums (line 5) | function buildAllSums(nums) { function answerQueries (line 17) | function answerQueries(nums, queries) { FILE: coding_interviews/leetcode/easy/longest_palindrome.py function count_pairs (line 1) | def count_pairs(letters): function main (line 21) | def main(letters): FILE: coding_interviews/leetcode/easy/lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.js function lowestCommonAncestor (line 1) | function lowestCommonAncestor(root, p, q) { FILE: coding_interviews/leetcode/easy/lucky_numbers_in_a_matrix/lucky_numbers_in_a_matrix.py function lucky_numbers (line 3) | def lucky_numbers(matrix): FILE: coding_interviews/leetcode/easy/majority-element/majority-element.js function majorityElement (line 1) | function majorityElement(nums) { FILE: coding_interviews/leetcode/easy/make-array-zero-by-subtracting-equal-amounts/make-array-zero-by-subtracting-equal-amounts.js function minimumOperationsAllInOne (line 1) | function minimumOperationsAllInOne(nums) { function smallestExceptZeros (line 34) | function smallestExceptZeros(smallest, num) { function getSmallest (line 38) | function getSmallest(nums) { function performSubtraction (line 50) | function performSubtraction(nums, smallestToSubtract, smallest) { function minimumOperations (line 63) | function minimumOperations(nums) { function minimumOperationsSet (line 77) | function minimumOperationsSet(nums) { FILE: coding_interviews/leetcode/easy/make-the-string-great/make-the-string-great.js function isUpperCase (line 1) | function isUpperCase(char1, char2) { function isLowerCase (line 5) | function isLowerCase(char1, char2) { function isBadPair (line 9) | function isBadPair(char1, char2) { function makeGood (line 18) | function makeGood(string, pointer1 = 0, pointer2 = 1) { FILE: coding_interviews/leetcode/easy/matrix-cells-in-distance-order/matrix-cells-in-distance-order.js function sortDistances (line 1) | function sortDistances(distances) { function allCellsDistOrder (line 5) | function allCellsDistOrder(rows, cols, rCenter, cCenter) { FILE: coding_interviews/leetcode/easy/matrix_diagonal_sum/matrix_diagonal_sum.py function diagonal_sum (line 8) | def diagonal_sum(mat): FILE: coding_interviews/leetcode/easy/matrix_negative_numbers/matrix_negative_numbers.py function count_negatives (line 1) | def count_negatives(grid): FILE: coding_interviews/leetcode/easy/max-consecutive-ones/max-consecutive-ones.js function findMaxConsecutiveOnes (line 1) | function findMaxConsecutiveOnes(nums) { FILE: coding_interviews/leetcode/easy/maximum-69-number/maximum-69-number.js function maximum69Number (line 1) | function maximum69Number(num) { FILE: coding_interviews/leetcode/easy/maximum-ascending-subarray-sum/maximum-ascending-subarray-sum.js function maxAscendingSum (line 1) | function maxAscendingSum(nums) { FILE: coding_interviews/leetcode/easy/maximum-count-of-positive-integer-and-negative-integer/maximum-count-of-positive-integer-and-negative-integer.js function maximumCount (line 1) | function maximumCount(nums) { FILE: coding_interviews/leetcode/easy/maximum-depth-of-binary-tree/maximum-depth-of-binary-tree-2.js function getMaximumDepth (line 1) | function getMaximumDepth(node, depth) { function maxDepth (line 12) | function maxDepth(root) { function maxDepth (line 24) | function maxDepth(root, depth = 0) { FILE: coding_interviews/leetcode/easy/maximum-depth-of-n-ary-tree/maximum-depth-of-n-ary-tree.js function maxDepth (line 1) | function maxDepth(root, depth = 1) { FILE: coding_interviews/leetcode/easy/maximum-number-of-balloons/maximum-number-of-balloons.js function buildHashmap (line 1) | function buildHashmap(text) { function maxNumberOfBalloons (line 12) | function maxNumberOfBalloons(text) { FILE: coding_interviews/leetcode/easy/maximum-number-of-pairs-in-array/maximum-number-of-pairs-in-array.js function numberOfPairs (line 1) | function numberOfPairs(nums) { FILE: coding_interviews/leetcode/easy/maximum-odd-binary-number/maximum-odd-binary-number.js function countOnesAndZeros (line 3) | function countOnesAndZeros(s) { function maximumOddBinaryNumber (line 18) | function maximumOddBinaryNumber(s) { FILE: coding_interviews/leetcode/easy/maximum-subarray/maximum-subarray.js function maxSubArray (line 1) | function maxSubArray(nums) { FILE: coding_interviews/leetcode/easy/maximum-sum-with-exactly-k-elements/maximum-sum-with-exactly-k-elements.js function getBiggest (line 1) | function getBiggest(nums) { function maximizeSum (line 11) | function maximizeSum(nums, k) { FILE: coding_interviews/leetcode/easy/maximum-units-on-a-truck/maximum-units-on-a-truck.py function maximum_units (line 3) | def maximum_units(box_types, truck_size): FILE: coding_interviews/leetcode/easy/maximum-value-of-a-string-in-an-array/maximum-value-of-a-string-in-an-array.js function maximumValue (line 1) | function maximumValue(strs) { FILE: coding_interviews/leetcode/easy/maximum_nesting_depth_of_the_parentheses/maximum_nesting_depth_of_the_parentheses.py function max_depth (line 3) | def max_depth(s): FILE: coding_interviews/leetcode/easy/maximum_number_of_balls_in_a_box/maximum_number_of_balls_in_a_box.py function get_box (line 3) | def get_box(ball): function count_balls (line 12) | def count_balls(low_limit, high_limit): FILE: coding_interviews/leetcode/easy/maximum_population/maximum_population.py function maximum_population (line 3) | def maximum_population(logs): FILE: coding_interviews/leetcode/easy/maximum_product/maximum_product.py function max_product (line 4) | def max_product(nums): function max_product (line 9) | def max_product(nums): FILE: coding_interviews/leetcode/easy/mean-of-array-after-removing-some-elements/mean-of-array-after-removing-some-elements.js function removeFivePercent (line 1) | function removeFivePercent(numbers) { function sum (line 7) | function sum(numbers) { function trimMean (line 11) | function trimMean(numbers) { FILE: coding_interviews/leetcode/easy/merge-nodes-in-between-zeros/merge-nodes-in-between-zeros.js class ListNode (line 1) | class ListNode { method constructor (line 2) | constructor(val, next) { function mergeNodes (line 8) | function mergeNodes(head) { FILE: coding_interviews/leetcode/easy/merge-nodes-in-between-zeros/tests/merge-nodes-in-between-zeros.test.js function buildList (line 4) | function buildList(nums, initValue = 0) { FILE: coding_interviews/leetcode/easy/merge-similar-items/merge-similar-items.js function fillHashmapAndList (line 1) | function fillHashmapAndList(items, hashmap, list) { function mergeSimilarItems (line 12) | function mergeSimilarItems(items1, items2) { FILE: coding_interviews/leetcode/easy/merge-sorted-array/merge-sorted-array.js function merge (line 12) | function merge(nums1, m, nums2, n) { FILE: coding_interviews/leetcode/easy/merge-two-2d-arrays-by-summing-values/merge-two-2d-arrays-by-summing-values.js function mergeArrays (line 1) | function mergeArrays(nums1, nums2) { FILE: coding_interviews/leetcode/easy/merge-two-binary-trees/merge-two-binary-trees.js function mergeTrees (line 1) | function mergeTrees(root1, root2) { FILE: coding_interviews/leetcode/easy/merge-two-sorted-lists/merge-two-sorted-lists.js class ListNode (line 1) | class ListNode { method constructor (line 2) | constructor(val, next) { function mergeTwoLists (line 8) | function mergeTwoLists(list1, list2) { FILE: coding_interviews/leetcode/easy/merge-two-sorted-lists/tests/merge-two-sorted-lists.test.js function buildList (line 4) | function buildList(nums) { FILE: coding_interviews/leetcode/easy/merge_strings_alternately/merge_strings_alternately.py function mergeAlternately (line 3) | def mergeAlternately(word1, word2): FILE: coding_interviews/leetcode/easy/merge_trees.py class TreeNode (line 21) | class TreeNode(object): method __init__ (line 22) | def __init__(self, val): function merge_trees (line 27) | def merge_trees(t1, t2): FILE: coding_interviews/leetcode/easy/merge_two_lists.py class ListNode (line 3) | class ListNode(object): method __init__ (line 4) | def __init__(self, x): function merge_two_lists (line 8) | def merge_two_lists(l1, l2): FILE: coding_interviews/leetcode/easy/middle-of-the-linked-list/middle-of-the-linked-list-fast-slow.js function middleNode (line 1) | function middleNode(head) { FILE: coding_interviews/leetcode/easy/middle-of-the-linked-list/middle-of-the-linked-list.js function getNodeCount (line 19) | function getNodeCount(node, count) { function getNode (line 23) | function getNode(node, index) { function middleNode (line 27) | function middleNode(head) { FILE: coding_interviews/leetcode/easy/min-max-game/min-max-game.js function minMaxGame (line 1) | function minMaxGame(nums) { FILE: coding_interviews/leetcode/easy/minimize-string-length/minimize-string-length.js function minimizedStringLength (line 3) | function minimizedStringLength(s) { FILE: coding_interviews/leetcode/easy/minimum-absolute-difference-in-bst/minimum-absolute-difference-in-bst.js function getMinimumDifference (line 1) | function getMinimumDifference(root, rootVal = Infinity) { function traverse (line 12) | function traverse(node, list) { function diff (line 19) | function diff(list) { function getMinimumDifference (line 31) | function getMinimumDifference(root) { FILE: coding_interviews/leetcode/easy/minimum-bit-flips-to-convert-number/minimum-bit-flips-to-convert-number.js function toBinary (line 1) | function toBinary(number) { function minBitFlips (line 12) | function minBitFlips(start, goal) { FILE: coding_interviews/leetcode/easy/minimum-cost-to-move-chips-to-the-same-position/minimum-cost-to-move-chips-to-the-same-position.js function minCostToMoveChips (line 1) | function minCostToMoveChips(positions) { FILE: coding_interviews/leetcode/easy/minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.js function minDepth (line 11) | function minDepth(node, depth = 1) { FILE: coding_interviews/leetcode/easy/minimum-distance-between-bst-nodes/minimum-distance-between-bst-nodes.js function traverse (line 1) | function traverse(node, list) { function getMinDiff (line 8) | function getMinDiff(list) { function minDiffInBST (line 20) | function minDiffInBST(root) { FILE: coding_interviews/leetcode/easy/minimum-number-game/minimum-number-game.js function numberGame (line 3) | function numberGame(nums) { FILE: coding_interviews/leetcode/easy/minimum-number-of-moves-to-seat-everyone/minimum-number-of-moves-to-seat-everyone.js function sort (line 1) | function sort(nums) { function minMovesToSeat (line 5) | function minMovesToSeat(seats, students) { FILE: coding_interviews/leetcode/easy/minimum-number-of-operations-to-convert-time/minimum-number-of-operations-to-convert-time.js function toMinutes (line 1) | function toMinutes(stringTime) { function convertTime (line 6) | function convertTime(current, correct) { FILE: coding_interviews/leetcode/easy/minimum-string-length-after-removing-substrings/minimum-string-length-after-removing-substrings.js function minLength (line 3) | function minLength(s) { FILE: coding_interviews/leetcode/easy/minimum-subsequence-in-non-increasing-order/minimum-subsequence-in-non-increasing-order.js function sum (line 1) | function sum(nums) { function minSubsequence (line 5) | function minSubsequence(nums) { FILE: coding_interviews/leetcode/easy/minimum-sum-of-mountain-triplets-i/minimum-sum-of-mountain-triplets-i.js function minimumSum (line 3) | function minimumSum(nums) { FILE: coding_interviews/leetcode/easy/minimum-sum/minimum-sum.js function getAllDigits (line 25) | function getAllDigits(number) { function sort (line 36) | function sort(digits) { function minimumSum (line 40) | function minimumSum(number) { function altMinimunSum (line 51) | function altMinimunSum(number) { FILE: coding_interviews/leetcode/easy/minimum-value-to-get-positive-step-by-step-sum/minimum-value-to-get-positive-step-by-step-sum.js function getMinValue (line 1) | function getMinValue(nums) { function minStartValue (line 13) | function minStartValue(nums) { FILE: coding_interviews/leetcode/easy/minimum_operations_to_make_the_array_increasing/minimum_operations_to_make_the_array_increasing.py function min_operations (line 3) | def min_operations(nums): function min_operations (line 17) | def min_operations(nums): FILE: coding_interviews/leetcode/easy/missing-number/missing-number.js function buildHashmap (line 1) | function buildHashmap(nums) { function getMissingNumber (line 11) | function getMissingNumber(numsLength, hashmap) { function missingNumber (line 17) | function missingNumber(nums) { FILE: coding_interviews/leetcode/easy/monotonic-array/monotonic-array.js function isMonotonic (line 1) | function isMonotonic(nums) { FILE: coding_interviews/leetcode/easy/most-words-found/most-words-found.js function mostWordsFound (line 22) | function mostWordsFound(sentences = []) { FILE: coding_interviews/leetcode/easy/move-zeroes/move-zeroes-in-place.js function moveZeroes (line 1) | function moveZeroes(nums) { FILE: coding_interviews/leetcode/easy/move-zeroes/move-zeroes.js function moveZeroes (line 1) | function moveZeroes(nums) { FILE: coding_interviews/leetcode/easy/n_ary_tree_postorder_traversal/n_ary_tree_postorder_traversal.py function postorder (line 5) | def postorder(root): FILE: coding_interviews/leetcode/easy/n_ary_tree_preorder_traversal/n_ary_tree_preorder_traversal.py function preorder (line 5) | def preorder(root): FILE: coding_interviews/leetcode/easy/n_repeated_element_in_size_2n_array/n_repeated_element_in_size_2n_array.py function n_repeated_element_in_size_2n_array (line 23) | def n_repeated_element_in_size_2n_array(A): FILE: coding_interviews/leetcode/easy/neither-minimum-nor-maximum/neither-minimum-nor-maximum-on.js function findNonMinOrMax (line 3) | function findNonMinOrMax(nums) { FILE: coding_interviews/leetcode/easy/neither-minimum-nor-maximum/neither-minimum-nor-maximum.js function findNonMinOrMax (line 3) | function findNonMinOrMax(nums) { FILE: coding_interviews/leetcode/easy/next-greater-element-i/next-greater-element-i-optimized.js function peek (line 1) | function peek(stack) { function isEmpty (line 5) | function isEmpty(stack) { function nextGreaterElement (line 9) | function nextGreaterElement(nums1, nums2) { FILE: coding_interviews/leetcode/easy/next-greater-element-i/next-greater-element-i.js function nextGreaterElement (line 1) | function nextGreaterElement(nums1, nums2) { FILE: coding_interviews/leetcode/easy/num_unique_emails/num_unique_emails.py function num_unique_emails (line 1) | def num_unique_emails(emails): FILE: coding_interviews/leetcode/easy/number-of-1-bits/number-of-1-bits.js function hammingWeight (line 1) | function hammingWeight(n) { FILE: coding_interviews/leetcode/easy/number-of-arithmetic-triplets/number-of-arithmetic-triplets.js function buildMap (line 1) | function buildMap(nums) { function arithmeticTriplets (line 11) | function arithmeticTriplets(nums, diff) { FILE: coding_interviews/leetcode/easy/number-of-common-factors/number-of-common-factors.js function commonFactors (line 1) | function commonFactors(a, b) { FILE: coding_interviews/leetcode/easy/number-of-employees-who-met-the-target/number-of-employees-who-met-the-target.js function numberOfEmployeesWhoMetTarget (line 1) | function numberOfEmployeesWhoMetTarget(hours, target) { FILE: coding_interviews/leetcode/easy/number-of-even-and-odd-bits/number-of-even-and-odd-bits.js function toBinary (line 1) | function toBinary(n) { function isEven (line 12) | function isEven(n) { function isOdd (line 16) | function isOdd(n) { function evenOddBit (line 20) | function evenOddBit(n) { FILE: coding_interviews/leetcode/easy/number-of-lines-to-write-string/number-of-lines-to-write-string.js function toWidthsIndex (line 3) | function toWidthsIndex(char) { function numberOfLines (line 7) | function numberOfLines(widths, s) { FILE: coding_interviews/leetcode/easy/number-of-senior-citizens/number-of-senior-citizens.js function countSeniors (line 1) | function countSeniors(details) { FILE: coding_interviews/leetcode/easy/number-of-senior-citizens/one-liner-number-of-senior-citizens.js function countSeniors (line 1) | function countSeniors(details) { FILE: coding_interviews/leetcode/easy/number-of-unequal-triplets-in-array/number-of-unequal-triplets-in-array.js function unequalTriplets (line 1) | function unequalTriplets(nums) { FILE: coding_interviews/leetcode/easy/number_complement.py function to_binary (line 11) | def to_binary(num): function to_binary_complement (line 21) | def to_binary_complement(binary_num): function to_complement (line 24) | def to_complement(complement_binary_num): function find_complement (line 27) | def find_complement(num): FILE: coding_interviews/leetcode/easy/number_of_good_pairs/number_of_good_pairs.py function factorial (line 1) | def factorial(n): function permutation (line 5) | def permutation(n, r): function number_of_good_pairs (line 8) | def number_of_good_pairs(nums): function permutation (line 29) | def permutation(n, r): function number_of_good_pairs (line 32) | def number_of_good_pairs(nums): function number_of_good_pairs (line 51) | def number_of_good_pairs(nums): function number_of_good_pairs (line 68) | def number_of_good_pairs(nums): FILE: coding_interviews/leetcode/easy/number_of_recent_calls/number_of_recent_calls.py class RecentCounter (line 3) | class RecentCounter: method __init__ (line 4) | def __init__(self): method ping (line 7) | def ping(self, t: int) -> int: method __init__ (line 20) | def __init__(self): method ping (line 23) | def ping(self, t: int) -> int: class RecentCounter (line 19) | class RecentCounter: method __init__ (line 4) | def __init__(self): method ping (line 7) | def ping(self, t: int) -> int: method __init__ (line 20) | def __init__(self): method ping (line 23) | def ping(self, t: int) -> int: FILE: coding_interviews/leetcode/easy/number_of_students/number_of_students.py function busy_student (line 1) | def busy_student(start_time, end_time, query_time): function busy_student (line 13) | def busy_student(start_time, end_time, query_time): FILE: coding_interviews/leetcode/easy/odd-string-difference/odd-string-difference.js function toCode (line 1) | function toCode(char) { function buildDiffIntegerArray (line 5) | function buildDiffIntegerArray(word) { function joinIntegersString (line 18) | function joinIntegersString(diff) { function oddString (line 22) | function oddString(words) { FILE: coding_interviews/leetcode/easy/odd_in_matrix/odd_in_matrix.py function init_matrix (line 1) | def init_matrix(rows, columns): function odd_cells (line 5) | def odd_cells(n, m, indices): FILE: coding_interviews/leetcode/easy/partition_labels.py function partition_labels (line 14) | def partition_labels(S): FILE: coding_interviews/leetcode/easy/pascals-triangle/pascals-triangle.js function generate (line 1) | function generate(numRows) { FILE: coding_interviews/leetcode/easy/path-sum/path-sum.js function hasPathSum (line 1) | function hasPathSum(root, targetSum, sum = 0) { FILE: coding_interviews/leetcode/easy/peak_index_mountain.py function peak_index_in_mountain_array (line 11) | def peak_index_in_mountain_array(A): FILE: coding_interviews/leetcode/easy/percentage-of-letter-in-string/percentage-of-letter-in-string.js function percentageLetter (line 1) | function percentageLetter(s, letter) { FILE: coding_interviews/leetcode/easy/plus_one/plus_one.js function add_one (line 3) | function add_one(digits) { function plus_one (line 7) | function plus_one(digits, inc) { FILE: coding_interviews/leetcode/easy/plus_one/plus_one.py function add_one (line 4) | def add_one(digits): function plus_one (line 8) | def plus_one(digits, inc): FILE: coding_interviews/leetcode/easy/points-that-intersect-with-cars/points-that-intersect-with-cars.js function numberOfPoints (line 3) | function numberOfPoints(nums) { FILE: coding_interviews/leetcode/easy/power-of-two/power-of-two.js function isPowerOfTwo (line 1) | function isPowerOfTwo(n) { FILE: coding_interviews/leetcode/easy/prime-number-of-set-bits-in-binary-representation/prime-number-of-set-bits-in-binary-representation.js function toBinary (line 3) | function toBinary(n) { function getNumberOfSetBits (line 14) | function getNumberOfSetBits(binary) { function isPrime (line 24) | function isPrime(num) { function countPrimeSetBits (line 31) | function countPrimeSetBits(left, right) { FILE: coding_interviews/leetcode/easy/projection-area-of-3d-shapes/projection-area-of-3d-shapes.js function projectionArea (line 3) | function projectionArea(grid) { FILE: coding_interviews/leetcode/easy/range_sum_of_bst/range_sum_of_bst.py function rangeSumBST (line 19) | def rangeSumBST(root, L, R): FILE: coding_interviews/leetcode/easy/rank-transform-of-an-array/rank-transform-of-an-array-less-memory.js function buildMap (line 11) | function buildMap(set) { function buildRank (line 23) | function buildRank(arr, map) { function arrayRankTransform (line 31) | function arrayRankTransform(arr) { FILE: coding_interviews/leetcode/easy/rank-transform-of-an-array/rank-transform-of-an-array.js function buildMap (line 11) | function buildMap(set) { function buildRank (line 23) | function buildRank(arr, map) { function arrayRankTransform (line 33) | function arrayRankTransform(arr) { FILE: coding_interviews/leetcode/easy/ransom-note/ransom-note.js function canConstruct (line 1) | function canConstruct(ransomNote, magazine) { FILE: coding_interviews/leetcode/easy/ransom_note/ransom_note.py function can_construct (line 1) | def can_construct(ransom_note, magazine): FILE: coding_interviews/leetcode/easy/reduce_zero/reduce_zero.py function reduce_number (line 4) | def reduce_number(num): function number_of_steps (line 11) | def number_of_steps(num): FILE: coding_interviews/leetcode/easy/reformat-date/reformat-date.js function getDateInfo (line 3) | function getDateInfo(date) { function formatDay (line 37) | function formatDay(day) { function reformatDate (line 41) | function reformatDate(date) { FILE: coding_interviews/leetcode/easy/reformat-phone-number/reformat-phone-number.js function removeSpacesAndDashes (line 1) | function removeSpacesAndDashes(number) { function reformatNumber (line 5) | function reformatNumber(number) { FILE: coding_interviews/leetcode/easy/relative-ranks/relative-ranks.js function sortDesc (line 1) | function sortDesc(list) { function buildHashmap (line 11) | function buildHashmap(list) { function getRelativeRanks (line 21) | function getRelativeRanks(score, hashmap) { function findRelativeRanks (line 31) | function findRelativeRanks(score) { FILE: coding_interviews/leetcode/easy/remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.js function deleteDuplicates (line 1) | function deleteDuplicates(head) { FILE: coding_interviews/leetcode/easy/remove-linked-list-elements/remove-linked-list-elements.js function removeElements (line 1) | function removeElements(head, val) { FILE: coding_interviews/leetcode/easy/remove-outermost-parentheses/remove-outermost-parentheses.js function removeOuterParentheses (line 1) | function removeOuterParentheses(string) { FILE: coding_interviews/leetcode/easy/remove-palindromic-subsequences/remove-palindromic-subsequences.js function isPalindrome (line 1) | function isPalindrome(s) { function removePalindromeSub (line 5) | function removePalindromeSub(s) { FILE: coding_interviews/leetcode/easy/remove-trailing-zeros-from-a-string/remove-trailing-zeros-from-a-string.js function removeTrailingZeros (line 1) | function removeTrailingZeros(num) { FILE: coding_interviews/leetcode/easy/remove_duplicates.py function remove_duplicates (line 11) | def remove_duplicates(nums): FILE: coding_interviews/leetcode/easy/remove_duplicates/remove_duplicates.py function remove_duplicates (line 3) | def remove_duplicates(S): function remove_duplicates (line 22) | def remove_duplicates(S): FILE: coding_interviews/leetcode/easy/remove_duplicates_from_list.py class ListNode (line 3) | class ListNode(object): method __init__ (line 4) | def __init__(self, value): function remove_duplicates (line 8) | def remove_duplicates(head): FILE: coding_interviews/leetcode/easy/remove_element.py function remove_element (line 10) | def remove_element(nums, val): FILE: coding_interviews/leetcode/easy/replace_digits/replace_digits.py function replace_digits (line 3) | def replace_digits(s): function shift (line 14) | def shift(char, digit): FILE: coding_interviews/leetcode/easy/replace_elements/replace_elements.py function replace_elements (line 3) | def replace_elements(arr): FILE: coding_interviews/leetcode/easy/reshape-the-matrix/reshape-the-matrix.js function matrixReshape (line 1) | function matrixReshape(mat, r, c) { FILE: coding_interviews/leetcode/easy/reverse-linked-list/reverse-linked-list.js function reverseList (line 1) | function reverseList(head) { function reverseListSimpler (line 23) | function reverseListSimpler(head) { FILE: coding_interviews/leetcode/easy/reverse-only-letters/reverse-only-letters.js function isEnglishLetter (line 1) | function isEnglishLetter(char) { function reverseOnlyLetters (line 8) | function reverseOnlyLetters(s) { FILE: coding_interviews/leetcode/easy/reverse-prefix-of-word/reverse-prefix-of-word.js function reverse (line 1) | function reverse(charsList) { function reversePrefix (line 11) | function reversePrefix(word, char) { FILE: coding_interviews/leetcode/easy/reverse-string/reverse-string-in-place.js function reverseString (line 1) | function reverseString(s) { FILE: coding_interviews/leetcode/easy/reverse-string/reverse-string.js function reverseString (line 1) | function reverseString(s) { FILE: coding_interviews/leetcode/easy/reverse-vowels-of-a-string/reverse-vowels-of-a-string.js function reverseVowels (line 1) | function reverseVowels(s) { FILE: coding_interviews/leetcode/easy/reverse-words-in-a-string-iii/reverse-words-in-a-string-iii.js function reverseWords (line 1) | function reverseWords(s) { FILE: coding_interviews/leetcode/easy/reverse_integer.py function reverse (line 3) | def reverse(x): FILE: coding_interviews/leetcode/easy/reverse_string.py function reverse_string (line 8) | def reverse_string(s): FILE: coding_interviews/leetcode/easy/reverse_vowels.py function vowel (line 11) | def vowel(char): function reverse_vowels (line 14) | def reverse_vowels(s): FILE: coding_interviews/leetcode/easy/reverse_words_string.py function reverse_words (line 8) | def reverse_words(s): FILE: coding_interviews/leetcode/easy/rings-and-rods/rings-and-rods.js function countPoints (line 19) | function countPoints(rings = '') { FILE: coding_interviews/leetcode/easy/root-equals-sum-of-children/index.js function checkTree (line 1) | function checkTree(root) { FILE: coding_interviews/leetcode/easy/row-with-maximum-ones/row-with-maximum-ones.js function rowAndMaximumOnes (line 3) | function rowAndMaximumOnes(mat) { FILE: coding_interviews/leetcode/easy/running_array_sum/running_array_sum.py function running_sum (line 1) | def running_sum(nums): FILE: coding_interviews/leetcode/easy/same-tree/same-tree.js function isSameTree (line 1) | function isSameTree(p, q) { FILE: coding_interviews/leetcode/easy/same_tree.py function is_same_tree (line 3) | def is_same_tree(p, q): function is_same_tree (line 12) | def is_same_tree(p, q): FILE: coding_interviews/leetcode/easy/search-in-a-binary-search-tree/search-in-a-binary-search-tree.js function searchBST (line 1) | function searchBST(root, val) { FILE: coding_interviews/leetcode/easy/search-insert-position/search-insert-position-new.js function getMiddle (line 1) | function getMiddle(start, end) { function searchInsert (line 5) | function searchInsert(nums, target) { FILE: coding_interviews/leetcode/easy/search_in_a_binary_search_tree/search_in_a_binary_search_tree.py function searchBST (line 3) | def searchBST(root, val): FILE: coding_interviews/leetcode/easy/second-largest-digit-in-a-string/second-largest-digit-in-a-string.js function secondHighest (line 3) | function secondHighest(s) { FILE: coding_interviews/leetcode/easy/self_dividing_numbers.py function self_dividing_numbers (line 8) | def self_dividing_numbers(left, right): function dividing (line 12) | def dividing(number, original): FILE: coding_interviews/leetcode/easy/semi-ordered-permutation/semi-ordered-permutation.js function semiOrderedPermutation (line 3) | function semiOrderedPermutation(nums) { FILE: coding_interviews/leetcode/easy/separate-the-digits-in-an-array/separate-the-digits-in-an-array.js function separateDigits (line 1) | function separateDigits(nums) { FILE: coding_interviews/leetcode/easy/shortest_to_char/shortest_to_char.py function shortest_to_char (line 3) | def shortest_to_char(s, c): function shortest_to_char (line 25) | def shortest_to_char(s, c): FILE: coding_interviews/leetcode/easy/shuffle_string/shuffle_string.py function restore_string (line 5) | def restore_string(s, indices): FILE: coding_interviews/leetcode/easy/shuffle_the_array/shuffle_the_array.py function shuffle (line 1) | def shuffle(nums, n): FILE: coding_interviews/leetcode/easy/sign_of_the_product_of_an_array/sign_of_the_product_of_an_array.py function array_sign (line 3) | def array_sign(nums): FILE: coding_interviews/leetcode/easy/single-number/single-number.js function singleNumber (line 1) | function singleNumber(nums) { FILE: coding_interviews/leetcode/easy/single_number/single_number.py function single_number (line 3) | def single_number(nums): FILE: coding_interviews/leetcode/easy/slowest-key/slowest-key.js function isLexicographicallyLarger (line 1) | function isLexicographicallyLarger(keysPressed, keyPressedIndex, index) { function slowestKey (line 5) | function slowestKey(releaseTimes, keysPressed) { function slowestKey (line 33) | function slowestKey(releaseTimes, keysPressed) { FILE: coding_interviews/leetcode/easy/smallest-even-multiple/smallest-even-multiple.js function smallestEvenMultiple (line 1) | function smallestEvenMultiple(n) { FILE: coding_interviews/leetcode/easy/smallest-index-with-equal-value/smallest-index-with-equal-value.js function smallestEqual (line 1) | function smallestEqual(nums) { FILE: coding_interviews/leetcode/easy/smallest-range-i/optimized-smallest-range-i.js function minMax (line 3) | function minMax(nums) { function smallestRangeI (line 15) | function smallestRangeI(nums, k) { FILE: coding_interviews/leetcode/easy/smallest-range-i/smallest-range-i.js function smallestRangeI (line 3) | function smallestRangeI(nums, k) { FILE: coding_interviews/leetcode/easy/smallest-range-i/smallest-range-iI.js function smallestRangeI (line 3) | function smallestRangeI(nums, k) { FILE: coding_interviews/leetcode/easy/smallest_numbers/smallest_numbers.py function smaller_numbers_than_current (line 17) | def smaller_numbers_than_current(nums): function smaller_numbers_than_current_2 (line 37) | def smaller_numbers_than_current_2(nums): FILE: coding_interviews/leetcode/easy/sort-array-by-increasing-frequency/sort-array-by-increasing-frequency.js function buildCounter (line 1) | function buildCounter(nums) { function toPairs (line 12) | function toPairs(counter) { function byCount (line 22) | function byCount(pair1, pair2) { function buildResult (line 30) | function buildResult(pairs) { function frequencySort (line 42) | function frequencySort(nums) { FILE: coding_interviews/leetcode/easy/sort-array-by-parity-ii/sort-array-by-parity-ii.js function isEven (line 1) | function isEven(num) { function separateIntoEvensAndOdds (line 5) | function separateIntoEvensAndOdds(nums) { function sortArrayByParityII (line 17) | function sortArrayByParityII(nums) { function sortArrayByParityIIInPlace (line 29) | function sortArrayByParityIIInPlace(nums) { FILE: coding_interviews/leetcode/easy/sort-array-by-parity/sort-array-by-parity-two-loops.js function sortArrayByParity (line 3) | function sortArrayByParity(nums) { FILE: coding_interviews/leetcode/easy/sort-array-by-parity/sort-array-by-parity.js function sortArrayByParity (line 3) | function sortArrayByParity(nums) { FILE: coding_interviews/leetcode/easy/sort-even-and-odd-indices-independently/sort-even-and-odd-indices-independently.js function decreasing (line 1) | function decreasing(a, b) { function increasing (line 5) | function increasing(a, b) { function sortEvenOdd (line 9) | function sortEvenOdd(nums) { FILE: coding_interviews/leetcode/easy/sort-integers-by-the-number-of-1-bits/sort-integers-by-the-number-of-1-bits.js function toBinary (line 1) | function toBinary(num) { function byNumberOfOneBits (line 18) | function byNumberOfOneBits(binary1, binary2) { function sortByBits (line 29) | function sortByBits(nums) { FILE: coding_interviews/leetcode/easy/sort-the-people/sort-the-people.js function sortPeople (line 1) | function sortPeople(names, heights) { FILE: coding_interviews/leetcode/easy/sort_array_by_parity/sort_array_by_parity.py function sort_array_by_parity (line 16) | def sort_array_by_parity(A): FILE: coding_interviews/leetcode/easy/sort_sentence/sort_sentence.py function sort_sentence (line 3) | def sort_sentence(s): FILE: coding_interviews/leetcode/easy/special-positions-in-a-binary-matrix/special-positions-in-a-binary-matrix-cache.js function countOnesInRow (line 1) | function countOnesInRow(matrix, row) { function countOnesInCol (line 11) | function countOnesInCol(matrix, col) { function numSpecial (line 21) | function numSpecial(matrix) { FILE: coding_interviews/leetcode/easy/special-positions-in-a-binary-matrix/special-positions-in-a-binary-matrix.js function countOnesInRow (line 1) | function countOnesInRow(matrix, row) { function countOnesInCol (line 11) | function countOnesInCol(matrix, col) { function numSpecial (line 21) | function numSpecial(matrix) { FILE: coding_interviews/leetcode/easy/split-strings-by-separator/split-strings-by-separator.js function splitWordsBySeparator (line 3) | function splitWordsBySeparator(words, separator) { FILE: coding_interviews/leetcode/easy/split-with-minimum-sum/split-with-minimum-sum.js function splitNum (line 1) | function splitNum(num) { FILE: coding_interviews/leetcode/easy/split_string_in_balanced_strings/split_string_in_balanced_strings.py function balanced_string_split (line 4) | def balanced_string_split(s): FILE: coding_interviews/leetcode/easy/squares-of-a-sorted-array/squares-of-a-sorted-array-on.js function buildArray (line 1) | function buildArray(n) { function sortedSquares (line 11) | function sortedSquares(nums) { FILE: coding_interviews/leetcode/easy/squares-of-a-sorted-array/squares-of-a-sorted-array.js function square (line 1) | function square(num) { function byIncreasingOrder (line 5) | function byIncreasingOrder(num1, num2) { function sortedSquares (line 9) | function sortedSquares(nums) { FILE: coding_interviews/leetcode/easy/squares_of_a_sorted_array/squares_of_a_sorted_array.py function squares_of_a_sorted_array (line 17) | def squares_of_a_sorted_array(A): function squares_of_a_sorted_array_in_place (line 26) | def squares_of_a_sorted_array_in_place(A): FILE: coding_interviews/leetcode/easy/str_str/str_str.py function strStr (line 20) | def strStr(haystack, needle): FILE: coding_interviews/leetcode/easy/string-matching-in-an-array/string-matching-in-an-array.js function isSubstring (line 1) | function isSubstring(subword, word) { function addSubstring (line 11) | function addSubstring(word1, word2, answer) { function stringMatching (line 19) | function stringMatching(words) { FILE: coding_interviews/leetcode/easy/subarrays-distinct-element-sum-of-squares-i/subarrays-distinct-element-sum-of-squares-i.js function sumCounts (line 3) | function sumCounts(nums) { FILE: coding_interviews/leetcode/easy/subdomain_visit_count.py function update_subdomain_counter (line 13) | def update_subdomain_counter(sc, s, c): function subdomain_visits (line 19) | def subdomain_visits(cpdomains): FILE: coding_interviews/leetcode/easy/substrings-of-size-three-with-distinct-characters/substrings-of-size-three-with-distinct-characters.js function isGoodString (line 1) | function isGoodString(string) { function countGoodSubstrings (line 6) | function countGoodSubstrings(string) { FILE: coding_interviews/leetcode/easy/subtract_product_and_sum/subtract_product_and_sum.py function subtract_product_and_sum (line 15) | def subtract_product_and_sum(num): FILE: coding_interviews/leetcode/easy/subtree-of-another-tree/subtree-of-another-tree.js function isSame (line 1) | function isSame(root, subRoot) { function isSubtree (line 7) | function isSubtree(root, subRoot) { FILE: coding_interviews/leetcode/easy/sum-multiples/sum-multiples.js function sumOfMultiples (line 1) | function sumOfMultiples(n) { FILE: coding_interviews/leetcode/easy/sum-of-all-subset-xor-totals/sum-of-all-subset-xor-totals.js function getAllSubsets (line 1) | function getAllSubsets(subset, nums, output, index) { function calculateTotalXOR (line 12) | function calculateTotalXOR(nums) { function subsetXORSum (line 22) | function subsetXORSum(nums) { FILE: coding_interviews/leetcode/easy/sum-of-digits-in-base-k/sum-of-digits-in-base-k.js function fromDecimalToK (line 1) | function fromDecimalToK(n, k) { function sumBase (line 12) | function sumBase(n, k) { FILE: coding_interviews/leetcode/easy/sum-of-digits-of-string-after-convert/sum-of-digits-of-string-after-convert.js function toNum (line 1) | function toNum(char) { function getNumbers (line 5) | function getNumbers(s) { function sum (line 15) | function sum(charNums) { function getLucky (line 22) | function getLucky(s, k) { FILE: coding_interviews/leetcode/easy/sum-of-left-leaves/sum-of-left-leaves.js function sumOfLeftLeaves (line 1) | function sumOfLeftLeaves(root, isLeft = false) { FILE: coding_interviews/leetcode/easy/sum-of-squares-of-special-elements/sum-of-squares-of-special-elements.js function sumOfSquares (line 3) | function sumOfSquares(nums) { FILE: coding_interviews/leetcode/easy/sum-of-values-at-indices-with-k-set-bits/sum-of-values-at-indices-with-k-set-bits.js function toBinary (line 1) | function toBinary(num) { function checkSetBits (line 14) | function checkSetBits(binary, k) { function sumIndicesWithKSetBits (line 24) | function sumIndicesWithKSetBits(nums, k) { FILE: coding_interviews/leetcode/easy/sum_leaf_binary_numbers/sum_leaf_binary_numbers.py function sum_root_to_leaf (line 5) | def sum_root_to_leaf(root): function helper (line 10) | def helper(node, path): FILE: coding_interviews/leetcode/easy/sum_of_all_odd_length_subarrays/sum_of_all_odd_length_subarrays.py function sum_odd_length_subarrays (line 8) | def sum_odd_length_subarrays(arr): function sum_odd_length_subarrays_optimized (line 24) | def sum_odd_length_subarrays_optimized(A): FILE: coding_interviews/leetcode/easy/sum_of_unique_elements/sum_of_unique_elements.py function sum_of_unique (line 4) | def sum_of_unique(nums): FILE: coding_interviews/leetcode/easy/sum_zero/sum_zero.py function sum_zero (line 1) | def sum_zero(n): FILE: coding_interviews/leetcode/easy/symmetric-tree/symmetric-tree.js function symmetricNodes (line 1) | function symmetricNodes(node1, node2) { function isSymmetric (line 17) | function isSymmetric(root) { FILE: coding_interviews/leetcode/easy/take-gifts-from-the-richest-pile/take-gifts-from-the-richest-pile.js function pickGifts (line 1) | function pickGifts(gifts, k) { FILE: coding_interviews/leetcode/easy/three-consecutive-odds/three-consecutive-odds.js function threeConsecutiveOdds (line 1) | function threeConsecutiveOdds(nums) { FILE: coding_interviews/leetcode/easy/time-needed-to-buy-tickets/time-needed-to-buy-tickets.js function timeRequiredToBuy (line 1) | function timeRequiredToBuy(tickets, k) { FILE: coding_interviews/leetcode/easy/to_lower_case/to_lower_case.py function lower_case_char (line 21) | def lower_case_char(char): function lower_case (line 28) | def lower_case(str): FILE: coding_interviews/leetcode/easy/toeplitz-matrix/toeplitz-matrix.js function isDiagonalToeplitz (line 1) | function isDiagonalToeplitz(matrix, value, row, col) { function isToeplitzMatrix (line 7) | function isToeplitzMatrix(matrix) { FILE: coding_interviews/leetcode/easy/transpose-matrix/transpose-matrix.js function transpose (line 1) | function transpose(matrix) { FILE: coding_interviews/leetcode/easy/truncate_sentence/truncate_sentence.py function truncate_sentence (line 3) | def truncate_sentence(s, k): function truncate_sentence (line 22) | def truncate_sentence(s, k): function truncate_sentence (line 36) | def truncate_sentence(s, k): FILE: coding_interviews/leetcode/easy/two-furthest-houses-with-different-colors/two-furthest-houses-with-different-colors.js function maxDistance (line 1) | function maxDistance(colors) { FILE: coding_interviews/leetcode/easy/two-out-of-three/two-out-of-three.js function buildHashmap (line 1) | function buildHashmap(nums) { function checkAndAddNumbers (line 11) | function checkAndAddNumbers(result, hashmap1, hashmap2, hashmap3) { function twoOutOfThree (line 19) | function twoOutOfThree(nums1, nums2, nums3) { FILE: coding_interviews/leetcode/easy/two-sum-iv-input-is-a-bst/two-sum-iv-input-is-a-bst.js function dfs (line 1) | function dfs(node, hashmap, values) { function findTarget (line 13) | function findTarget(root, k) { function dfs2 (line 30) | function dfs2(node, target, hashmap) { function findTarget2 (line 44) | function findTarget2(root, k) { FILE: coding_interviews/leetcode/easy/two-sum/two-sum.js function twoSum (line 1) | function twoSum(nums, target) { FILE: coding_interviews/leetcode/easy/two_sum.py function two_sum (line 3) | def two_sum(nums, target): FILE: coding_interviews/leetcode/easy/uncommon-words-from-two-sentences/uncommon-words-from-two-sentences.js function buildCounter (line 1) | function buildCounter(sentence) { function getOnceWords (line 12) | function getOnceWords(counter) { function getUncommonWords (line 22) | function getUncommonWords(onceWords, map) { function uncommonFromSentences (line 26) | function uncommonFromSentences(s1, s2) { FILE: coding_interviews/leetcode/easy/unique-number-of-occurrences/unique-number-of-occurrences.js function uniqueOccurrences (line 1) | function uniqueOccurrences(arr) { FILE: coding_interviews/leetcode/easy/unique_morse_code_words.py function unique_morse_representations (line 8) | def unique_morse_representations(words): FILE: coding_interviews/leetcode/easy/unique_number_of_occurrences/unique_number_of_occurrences.py function unique_occurrences (line 3) | def unique_occurrences(arr): function unique_occurrences_2 (line 16) | def unique_occurrences_2(arr): FILE: coding_interviews/leetcode/easy/univalued-binary-tree/univalued-binary-tree.js function isUnivalTree (line 1) | function isUnivalTree(root) { function isUnivalTree (line 15) | function isUnivalTree(root, value = root.val) { FILE: coding_interviews/leetcode/easy/valid-anagram/valid-anagram.js function isAnagram (line 1) | function isAnagram(s, t) { FILE: coding_interviews/leetcode/easy/valid-palindrome/valid-palindrome-2.js function isPalindrome (line 1) | function isPalindrome(s) { FILE: coding_interviews/leetcode/easy/valid-palindrome/valid-palindrome.js function downcase (line 3) | function downcase(string) { function keepAlphanumeric (line 7) | function keepAlphanumeric(string) { function isValidPalindrome (line 19) | function isValidPalindrome(string) { function isPalindrome (line 35) | function isPalindrome(string) { FILE: coding_interviews/leetcode/easy/valid-palindrome/valid_palindrome.py function is_palindrome (line 17) | def is_palindrome(string): function build_new_string_variation (line 21) | def build_new_string_variation(string, index): function valid_palindrome (line 25) | def valid_palindrome(string): function valid_palindrome_2 (line 53) | def valid_palindrome_2(string): FILE: coding_interviews/leetcode/easy/valid-parentheses/valid-parentheses.js function matches (line 1) | function matches(openBracket, closingBracket) { function isValid (line 11) | function isValid(s) { FILE: coding_interviews/leetcode/easy/water-bottles/water-bottles.js function numWaterBottles (line 1) | function numWaterBottles(numBottles, numExchange) { FILE: coding_interviews/leetcode/easy/weakest_rows/weakest_rows.py function k_weakest_rows (line 3) | def k_weakest_rows(mat, k): FILE: coding_interviews/leetcode/easy/xor-operation-in-an-array/xor-operation-in-an-array.js function xorOperation (line 1) | function xorOperation(n, start) { FILE: coding_interviews/leetcode/medium/3sum/3sum-tle.js function sortTriplet (line 1) | function sortTriplet(num1, num2, num3) { function getSortedTripletString (line 5) | function getSortedTripletString(num1, num2, num3) { function threeSum (line 10) | function threeSum(nums) { FILE: coding_interviews/leetcode/medium/add_two_numbers/add_two_numbers.py class ListNode (line 8) | class ListNode(object): method __init__ (line 9) | def __init__(self, x): function add_two_numbers (line 13) | def add_two_numbers(l1, l2): FILE: coding_interviews/leetcode/medium/all_elements_in_two_binary_search_trees/all_elements_in_two_binary_search_trees.py function get_all_elements (line 4) | def get_all_elements(root1, root2): function get_sorted_list (line 11) | def get_sorted_list(node, values): function get_sorted_elements_from (line 22) | def get_sorted_elements_from(node): function get_all_elements (line 39) | def get_all_elements(root1, root2): function get_sorted_elements_from (line 67) | def get_sorted_elements_from(node, elements): function get_all_elements (line 73) | def get_all_elements(root1, root2): FILE: coding_interviews/leetcode/medium/arithmetic-subarrays/arithmetic-subarrays.py function check_arithmetic_subarrays (line 3) | def check_arithmetic_subarrays(nums, l, r): FILE: coding_interviews/leetcode/medium/balance-a-binary-search-tree/balance-a-binary-search-tree.js function inorder (line 1) | function inorder(root, nodes) { function toBST (line 7) | function toBST(start, end, nodes) { function balanceBST (line 19) | function balanceBST(root) { FILE: coding_interviews/leetcode/medium/binary-tree-inorder-traversal/binary-tree-inorder-traversal.py class Solution (line 3) | class Solution: method __init__ (line 4) | def __init__(self): method inorder_traversal (line 7) | def inorder_traversal(self, root): FILE: coding_interviews/leetcode/medium/binary-tree-level-order-traversal/binary-tree-level-order-traversal.js function levelOrder (line 1) | function levelOrder(root) { FILE: coding_interviews/leetcode/medium/bst_from_pre_order_traversal/bst_from_pre_order_traversal.py class TreeNode (line 1) | class TreeNode: method __init__ (line 2) | def __init__(self, val=0, left=None, right=None): function bst_from_preorder (line 8) | def bst_from_preorder(preorder): function helper (line 17) | def helper(node, value): FILE: coding_interviews/leetcode/medium/bst_to_greatest/bst_to_greatest.py function sum_and_list (line 1) | def sum_and_list(node, total, values): function modify_helper (line 19) | def modify_helper(node, mapper): function bst_to_gst (line 30) | def bst_to_gst(root): function bst_to_gst (line 46) | def bst_to_gst(node): FILE: coding_interviews/leetcode/medium/clone-graph/clone-graph.js function cloneGraph (line 9) | function cloneGraph(node) { FILE: coding_interviews/leetcode/medium/cloned_binary_tree/cloned_binary_tree.py function get_target_copy (line 4) | def get_target_copy(original, cloned, target): FILE: coding_interviews/leetcode/medium/count-nodes-equal-to-average-of-subtree/count-nodes-equal-to-average-of-subtree.js function calculateAverage (line 1) | function calculateAverage(totalValue, nodesCount) { function averageHelper (line 5) | function averageHelper(node, count) { function averageOfSubtree (line 30) | function averageOfSubtree(root) { FILE: coding_interviews/leetcode/medium/count-number-of-distinct-integers-after-reverse-operations/count-number-of-distinct-integers-after-reverse-operations-numbers.js function reverseDigits (line 3) | function reverseDigits(num) { function countDistinctIntegers (line 14) | function countDistinctIntegers(nums) { FILE: coding_interviews/leetcode/medium/count-number-of-distinct-integers-after-reverse-operations/count-number-of-distinct-integers-after-reverse-operations.js function reverseDigits (line 3) | function reverseDigits(num) { function countDistinctIntegers (line 14) | function countDistinctIntegers(nums) { FILE: coding_interviews/leetcode/medium/count-sorted-vowel-strings/count-sorted-vowel-strings.js function countVowelStrings (line 1) | function countVowelStrings(n) { FILE: coding_interviews/leetcode/medium/count-sub-islands/count-sub-islands-tle.js function isInsideTheGrid (line 11) | function isInsideTheGrid(grid, row, col) { function dfs (line 15) | function dfs(grid, row, col) { function countSubIslands (line 35) | function countSubIslands(grid1, grid2) { FILE: coding_interviews/leetcode/medium/count-sub-islands/count-sub-islands.js function dfs (line 1) | function dfs(grid1, grid2, row, col) { function countSubIslands (line 24) | function countSubIslands(grid1, grid2) { FILE: coding_interviews/leetcode/medium/count_points/count_points.py function is_point_within_circuference (line 3) | def is_point_within_circuference(qx, qy, qr, px, py): function count_points (line 6) | def count_points(points, queries): FILE: coding_interviews/leetcode/medium/counter_number_of_teams/counter_number_of_teams.py function num_teams (line 1) | def num_teams(rating): function num_teams (line 14) | def num_teams(rating): FILE: coding_interviews/leetcode/medium/deck_revealed_increasing/deck_revealed_increasing.py function deck_revealed_increasing (line 5) | def deck_revealed_increasing(deck): FILE: coding_interviews/leetcode/medium/decode-string/decode-string.js function decodeString (line 3) | function decodeString(encodedString) { FILE: coding_interviews/leetcode/medium/deepest_leaves_sum/deepest_leaves_sum.py function sum_deepest_leaves (line 11) | def sum_deepest_leaves(root): function helper (line 29) | def helper(node, mapper, level): FILE: coding_interviews/leetcode/medium/delete-node-in-a-linked-list/better-delete-node-in-a-linked-list.js function deleteNode (line 12) | function deleteNode(node) { FILE: coding_interviews/leetcode/medium/delete-node-in-a-linked-list/delete-node-in-a-linked-list.js function deleteNode (line 12) | function deleteNode(node) { FILE: coding_interviews/leetcode/medium/design-add-and-search-words-data-structure/design-add-and-search-words-data-structure.js function isTheSame (line 1) | function isTheSame(word, wordFromDict) { FILE: coding_interviews/leetcode/medium/difference-between-ones-and-zeros-in-row-and-column/difference-between-ones-and-zeros-in-row-and-column.js function traverseGridRow (line 1) | function traverseGridRow(grid, row) { function traverseGridCol (line 17) | function traverseGridCol(grid, col) { function onesMinusZeros (line 33) | function onesMinusZeros(grid) { FILE: coding_interviews/leetcode/medium/encode_and_decode_tinyurl/encode_and_decode_tinyurl.py class Codec (line 3) | class Codec: method encode (line 9) | def encode(self, longUrl: str) -> str: method decode (line 19) | def decode(self, shortUrl: str) -> str: FILE: coding_interviews/leetcode/medium/execution-of-all-suffix-instructions-staying-in-a-grid/execution-of-all-suffix-instructions-staying-in-a-grid.js function isOffGrid (line 3) | function isOffGrid(row, col, n) { function executeInstructions (line 7) | function executeInstructions(n, startPos, s) { FILE: coding_interviews/leetcode/medium/find-the-original-array-of-prefix-xor/find-the-original-array-of-prefix-xor.js function findArray (line 1) | function findArray(pref) { FILE: coding_interviews/leetcode/medium/find-the-winner-of-the-circular-game/find-the-winner-of-the-circular-game.js function toArray (line 3) | function toArray(n) { function findTheWinner (line 13) | function findTheWinner(n, k) { FILE: coding_interviews/leetcode/medium/find-the-winner-of-the-circular-game/queue-find-the-winner-of-the-circular-game.js function buildQueue (line 3) | function buildQueue(n) { function findTheWinner (line 13) | function findTheWinner(n, k) { FILE: coding_interviews/leetcode/medium/find-triangular-sum-of-an-array/find-triangular-sum-of-an-array.js function calculate (line 1) | function calculate(num1, num2) { function triangularSum (line 5) | function triangularSum(nums) { FILE: coding_interviews/leetcode/medium/find-valid-matrix-given-row-and-column-sums/find-valid-matrix-given-row-and-column-sums.js function buildMatrix (line 1) | function buildMatrix(rows, cols) { function restoreMatrix (line 17) | function restoreMatrix(rowSum, colSum) { FILE: coding_interviews/leetcode/medium/find_and_replace_pattern/find_and_replace_pattern.py function find_and_replace_pattern (line 3) | def find_and_replace_pattern(words, pattern): FILE: coding_interviews/leetcode/medium/finding_pairs_with_a_certain_sum/finding_pairs_with_a_certain_sum.py class FindSumPairs (line 3) | class FindSumPairs: method __init__ (line 4) | def __init__(self, nums1, nums2): method add (line 9) | def add(self, index, val): method count (line 14) | def count(self, total): FILE: coding_interviews/leetcode/medium/finding_the_users_active_minutes/finding_the_users_active_minutes.py function build_unique_actions_by_id (line 3) | def build_unique_actions_by_id(logs): function build_count_by_actions_number (line 14) | def build_count_by_actions_number(unique_actions_by_id): function build_answer (line 25) | def build_answer(count_by_actions_number, k): function finding_users_active_minutes (line 36) | def finding_users_active_minutes(logs, k): function finding_users_active_minutes (line 43) | def finding_users_active_minutes(logs, k): FILE: coding_interviews/leetcode/medium/fraction_to_decimal/fraction_to_decimal.py function fraction_to_decimal (line 1) | def fraction_to_decimal(numerator, denominator): FILE: coding_interviews/leetcode/medium/group-anagrams/group-anagrams.js function sort (line 1) | function sort(string) { function groupAnagrams (line 5) | function groupAnagrams(strs) { FILE: coding_interviews/leetcode/medium/group_the_people/group_the_people.py function group_the_people (line 4) | def group_the_people(groupSizes): FILE: coding_interviews/leetcode/medium/insert-greatest-common-divisors-in-linked-list/insert-greatest-common-divisors-in-linked-list.js function calculateGCD (line 11) | function calculateGCD(x, y) { function insertGreatestCommonDivisors (line 22) | function insertGreatestCommonDivisors(head) { FILE: coding_interviews/leetcode/medium/insert-into-a-binary-search-tree/insert-into-a-binary-search-tree.js function insertIntoBST (line 1) | function insertIntoBST(root, val) { FILE: coding_interviews/leetcode/medium/insert_bst/insert_bst.py class TreeNode (line 1) | class TreeNode: method __init__ (line 2) | def __init__(self, val=0, left=None, right=None): function insert_into_BST (line 8) | def insert_into_BST(root, val): FILE: coding_interviews/leetcode/medium/keep_city_skyline/keep_city_skyline.py function build_top_or_bottom (line 6) | def build_top_or_bottom(grid): function build_left_or_right (line 20) | def build_left_or_right(grid): function max_increase_keeping_skyline (line 34) | def max_increase_keeping_skyline(grid): FILE: coding_interviews/leetcode/medium/kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst-1.js function traverse (line 1) | function traverse(node, list) { function kthSmallest (line 12) | function kthSmallest(root, k) { FILE: coding_interviews/leetcode/medium/kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst-2.js function traverseAndGetKthSmallest (line 4) | function traverseAndGetKthSmallest(node, k) { function kthSmallest (line 17) | function kthSmallest(root, k) { FILE: coding_interviews/leetcode/medium/kth-smallest-element-in-a-bst/kth-smallest-element-in-a-bst.js function traverse (line 4) | function traverse(node, list) { function kthSmallest (line 15) | function kthSmallest(root, k) { function traverseAndGetKthSmallest (line 26) | function traverseAndGetKthSmallest(node, k) { function kthSmallest (line 39) | function kthSmallest(root, k) { FILE: coding_interviews/leetcode/medium/letter_tile_possibilities/letter_tile_possibilities.py function num_tile_possibilities (line 3) | def num_tile_possibilities(tiles): FILE: coding_interviews/leetcode/medium/longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.js function lengthOfLongestSubstring (line 13) | function lengthOfLongestSubstring(s) { FILE: coding_interviews/leetcode/medium/max-area-of-island/max-area-of-island.js function isOffTheGrid (line 1) | function isOffTheGrid(grid, row, col) { function dfs (line 7) | function dfs(grid, row, col, maximumLocalIslandArea = 0) { function maxAreaOfIsland (line 23) | function maxAreaOfIsland(grid) { FILE: coding_interviews/leetcode/medium/max_coins/max_coins.py function max_coins (line 4) | def max_coins(piles): FILE: coding_interviews/leetcode/medium/maximum-sum-of-an-hourglass/maximum-sum-of-an-hourglass.js function maxRowSum (line 3) | function maxRowSum(grid, row, col) { function maxSum (line 15) | function maxSum(grid) { FILE: coding_interviews/leetcode/medium/maximum_binary_tree/maximum_binary_tree.py class TreeNode (line 16) | class TreeNode(object): method __init__ (line 17) | def __init__(self, x): function construct_maximum_binary_tree (line 22) | def construct_maximum_binary_tree(nums): FILE: coding_interviews/leetcode/medium/median_tree/median_tree.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self, value, left, right): function sum_and_count_nodes (line 8) | def sum_and_count_nodes(node, sum_of_values, count): function median (line 17) | def median(tree): FILE: coding_interviews/leetcode/medium/merge-nodes-in-between-zeros/merge-nodes-in-between-zeros.js class ListNode (line 1) | class ListNode { method constructor (line 2) | constructor(val, next) { function mergeNodes (line 8) | function mergeNodes(head) { FILE: coding_interviews/leetcode/medium/merge-nodes-in-between-zeros/tests/merge-nodes-in-between-zeros.test.js function buildList (line 4) | function buildList(nums, initValue = 0) { FILE: coding_interviews/leetcode/medium/min-cost-climbing-stairs/min-cost-climbing-stairs.js function getMinCost (line 4) | function getMinCost(stairs, index, dp) { function minCostClimbingStairs (line 19) | function minCostClimbingStairs(cost) { FILE: coding_interviews/leetcode/medium/min_operations/min_operations.py function min_operations (line 1) | def min_operations(n): FILE: coding_interviews/leetcode/medium/min_pair_sum/min_pair_sum.py function min_pair_sum (line 3) | def min_pair_sum(nums): FILE: coding_interviews/leetcode/medium/min_partitions/min_partitions.py function min_partitions (line 3) | def min_partitions(n): function min_partitions (line 12) | def min_partitions(n): FILE: coding_interviews/leetcode/medium/minimum-add-to-make-parentheses-valid/minimum-add-to-make-parentheses-valid.js function minAddToMakeValid (line 13) | function minAddToMakeValid(s) { FILE: coding_interviews/leetcode/medium/minimum-amount-of-time-to-collect-garbage/minimum-amount-of-time-to-collect-garbage.js function measure (line 1) | function measure(garbage, travel, garbageType) { function garbageCollection (line 25) | function garbageCollection(garbage, travel) { FILE: coding_interviews/leetcode/medium/minimum-cost-of-buying-candies-with-discount/minimum-cost-of-buying-candies-with-discount.js function sum (line 3) | function sum(cost) { function minimumCost (line 13) | function minimumCost(cost) { FILE: coding_interviews/leetcode/medium/minimum-number-of-steps-to-make-two-strings-anagram/minimum-number-of-steps-to-make-two-strings-anagram.js function buildMap (line 1) | function buildMap(string) { function minSteps (line 12) | function minSteps(s, t) { FILE: coding_interviews/leetcode/medium/minimum_number_of_operations_to_move_all_balls_to_each_box/minimum_number_of_operations_to_move_all_balls_to_each_box.py function min_operations (line 3) | def min_operations(boxes): function sum_moves (line 16) | def sum_moves(answer, boxes, boxes_indices): function min_operations (line 29) | def min_operations(boxes): FILE: coding_interviews/leetcode/medium/number-of-closed-islands/number-of-closed-islands.js function generateVisitedKey (line 10) | function generateVisitedKey(row, col) { function isInsideTheGrid (line 14) | function isInsideTheGrid(grid, row, col) { function dfs (line 18) | function dfs(grid, row, col, visited) { function closedIsland (line 41) | function closedIsland(grid) { FILE: coding_interviews/leetcode/medium/number-of-enclaves/number-of-enclaves.js function getVisitedKey (line 6) | function getVisitedKey(row, col) { function isOffTheGrid (line 10) | function isOffTheGrid(grid, row, col) { function dfs (line 14) | function dfs(grid, row, col, visited) { function numEnclaves (line 41) | function numEnclaves(grid) { FILE: coding_interviews/leetcode/medium/number-of-islands/number-of-islands.js function isInsideTheGrid (line 1) | function isInsideTheGrid(grid, row, col) { function dfs (line 5) | function dfs(grid, row, col) { function numIslands (line 15) | function numIslands(grid) { FILE: coding_interviews/leetcode/medium/number-of-laser-beams-in-a-bank/number-of-laser-beams-in-a-bank.js function numberOfBeams (line 13) | function numberOfBeams(bank) { FILE: coding_interviews/leetcode/medium/optimal-partition-of-string/optimal-partition-of-string.js function partitionString (line 3) | function partitionString(s) { FILE: coding_interviews/leetcode/medium/optimal-partition-of-string/optimized-optimal-partition-of-string.js function partitionString (line 3) | function partitionString(s) { FILE: coding_interviews/leetcode/medium/pair-sum/pair-sum.js function pairSum (line 19) | function pairSum(list) { function pairSumLinkedList (line 29) | function pairSumLinkedList(head) { FILE: coding_interviews/leetcode/medium/partition-array-according-to-given-pivot/partition-array-according-to-given-pivot.js function pivotArray (line 12) | function pivotArray(nums, pivot) { FILE: coding_interviews/leetcode/medium/permutation-in-string/permutation-in-string-sliding-window.js function buildCharCount (line 1) | function buildCharCount(string) { function isPermutation (line 15) | function isPermutation(possiblePermutation, string) { function checkInclusion (line 29) | function checkInclusion(s1, s2) { FILE: coding_interviews/leetcode/medium/permutation-in-string/permutation-in-string.js function buildCharCount (line 1) | function buildCharCount(string) { function isPermutation (line 15) | function isPermutation(possiblePermutation, string) { function checkInclusion (line 29) | function checkInclusion(s1, s2) { FILE: coding_interviews/leetcode/medium/populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node-simpler.js function dfs (line 1) | function dfs(node, next) { function connect (line 10) | function connect(root) { FILE: coding_interviews/leetcode/medium/populating-next-right-pointers-in-each-node/populating-next-right-pointers-in-each-node.js function connectHelperRight (line 1) | function connectHelperRight(node) { function connectHelper (line 10) | function connectHelper(node, next) { function connect (line 21) | function connect(root) { FILE: coding_interviews/leetcode/medium/process_queries/process_queries.py function process_queries (line 1) | def process_queries(queries, m): FILE: coding_interviews/leetcode/medium/product-of-array-except-self/product-of-array-except-self.js function productExceptSelf (line 1) | function productExceptSelf(nums) { FILE: coding_interviews/leetcode/medium/rearrange-array-elements-by-sign/rearrange-array-elements-by-sign.js function isPositive (line 27) | function isPositive(num) { function rearrangeArray (line 31) | function rearrangeArray(nums) { FILE: coding_interviews/leetcode/medium/reduce_array_size_to_the_half/reduce_array_size_to_the_half.py function min_set_size (line 8) | def min_set_size(arr): FILE: coding_interviews/leetcode/medium/remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list-fast-slow.js function removeNthFromEnd (line 1) | function removeNthFromEnd(head, n) { FILE: coding_interviews/leetcode/medium/remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.js function countNodes (line 8) | function countNodes(head) { function removeNthFromEnd (line 19) | function removeNthFromEnd(head, n) { FILE: coding_interviews/leetcode/medium/rotate-array/rotate-array-optimized.js function reverseInPlace (line 1) | function reverseInPlace(nums, start, end) { function rotate (line 11) | function rotate(nums, k) { FILE: coding_interviews/leetcode/medium/rotate-array/rotate-array.js function rotate (line 1) | function rotate(nums, k) { FILE: coding_interviews/leetcode/medium/rotate-image/rotate-image.js function setupMatrix (line 1) | function setupMatrix(matrix) { function rotateBorder (line 17) | function rotateBorder(newMatrix, matrix, minRow, minCol, maxRow, maxCol) { function rotate (line 68) | function rotate(matrix) { FILE: coding_interviews/leetcode/medium/search-a-2d-matrix-ii/search-a-2d-matrix-ii.py function search_matrix (line 8) | def search_matrix(matrix, target): function target_in_row (line 15) | def target_in_row(array, target): FILE: coding_interviews/leetcode/medium/search-a-2d-matrix/search-a-2d-matrix.js function getMiddle (line 1) | function getMiddle(start, end) { function binarySearch (line 5) | function binarySearch(list, target) { function searchMatrix (line 25) | function searchMatrix(matrix, target) { FILE: coding_interviews/leetcode/medium/search-a-2d-matrix/search-a-2d-matrix.py function search_matrix (line 8) | def search_matrix(matrix, target): FILE: coding_interviews/leetcode/medium/set-matrix-zeroes/set-matrix-zeroes.js function updateRow (line 1) | function updateRow(matrix, row, visited) { function updateCol (line 10) | function updateCol(matrix, col, visited) { function setZeroes (line 19) | function setZeroes(matrix) { FILE: coding_interviews/leetcode/medium/sort-the-students-by-their-kth-score/sort-the-students-by-their-kth-score.js function sortTheStudents (line 1) | function sortTheStudents(score, k) { FILE: coding_interviews/leetcode/medium/sort_the_matrix_diagonally/sort_the_matrix_diagonally.py function diagonal_sort (line 1) | def diagonal_sort(mat): FILE: coding_interviews/leetcode/medium/string-compression/string-compression-copy.js function compress (line 3) | function compress(chars) { FILE: coding_interviews/leetcode/medium/string-compression/string-compression.js function compress (line 3) | function compress(chars) { FILE: coding_interviews/leetcode/medium/subrectangle_queries/subrectangle_queries.py class SubrectangleQueries (line 4) | class SubrectangleQueries: method __init__ (line 5) | def __init__(self, rectangle): method updateSubrectangle (line 8) | def updateSubrectangle(self, row1, col1, row2, col2, newValue): method getValue (line 13) | def getValue(self, row, col): FILE: coding_interviews/leetcode/medium/sum_of_nodes/sum_of_nodes.py function sum_even_grandparent (line 11) | def sum_even_grandparent(node): function sum_even_grandparent_2 (line 36) | def sum_even_grandparent_2(node): function helper (line 40) | def helper(node, parent, grandparent): FILE: coding_interviews/leetcode/medium/two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted-2.js function twoSum (line 1) | function twoSum(numbers, target) { FILE: coding_interviews/leetcode/medium/two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.js function twoSum (line 1) | function twoSum(numbers, target) { FILE: coding_interviews/leetcode/medium/valid-sudoku/valid-sudoku.js function isValidRow (line 1) | function isValidRow(board, row) { function isValidCol (line 17) | function isValidCol(board, col) { function isValidSquare (line 33) | function isValidSquare(board, row, col) { function isValidSudoku (line 51) | function isValidSudoku(board) { FILE: coding_interviews/leetcode/medium/validate-binary-search-tree/validate-binary-search-tree-2.js function isValidBST (line 1) | function isValidBST(node, min = -Infinity, max = Infinity) { FILE: coding_interviews/leetcode/medium/validate-binary-search-tree/validate-binary-search-tree-almost-right.js function isValidLeft (line 1) | function isValidLeft(node, left) { function isValidRight (line 5) | function isValidRight(node, right) { function isValid (line 9) | function isValid(node, left, right) { function compareNodeAndChildren (line 13) | function compareNodeAndChildren(node, left, right) { function isValidBST (line 39) | function isValidBST(root) { FILE: coding_interviews/leetcode/medium/validate-binary-search-tree/validate-binary-search-tree.js function toList (line 1) | function toList(node, treeList) { function dfs (line 12) | function dfs(node, value) { function buildTree (line 26) | function buildTree(treeList) { function compareTrees (line 36) | function compareTrees(node1, node2) { function isValidBST (line 52) | function isValidBST(root) { FILE: coding_interviews/leetcode/medium/watering-plants/watering-plants.js function wateringPlants (line 30) | function wateringPlants(plants, capacity) { FILE: coding_interviews/top-problems/are-anagrams.js function hasDifferentLengths (line 5) | function hasDifferentLengths(string1, string2) { function buildCharsCount (line 9) | function buildCharsCount(string) { function areAnagrams (line 23) | function areAnagrams(string1, string2) { FILE: coding_interviews/top-problems/first-and-last-index.js function firstAndLastIndex (line 10) | function firstAndLastIndex(list, target) { function getMiddle (line 34) | function getMiddle(start, end) { function findIndex (line 38) | function findIndex(list, target, type) { function findFirstIndex (line 73) | function findFirstIndex(list, target) { function findLastIndex (line 77) | function findLastIndex(list, target) { function firstAndLastIndexBinarySearch (line 81) | function firstAndLastIndexBinarySearch(list, target) { FILE: coding_interviews/top-problems/kth-largest.js function kthLargest (line 5) | function kthLargest(list, k) { FILE: coding_interviews/top-problems/min-sliding-window.js function buildCharsCounter (line 1) | function buildCharsCounter(s) { function compare (line 15) | function compare(s1, s2) { function minSlidingWindow (line 28) | function minSlidingWindow(s, t) { FILE: college/graph/atoms.py function plot_graph (line 4) | def plot_graph(graph, pos, title): FILE: competitive-programming/acm-icpc-br/regionals_2011/armstrong.cpp function main (line 9) | int main() FILE: competitive-programming/acm-icpc-br/regionals_2011/calculadora.cpp function main (line 6) | int main() FILE: competitive-programming/acm-icpc-br/regionals_2011/cartoes.cpp function is_alberto_turn (line 6) | int is_alberto_turn(int counter) { function main (line 13) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2011/concurso.cpp function main (line 7) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2011/coral.cpp function is_integer (line 9) | bool is_integer(float k) { function all_equal (line 13) | bool all_equal(vector &vetorzin) { function main (line 19) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2011/elevador.cpp function has_four (line 9) | bool has_four(string number) { function has_thirteen (line 17) | bool has_thirteen(string number) { function main (line 25) | int main () { FILE: competitive-programming/acm-icpc-br/regionals_2011/estacionamento.cpp function main (line 6) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2011/extenso.cpp function split (line 13) | void split(string &n1, string &n2, string number) { function string (line 19) | string transformNumberToCents(string cents) { function string (line 46) | string transformNumberToReal(string reais) { function main (line 113) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2011/goldbach.cpp function verifica_primo (line 7) | int verifica_primo(int n) { function main (line 29) | int main() FILE: competitive-programming/acm-icpc-br/regionals_2011/matriz_esparsa.cpp function main (line 5) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2011/pascal.cpp function triangulo_pascal (line 5) | int triangulo_pascal(int n, int m) { function main (line 13) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2011/polinomio.cpp function solvePartEquation (line 9) | int solvePartEquation(string part_equation, int value) { function main (line 21) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2011/quadrado.cpp function main (line 7) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2011/vagas.cpp function main (line 5) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2017_1/A.cpp function build_segtree (line 10) | void build_segtree(int A[], int node, int start, int end) { function propagate (line 20) | void propagate(int p, int start, int end) { function lazy_update (line 33) | void lazy_update(int p, int start, int end, int left, int right, int inc) { function lazy_query (line 55) | int lazy_query(int p, int start, int end, int left, int right) { function print_all_leaves (line 67) | void print_all_leaves(int p, int start, int end) { function main (line 77) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2017_2/D.cpp function is_prime (line 5) | bool is_prime(int N) { function main (line 9) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2017_2/F.cpp function main (line 7) | int main() { FILE: competitive-programming/acm-icpc-br/regionals_2017_2/M.cpp function main (line 5) | int main() { FILE: competitive-programming/codeforces/div2/black_square.cpp function main (line 9) | int main() { FILE: competitive-programming/codeforces/div2/karen_and_morning.cpp function to_digit (line 8) | int to_digit(char c) { function main (line 12) | int main() { FILE: competitive-programming/codeforces/div2/keyboard_layouts.cpp function is_uppercase (line 8) | bool is_uppercase(char word) { function build_new_word (line 13) | char build_new_word(char letter, string alpha1, string alpha2) { function main (line 28) | int main() { FILE: competitive-programming/codeforces/div2/the_child_and_the_homework.cpp function string (line 7) | string solve(string a, string b, string c, string d) { function main (line 26) | int main() { FILE: competitive-programming/codeforces/div2/the_child_and_toy.cpp function min (line 7) | int min(int x, int y, int values[]) { function main (line 11) | int main() { FILE: competitive-programming/codeforces/div2/valera_and_plates.cpp function main (line 7) | int main() { FILE: competitive-programming/exercism/javascript/allergies.js class Allergies (line 1) | class Allergies { method constructor (line 2) | constructor(score) { method list (line 17) | list() { method findMaxSmallerThanScore (line 23) | findMaxSmallerThanScore(score) { method allergicTo (line 35) | allergicTo(food) { FILE: competitive-programming/exercism/javascript/count-words.js constant SPECIAL_CHARACTERS (line 1) | const SPECIAL_CHARACTERS = /[!@#\$%\^\&*\".,;:?<>~`(\){}[\]\\/\+=_-]/g; constant SPACE_CHARACTERS (line 2) | const SPACE_CHARACTERS = /\s+/g; function isEmptySpace (line 4) | function isEmptySpace(string) { function removeOpenQuote (line 8) | function removeOpenQuote(word) { function removeCloseQuote (line 12) | function removeCloseQuote(word) { function removeQuotes (line 16) | function removeQuotes(word) { FILE: competitive-programming/exercism/javascript/resistor-color.js constant COLORS (line 3) | const COLORS = [ FILE: competitive-programming/exercism/javascript/resistor-colors.js constant COLORS (line 3) | const COLORS = [ FILE: competitive-programming/exercism/javascript/sublist.js constant COMPARISON (line 1) | const COMPARISON = { class List (line 8) | class List { method constructor (line 9) | constructor(numbers = []) { method compare (line 13) | compare(otherList) { method isIdentical (line 35) | isIdentical(numbers, otherList) { method isSublist (line 45) | isSublist(otherNumbers) { method isSuperList (line 60) | isSuperList(numbers, otherNumbers) { FILE: competitive-programming/exercism/javascript/triangle.js function Triangle (line 1) | function Triangle(side1, side2, side3) { FILE: competitive-programming/hacker-rank/algorithms/strings/palindrome_index.py function is_palindrome (line 5) | def is_palindrome(s): function palindrome_index (line 8) | def palindrome_index(s): FILE: competitive-programming/hacker-rank/algorithms/warmup/birthday_cake_candles.py function birthday_cake_candles (line 3) | def birthday_cake_candles(n, ar): FILE: competitive-programming/hacker-rank/algorithms/warmup/mini_max_sum.py function mini_max_sum (line 1) | def mini_max_sum(arr): FILE: competitive-programming/hacker-rank/cpp/introduction/angry_professor.cpp function main (line 5) | int main() { FILE: competitive-programming/hacker-rank/cpp/introduction/arrays_introduction.cpp function main (line 8) | int main() { FILE: competitive-programming/hacker-rank/cpp/introduction/diagonal_difference.cpp function main (line 6) | int main() { FILE: competitive-programming/hacker-rank/cpp/introduction/input_and_output.cpp function main (line 10) | int main() { FILE: competitive-programming/hacker-rank/cpp/introduction/library_fine.cpp function main (line 5) | int main() { FILE: competitive-programming/hacker-rank/cpp/introduction/plus_minus.cpp function main (line 5) | int main() { FILE: competitive-programming/hacker-rank/cpp/introduction/staircase.cpp function main (line 6) | int main() { FILE: competitive-programming/hacker-rank/cpp/introduction/time_conversion.cpp function main (line 6) | int main() { FILE: competitive-programming/hacker-rank/cpp/introduction/vector_erase.cpp function main (line 6) | int main() { FILE: competitive-programming/hacker-rank/cpp/introduction/vector_sort.cpp function main (line 7) | int main() { FILE: competitive-programming/hacker-rank/data_structures/trees/in_order_traversal.py function in_order (line 1) | def in_order(node): FILE: competitive-programming/hacker-rank/data_structures/trees/post_order_traversal.py function post_order (line 1) | def post_order(node): FILE: competitive-programming/hacker-rank/data_structures/trees/pre_order_traversal.py function pre_order (line 1) | def pre_order(node): FILE: competitive-programming/hacker-rank/python/sets/intro_to_sets.py function average (line 3) | def average(array): FILE: competitive-programming/hacker-rank/python/strings/find_a_string.py function count_substring (line 15) | def count_substring(string, sub_string): FILE: competitive-programming/hacker-rank/python/strings/mutate_string.py function mutate_string (line 7) | def mutate_string(string, position, character): FILE: competitive-programming/hacker-rank/python/strings/split_and_join.py function split_and_join (line 7) | def split_and_join(line): FILE: competitive-programming/hacker-rank/python/strings/swap_case.py function swap_case (line 6) | def swap_case(s): FILE: competitive-programming/hacker-rank/python/strings/text_wrap.py function wrap (line 5) | def wrap(string, max_width): FILE: competitive-programming/hacker-rank/python/strings/whats_your_name.py function print_full_name (line 7) | def print_full_name(a, b): FILE: competitive-programming/interfatecs/1_2016/a.cpp function main (line 7) | int main() { FILE: competitive-programming/interfatecs/1_2016/b.cpp function main (line 7) | int main() { FILE: competitive-programming/interfatecs/1_2016/g.cpp function main (line 9) | int main() { FILE: competitive-programming/interfatecs/1_2016/i.cpp function main (line 6) | int main() { FILE: competitive-programming/interfatecs/1_2018/a.cpp type debugger (line 26) | struct debugger method debugger (line 28) | debugger& operator , (const T& v) function maior (line 38) | bool maior(const pair &a, const pair &b) { function main (line 47) | int main(void) { FILE: competitive-programming/interfatecs/1_2018/b.cpp type debugger (line 22) | struct debugger method debugger (line 24) | debugger& operator , (const T& v) function main (line 34) | int main(void) { FILE: competitive-programming/interfatecs/1_2018/c.cpp type debugger (line 22) | struct debugger method debugger (line 24) | debugger& operator , (const T& v) function main (line 34) | int main(void) { FILE: competitive-programming/interfatecs/1_2018/d.py function direction (line 20) | def direction(letter): function letra_correta (line 30) | def letra_correta(i, j, pc): function procura (line 34) | def procura(visitados, i, j, palavra, sequencia): FILE: competitive-programming/interfatecs/1_2018/g.cpp type debugger (line 22) | struct debugger method debugger (line 24) | debugger& operator , (const T& v) function main (line 34) | int main(void) { FILE: competitive-programming/interfatecs/1_2018/h.cpp type debugger (line 23) | struct debugger method debugger (line 25) | debugger& operator , (const T& v) function main (line 40) | int main(void) { FILE: competitive-programming/interfatecs/1_2018/i.py function data (line 9) | def data(data_string): function analisar_boleto (line 16) | def analisar_boleto(boleto): FILE: competitive-programming/interfatecs/1_2018/j.cpp type debugger (line 25) | struct debugger method debugger (line 27) | debugger& operator , (const T& v) function preenche (line 42) | void preenche(int y, int x) { function main (line 55) | int main(void) { FILE: competitive-programming/spoj-br/aero.cpp function main (line 8) | int main() { FILE: competitive-programming/spoj-br/bafo.cpp function main (line 7) | int main() { FILE: competitive-programming/spoj-br/bapostas.cpp function main (line 5) | int main() { FILE: competitive-programming/spoj-br/bit.cpp function main (line 9) | int main() { FILE: competitive-programming/spoj-br/calcula.cpp function main (line 5) | int main() { FILE: competitive-programming/spoj-br/calculadora.cpp function main (line 7) | int main() { FILE: competitive-programming/spoj-br/dentista.cpp function main (line 7) | int main() { FILE: competitive-programming/spoj-br/desculpa.cpp function max (line 6) | int max(int a, int b) { function knapsack (line 10) | int knapsack(int W, int wt[], int val[], int n) { function main (line 25) | int main() { FILE: competitive-programming/spoj-br/eleicoes1.cpp function main (line 8) | int main() { FILE: competitive-programming/spoj-br/eleicoes2.cpp function main (line 7) | int main() { FILE: competitive-programming/spoj-br/estagio.cpp function main (line 9) | int main() { FILE: competitive-programming/spoj-br/fatorial.cpp function custom_factorial (line 7) | int custom_factorial(int n) { function main (line 34) | int main() { FILE: competitive-programming/spoj-br/feyman.cpp function quad (line 6) | int quad(int n) { function main (line 14) | int main() { FILE: competitive-programming/spoj-br/fliperam.cpp function main (line 7) | int main() { FILE: competitive-programming/spoj-br/gangorra.cpp function main (line 6) | int main() { FILE: competitive-programming/spoj-br/guardacosta.cpp function main (line 7) | int main() { FILE: competitive-programming/spoj-br/impedido.cpp function main (line 6) | int main() { FILE: competitive-programming/spoj-br/letra.cpp function main (line 12) | int main() { FILE: competitive-programming/spoj-br/loopmusi.cpp function main (line 6) | int main() { FILE: competitive-programming/spoj-br/lua.cpp function main (line 9) | int main() { FILE: competitive-programming/spoj-br/macaco.cpp function main (line 7) | int main() { FILE: competitive-programming/spoj-br/minhoca.cpp function main (line 9) | int main() { FILE: competitive-programming/spoj-br/miojo.cpp function main (line 9) | int main() { FILE: competitive-programming/spoj-br/obi.cpp function main (line 6) | int main() { FILE: competitive-programming/spoj-br/obihanoi.cpp function main (line 10) | int main() { FILE: competitive-programming/spoj-br/parprox.cpp function main (line 11) | int main() { FILE: competitive-programming/spoj-br/peca.cpp function main (line 10) | int main() { FILE: competitive-programming/spoj-br/primo.cpp function is_prime (line 8) | long long int is_prime(int num) { function main (line 26) | int main() { FILE: competitive-programming/spoj-br/rumo9s.cpp function main (line 5) | int main() { FILE: competitive-programming/spoj-br/saldo.cpp function main (line 6) | int main() { FILE: competitive-programming/spoj-br/saldo13.cpp function main (line 6) | int main() { FILE: competitive-programming/spoj-br/sorvete.cpp function main (line 7) | int main() { FILE: competitive-programming/spoj-br/sudoku.cpp function string (line 9) | string correct_sudoku(vector< vector > matrix) { function main (line 34) | int main() { FILE: competitive-programming/spoj-br/telefone.cpp function main (line 7) | int main() { FILE: competitive-programming/spoj-br/transporte.cpp function main (line 6) | int main() { FILE: competitive-programming/spoj-br/troco13.cpp function main (line 9) | int main() { FILE: competitive-programming/spoj-br/vivo.cpp function main (line 6) | int main() { FILE: competitive-programming/spoj-br/wcw.cpp function merge (line 6) | vector merge(vector& vec, const vector& left, const vecto... function merge_sort (line 35) | vector merge_sort(vector& vec) { function main (line 51) | int main() { FILE: competitive-programming/timus/a+b_problem.cpp function main (line 7) | int main() { FILE: competitive-programming/ucoder/armstrong_numbers.cpp function main (line 9) | int main() FILE: competitive-programming/ucoder/historico_de_comandos.cpp function main (line 6) | int main() { FILE: competitive-programming/ucoder/imperador_cassius.cpp function main (line 4) | int main() { FILE: competitive-programming/ucoder/matriz_esparsa.cpp function main (line 5) | int main() { FILE: competitive-programming/ucoder/obi.cpp function main (line 4) | int main() { FILE: competitive-programming/ucoder/tsetse.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/3d_virtual_museum.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/a_long_time_ago.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/above_average.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/above_secundary_diagonal.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/above_the_main_diagonal.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/abracadabra.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/advancing_letters.cpp function main (line 4) | int main() { FILE: competitive-programming/uri/age_in_day.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/ages.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/alarm_clock.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/alliteration.cpp function split_by_space (line 9) | void split_by_space(vector &words, string phrase) { function main (line 26) | int main() { FILE: competitive-programming/uri/andys_first_dictionary.cpp function parseString (line 10) | vector parseString(string word) { function string (line 30) | string lowerCase(string word) { function main (line 48) | int main() { FILE: competitive-programming/uri/angry_ducks.cpp function rad (line 9) | double rad(double angle) { function main (line 13) | int main() { FILE: competitive-programming/uri/animal.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/approximate_number_of_primes.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/area.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/area_of_circle.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/arranging_tasks.cpp type task (line 9) | struct task { function sortByTime (line 13) | bool sortByTime(task &ta1, task &ta2) { function main (line 19) | int main() { FILE: competitive-programming/uri/array_123.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/array_change_1.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/array_fill_1.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/array_fill_2.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/array_fill_3.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/array_fill_4.cpp function is_full (line 8) | bool is_full(vector &v) { function main (line 13) | int main() { FILE: competitive-programming/uri/array_hash.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/array_replacement_1.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/array_selection_1.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/as_abas_de_pericles.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/ascending_and_descending.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/assigning_teams.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/automated_checking_machine.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/average_1.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/average_2.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/average_3.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/average_speed.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/back_to_high_school_physics.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/bacteria_1.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/banknotes.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/banknotes_and_coins.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/baskharas_formula.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/batmain.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/bazinga.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/below_the_main_diagonal.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/below_the_secundary_diagonal.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/bill.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/bingo.cpp function isPossible (line 10) | bool isPossible(const set s, int n) { function main (line 23) | int main() { FILE: competitive-programming/uri/bla.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/blobs.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/bloggo_shotcuts.cpp function string (line 8) | string edit_italic(char charac, bool is_start) { function string (line 13) | string edit_bold(char charac, bool is_start) { function main (line 18) | int main() { FILE: competitive-programming/uri/bob_conduit.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/bodybuilder.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/brazil_world_cup.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/brazilian_economy.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/brick_game.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/bubbles_and_bucket.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/bubbles_and_bucket_2.cpp function countNumberOfSwaps (line 12) | bool countNumberOfSwaps(int n1, int n2) { function main (line 17) | int main() { FILE: competitive-programming/uri/building_houses.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/building_walls.cpp function split (line 10) | vector split(string s) { function to_digit (line 26) | int to_digit(string height) { function main (line 35) | int main() { FILE: competitive-programming/uri/buttlerflies.cpp function new_specie (line 8) | int new_specie(vector &v, int n) { function main (line 17) | int main() { FILE: competitive-programming/uri/c_mais_ou_menos.cpp function get_vitamine_c (line 8) | int get_vitamine_c(string fruit) { function main (line 18) | int main() { FILE: competitive-programming/uri/caeser_cipher.cpp function string (line 8) | string shift(string str, int n) { function main (line 22) | int main() { FILE: competitive-programming/uri/cannon.cpp type missile (line 9) | struct missile { function compare (line 13) | bool compare(missile m1, missile m2) { function max (line 19) | int max(int a, int b) { function main (line 23) | int main() { FILE: competitive-programming/uri/canteen_queue.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/cash_roial.cpp function enemies_counter (line 9) | int enemies_counter(vector &V, int cx, int cy, int N, int M) { function main (line 24) | int main() { FILE: competitive-programming/uri/chinese_whispers.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/chirrin_chirrion.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/chocolate_factory.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/christmas_decoration.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/christmas_olympic.cpp type country (line 10) | struct country { function compareByMedals (line 17) | bool compareByMedals(const country &c1, const country &c2) { function main (line 30) | int main() { FILE: competitive-programming/uri/christmas_trapeziums.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/christmas_tree.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/close_the_doors.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/coast_guard.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/coffee_machine.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/colision.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/collectable_cards.cpp function mcd (line 6) | int mcd(int n1, int n2) { function main (line 11) | int main() { FILE: competitive-programming/uri/colourful_flowers.cpp function get_greater_radius (line 9) | double get_greater_radius(int a, int b, int c) { function get_triangle_area (line 14) | double get_triangle_area(int l1, int l2, int l3) { function get_smaller_circunference_radius (line 23) | double get_smaller_circunference_radius(double triangle_area, double tri... function main (line 27) | int main() { FILE: competitive-programming/uri/column_in_array.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/combiner.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/compare_substring.cpp function searchSubstring (line 8) | int searchSubstring(string s) { function main (line 14) | int main() { FILE: competitive-programming/uri/complete_sequence.cpp function find_letter (line 8) | bool find_letter(char c) { function not_in_phrase (line 14) | bool not_in_phrase(char c, string phrase) { function main (line 19) | int main() { FILE: competitive-programming/uri/consumption.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/contando_ciclos.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/contest.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/contract_revision.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/converting_to_hexadecimal.cpp function string (line 10) | string reverseString(string hex) { function main (line 16) | int main() { FILE: competitive-programming/uri/coordinates_of_a_point.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/correct_colourful_flower.cpp function main (line 7) | int main(){ FILE: competitive-programming/uri/corrida.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/counting_crow.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/counting_sheeps.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/cutoff_rounder.cpp function string (line 9) | string get_integer_part(string n) { function string (line 15) | string get_decimal_part(string n) { function to_int (line 21) | int to_int(string num) { function to_double (line 31) | double to_double(string num) { function is_num_decimal_greater_than_or_equal_to_cutoff_decimal (line 43) | bool is_num_decimal_greater_than_or_equal_to_cutoff_decimal(string num, ... function has_period (line 61) | bool has_period(string n) { function main (line 66) | int main() { FILE: competitive-programming/uri/cutoff_rounder_2.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/dancing_sentence.cpp function to_uppercase (line 8) | char to_uppercase(char charac) { function to_lowercase (line 14) | char to_lowercase(char charac) { function is_uppercase (line 20) | bool is_uppercase(char charac) { function main (line 26) | int main() { FILE: competitive-programming/uri/dangerous_dive.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/dating_online.cpp function main (line 16) | int main() { FILE: competitive-programming/uri/deciphering_the_encrypted_card.cpp function string (line 8) | string to_lowercase(string a) { function string (line 20) | string decipher(string phrase, string f, string s) { function main (line 31) | int main() { FILE: competitive-programming/uri/delaunay_triangulation.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/desafio_de_bino.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/detective_watson_1.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/detective_watson_2.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/diamonds_and_sand.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/diet_plan.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/difference.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/different_digits.cpp function different_digits (line 8) | int different_digits(int n) { function main (line 30) | int main() { FILE: competitive-programming/uri/difn.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/dijkstra.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/discovering_password.cpp type oil (line 11) | struct oil { function string (line 16) | string intToString(int passwordPart) { function compareOiliness (line 22) | bool compareOiliness(const oil &oil1, const oil &oil2) { function main (line 27) | int main() { FILE: competitive-programming/uri/distance.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/distance_between_two_points.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/dividers.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/dividing_x_by_y.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/diving.cpp function main (line 11) | int main() { FILE: competitive-programming/uri/division_of_nlogonia.cpp function main (line 4) | int main() { FILE: competitive-programming/uri/divisors_1.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/dracarys.cpp function get_result1 (line 8) | unsigned long long int get_result1(int d1, int d2, int v1, int v2) { function get_result2 (line 20) | unsigned long long int get_result2(int d1, int d2, int v1, int v2) { function get_result3 (line 32) | unsigned long long int get_result3(int d1, int d2, int v1, int v2) { function main (line 49) | int main() { FILE: competitive-programming/uri/drought.cpp type city (line 10) | struct city { function compareCities (line 15) | bool compareCities(const city &a, const city &b) { function groupByMediumComsumption (line 19) | vector groupByMediumComsumption(vector &cities) { function main (line 41) | int main() { FILE: competitive-programming/uri/easy_difference_dates.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/easy_fibonacci.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/easy_problem_from_rujia_liu_1.cpp function getKthOccurrence (line 8) | int getKthOccurrence(vector &ar, int k, unsigned... function main (line 19) | int main() { FILE: competitive-programming/uri/easy_problem_from_rujia_liu_2.cpp function getKthOccurrence (line 9) | int getKthOccurrence(map< int, vector > &hash, int k, int v) { function main (line 20) | int main() { FILE: competitive-programming/uri/eletrical_outlet.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/encryption.cpp function get_index (line 8) | int get_index(char letter) { function get_element (line 14) | int get_element(char index) { function is_number (line 21) | int is_number(char letter) { function string (line 27) | string shift_to_the_right(string old_string) { function string (line 44) | string shift_to_the_left(string old_string) { function string (line 61) | string reverse(string password) { function main (line 67) | int main() { FILE: competitive-programming/uri/engine_failure.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/erasing_and_winning.cpp function main (line 7) | int main(){ FILE: competitive-programming/uri/estimating_the_mean.cpp function maximum_subsequence_sum (line 6) | int maximum_subsequence_sum(vector &v) { function main (line 20) | int main() { FILE: competitive-programming/uri/etiquetas_de_noel.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/even_and_odd.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/even_between_five_numbers.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/even_numbers.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/even_or_odd.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/even_square.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/event.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/event_time.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/exceeding_z.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/exchanging_cards.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/experiments.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/extremely_basic.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/face_2015_free_gift.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/factorial.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/factorial_again.cpp function factorial (line 8) | long long int factorial(int n) { function main (line 13) | int main() { FILE: competitive-programming/uri/factorial_sum.cpp function factorial (line 7) | unsigned long long int factorial(int n) { function main (line 12) | int main() { FILE: competitive-programming/uri/fake_tickets.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/fans_and_ballons.cpp function get_left_fan (line 9) | int get_left_fan(vector< vector > &matrix, int row, int column) { function get_right_fan (line 16) | int get_right_fan(vector< vector > &matrix, int row, int column) { function is_it_safe_for_left (line 23) | int is_it_safe_for_left(vector< vector > &matrix, int row, int colu... function is_it_safe_for_right (line 31) | int is_it_safe_for_right(vector< vector > &matrix, int row, int col... function main (line 38) | int main() { FILE: competitive-programming/uri/farm_robot.cpp function main (line 5) | int main (void) { FILE: competitive-programming/uri/fase.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/fast_fibonacci.cpp function fibonacci (line 9) | long double fibonacci(int n) { function main (line 13) | int main() { FILE: competitive-programming/uri/fast_prime_number.cpp function is_prime (line 8) | int is_prime(int n) { function main (line 23) | int main() { FILE: competitive-programming/uri/feedback.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/feyman.cpp function feyman (line 7) | int feyman(int n) { function main (line 12) | int main() { FILE: competitive-programming/uri/fibonacci_again.cpp function fast_fib (line 11) | void fast_fib(long long int n,long long int ans[]) { function main (line 37) | int main() { FILE: competitive-programming/uri/fibonacci_array.cpp function fib (line 7) | long long int fib(int n) { function main (line 27) | int main() { FILE: competitive-programming/uri/fila_do_supermercado.cpp function getIndexOfSmallerTimeSpent (line 7) | int getIndexOfSmallerTimeSpent(map &m) { function main (line 20) | int main() { FILE: competitive-programming/uri/fire_flowers.cpp function to_positive (line 8) | int to_positive(int number) { function main (line 13) | int main() { FILE: competitive-programming/uri/fit_or_dont_fit_1.cpp function verify_number (line 9) | int verify_number(unsigned long long int n1, unsigned long long int n2) { function main (line 23) | int main() { FILE: competitive-programming/uri/fit_or_dont_fit_2.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/fixed_password.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/flavious_josephus_legend.cpp function verify_last_value (line 8) | int verify_last_value(vector &v) { function can_be_counted (line 14) | int can_be_counted(vector &v, int index, int n) { function get_last_value_index (line 24) | int get_last_value_index(vector &v) { function main (line 28) | int main() { FILE: competitive-programming/uri/flavious_josephus_legend2.cpp function parse_index (line 8) | int parse_index(int index, int size) { function main (line 13) | int main() { FILE: competitive-programming/uri/flavious_josephus_legend3.cpp function josephus (line 7) | int josephus(int n, int k) { function main (line 12) | int main() { FILE: competitive-programming/uri/flowers_flourish_from_france.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/football.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/frequent_asked_questions.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/friends_of_habey.cpp function compareByName (line 11) | bool compareByName(string name1, string name2) { function main (line 15) | int main() { FILE: competitive-programming/uri/fuel_spent.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/functions.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/galopeira.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/game_of_the_greatness.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/general_exam.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/getline_fruits.cpp function num_of_fruits (line 9) | int num_of_fruits(string fruits) { function main (line 15) | int main() { FILE: competitive-programming/uri/getline_one.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/getline_three_shoes.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/going_to_the_market.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/grains_in_a_chess_board.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/grenais.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/growing_sequences.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/guess_what.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/guilherme_and_his_kites.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/guru_da_sorte.cpp function get_value_for (line 8) | int get_value_for(string name) { function get_result (line 24) | int get_result(int N) { function main (line 41) | int main() { FILE: competitive-programming/uri/hailstone_sequences.cpp function resolve (line 7) | int resolve(int h, int max) { function main (line 17) | int main() { FILE: competitive-programming/uri/hall_of_murderers.cpp function find (line 10) | bool find(string murder, vector &people_killed) { function main (line 18) | int main() { FILE: competitive-programming/uri/hall_of_murderers_2.cpp type person (line 10) | struct person { function findPerson (line 16) | int findPerson(vector &people, string name) { function compareByName (line 23) | bool compareByName(const person &a, const person &b) { function main (line 27) | int main() { FILE: competitive-programming/uri/hall_of_murderers_3.cpp function main (line 11) | int main() { FILE: competitive-programming/uri/hamekameka.cpp function string (line 8) | string ka(int as) { function main (line 14) | int main() { FILE: competitive-programming/uri/handball.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/hardwood_species.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/hash_tables.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/hashmat_the_brave_warrior.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/hay_points.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/he_is_offside!.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/head_or_tails.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/height.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/hello_galaxy.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/help!.cpp function problem_incorrected (line 8) | bool problem_incorrected(string problems, char problem) { function problem_solved (line 13) | bool problem_solved(string problems, char problem) { function incorrect_submission_counter (line 18) | int incorrect_submission_counter(string problems, char problem) { function main (line 24) | int main() { FILE: competitive-programming/uri/help_girafales.cpp function get_index (line 9) | int get_index(vector< pair > names, string name) { function main (line 15) | int main() { FILE: competitive-programming/uri/help_seu_madruga.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/help_seu_madruga_int.cpp function get_bigger (line 9) | int get_bigger(vector &v) { function area_binary_search (line 15) | int area_binary_search(vector &v, int area) { function main (line 33) | int main() { FILE: competitive-programming/uri/help_the_federation.cpp type team (line 10) | struct team { function compareTeams (line 18) | bool compareTeams(const team &team1, const team &team2) { function main (line 31) | int main() { FILE: competitive-programming/uri/hexagonal_tiles_1.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/hexagonal_tiles_2.cpp function resolve (line 7) | int resolve(int n1, int n2) { function main (line 13) | int main() { FILE: competitive-programming/uri/hidden_message.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/highest_and_position.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/hohoho.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/honey_reservoir.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/hours_and_minutes.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/how_easy.cpp function correct_word (line 9) | bool correct_word(string word) { function parse_string (line 15) | vector parse_string(string line) { function main (line 39) | int main() { FILE: competitive-programming/uri/huehue.cpp function string (line 8) | string removeConsoants(string s) { function funniest (line 21) | bool funniest(string s) { function main (line 30) | int main() { FILE: competitive-programming/uri/i_am_toorg.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/ice_statuses.cpp function min (line 9) | int min(int a, int b) { function main (line 13) | int main() { FILE: competitive-programming/uri/identifying_tea.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/image.cpp function string (line 9) | string concatenate(char c, int times) { function main (line 15) | int main() { FILE: competitive-programming/uri/impar_par_roubo.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/inferior_area.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/inside_out.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/international_chat.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/internship.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/interval.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/interval2.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/inverse_numbers.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/is_triangle.cpp function is_triangle (line 7) | int is_triangle(int a, int b, int c) { function main (line 12) | int main() { FILE: competitive-programming/uri/jetiqui.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/jingle_composing.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/jogatina_ufpa.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/jollo.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/joulupukki.cpp function split (line 9) | vector split(string s) { function string (line 28) | string transformWord(string word) { function main (line 38) | int main() { FILE: competitive-programming/uri/jumping_frog.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/just_in_time.cpp function main (line 9) | int main (void) { function isPrimo (line 19) | bool isPrimo(int n) { function menorPrimo (line 33) | int menorPrimo(int n) { FILE: competitive-programming/uri/justifier.cpp function get_greater_size (line 9) | int get_greater_size(vector &v) { function string (line 15) | string concatenate_spaces(int n) { function main (line 21) | int main() { FILE: competitive-programming/uri/justifier_2.cpp function get_greater_size (line 9) | int get_greater_size(vector &v) { function string (line 15) | string concatenate_spaces(int n) { function string (line 21) | string remove_first_spaces(string phrase) { function string (line 32) | string remove_spaces(string phrase) { function main (line 48) | int main() { FILE: competitive-programming/uri/kage_bunshin_no_jutsu.cpp function jutsuNumber (line 5) | int jutsuNumber(long long int N) { function main (line 10) | int main() { FILE: competitive-programming/uri/kiloman.cpp function is_hit (line 9) | bool is_hit(vector &v, string js, int ind) { function main (line 15) | int main() { FILE: competitive-programming/uri/koch_snowflake.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/lap.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/laser_sculpture.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/last_analogimon.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/laundry.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/leaders_impeachment.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/led.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/left_area.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/libertadores_1.cpp function parse_string (line 10) | vector parse_string(string line) { function to_digit (line 30) | int to_digit(char digit) { function string_to_number (line 34) | int string_to_number(string n) { type team (line 48) | struct team { function main (line 54) | int main() { FILE: competitive-programming/uri/libertadores_2.cpp function main (line 6) | int main() { FILE: competitive-programming/uri/line_in_array.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/linear_parking_lot.cpp type car (line 8) | struct car { function main (line 13) | int main() { FILE: competitive-programming/uri/little_ant.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/logical_sequence.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/logical_sequence_2.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/lost_boots.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/lowest_number_and_position.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/lu_di_oh.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/lucro.cpp function max (line 7) | int max(int a, int b) { function main (line 11) | int main() { FILE: competitive-programming/uri/lucro_otimizado.cpp function max (line 7) | int max(int a, int b) { function main (line 11) | int main() { FILE: competitive-programming/uri/macpronalts.cpp function total_price (line 8) | double total_price(int code, int number) { function main (line 21) | int main() { FILE: competitive-programming/uri/maesters_map.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/mean_median_problem.cpp function is_integer (line 8) | int is_integer(double n) { function main (line 13) | int main() { FILE: competitive-programming/uri/medal_table.cpp type country (line 10) | struct country { function compareByMedals (line 17) | bool compareByMedals(const country &c1, const country &c2) { function main (line 30) | int main() { FILE: competitive-programming/uri/merry_christmaaaas.cpp function string (line 8) | string happiness_index(int index) { function main (line 14) | int main() { FILE: competitive-programming/uri/mirror_sequence.cpp function string (line 9) | string toString(int n) { function string (line 15) | string reverseString(string s) { function main (line 21) | int main() { FILE: competitive-programming/uri/mjolnir.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/monetary_formatting.cpp function under_ten (line 8) | bool under_ten(string cents) { function string (line 13) | string reverse_string(string s) { function string (line 19) | string parse_string(string s, string cents) { function main (line 42) | int main() { FILE: competitive-programming/uri/montanha_russa.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/month.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/moon_phases.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/morse.cpp function createMorseTable (line 8) | void createMorseTable(map &morse) { function string (line 37) | string buildCode(string partial, int j) { function main (line 45) | int main() { FILE: competitive-programming/uri/motoboy.cpp function max (line 9) | int max(int a, int b) { type Obj (line 13) | struct Obj { function sortByPizza (line 17) | bool sortByPizza(Obj obj1, Obj obj2) { function main (line 23) | int main() { FILE: competitive-programming/uri/multiple_of_13.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/multiple_reading.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/multiples.cpp function is_multiple (line 7) | int is_multiple(int n1, int n2) { function main (line 20) | int main() { FILE: competitive-programming/uri/multiplication_table.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/musical_loop.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/name_at_form.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/natural_sum.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/new_record.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/nine.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/number_frequence.cpp function get_position (line 9) | int get_position(vector< pair >& v, int el) { function main (line 14) | int main() { FILE: competitive-programming/uri/obi_uri.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/odd_numbers.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/og.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/one_two_three.cpp function verify_num (line 9) | int verify_num(string num, string number, int n) { function main (line 16) | int main() { FILE: competitive-programming/uri/operator_game.cpp type operation (line 10) | struct operation { function is_result_correct (line 16) | bool is_result_correct(const operation &op, string oper) { function main (line 27) | int main() { FILE: competitive-programming/uri/optical_reader.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/our_days_are_never_coming_back.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/painel_led.cpp function change_light (line 8) | char change_light(char type, int num, bool change) { function main (line 18) | int main() { FILE: competitive-programming/uri/palindrome_game.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/pandorgas.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/pao_de_queijo_sweeper.cpp function calculate (line 8) | int calculate(const vector< vector > &matrix, int i, int j, int max... function main (line 18) | int main() { FILE: competitive-programming/uri/parafusos_e_porcas.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/parenthesis_balance.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/parity.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/pascal_library.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/password.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/password_validator.cpp function validateString (line 8) | bool validateString(string s) { function validatePunctuation (line 23) | bool validatePunctuation(string s) { function validateSize (line 103) | bool validateSize(string s) { function main (line 108) | int main() { FILE: competitive-programming/uri/paulas_mathematic_game.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/peaks_and_valleys.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/pedrinhos_christmas.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/pepe.cpp function string (line 8) | string parsePhrase(string hour, string minute, int opened) { function main (line 19) | int main() { FILE: competitive-programming/uri/perfect_number.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/phin_bonati.cpp function willBonatiAlgorithm (line 7) | long long int willBonatiAlgorithm(int n) { function main (line 24) | int main() { FILE: competitive-programming/uri/pizza_pre_bh.cpp type date (line 8) | struct date { function main (line 14) | int main() { FILE: competitive-programming/uri/pokemon.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/pomekon_collection.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/pomekons_battle.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/population_increase.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/positive_numbers.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/positives_and_average.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/power_crisis.cpp function buildVector (line 8) | vector buildVector(int n) { function getLastRegion (line 14) | int getLastRegion(vector regions, int m) { function main (line 36) | int main() { FILE: competitive-programming/uri/preface.cpp function main (line 12) | int main() { FILE: competitive-programming/uri/presents.cpp type product (line 11) | struct product { function compareProducts (line 17) | bool compareProducts(const product &p1, const product &p2) { function main (line 27) | int main() { FILE: competitive-programming/uri/primary_arithmatic.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/prime_number.cpp function is_prime (line 8) | int is_prime(int n) { function main (line 23) | int main() { FILE: competitive-programming/uri/pum.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/quadrant.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/queen.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/radares.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/rails.cpp function clear (line 9) | void clear(queue &q) { function canMarshalInTheRequiredOrder (line 14) | bool canMarshalInTheRequiredOrder(queue &train) { function main (line 34) | int main() { FILE: competitive-programming/uri/rails_again.cpp function string (line 10) | string requiredOrder(queue &t, queue &order) { function main (line 33) | int main() { FILE: competitive-programming/uri/reading_books.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/regular_simple_polygon.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/remaining2.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/removing_letter.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/rest_of_a_division.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/right_area.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/rlj.cpp function to_digit (line 9) | int to_digit(char c) { function string_to_int (line 13) | int string_to_int(string num) { function parse_eq (line 19) | int parse_eq(string eq, int start, int size) { function main (line 24) | int main() { FILE: competitive-programming/uri/robot_instructions.cpp function string (line 10) | string parse_string(string line) { function to_digit (line 30) | int to_digit(char digit) { function string_to_number (line 34) | int string_to_number(string n) { function main (line 48) | int main() { FILE: competitive-programming/uri/rock_paper_airstrike.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/rock_paper_scissors_lizard_spock.cpp function string (line 8) | string get_winner(string type1, string type2) { function main (line 23) | int main() { FILE: competitive-programming/uri/roman_numerals_for_page_numbers.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/rot13.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/s_sequence.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/s_sequence_2.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/salary.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/salary_with_bonus.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/santas_translator.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/scientific_notation.cpp function main (line 6) | int main() { FILE: competitive-programming/uri/score_validation.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/searching_for_nessy.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/searching_subsequences.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/selection_test_1.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sequence_ij_1.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sequence_ij_2.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sequence_ij_3.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sequence_ij_4.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/sequence_of_numbers_and_sum.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sequence_of_sequence.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/seven.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/several_scores_with_validation.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/short_attendance.cpp function need_attendance (line 9) | bool need_attendance(string attendance) { function main (line 22) | int main() { FILE: competitive-programming/uri/short_story.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/simple_calculate.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/simple_factorial.cpp function fatorial (line 7) | int fatorial(int n) { function main (line 12) | int main() { FILE: competitive-programming/uri/simple_prod.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/simple_sort.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/simple_sum.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/simulator.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/six_odd_numbers.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/snack.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/sort_by_length.cpp function parse_string (line 7) | vector parse_string(string line) { function sort_by_size (line 27) | vector sort_by_size(vector &v) { function main (line 47) | int main() { FILE: competitive-programming/uri/sort_sort_and_sort.cpp function sortBy (line 9) | bool sortBy(const pair &pair1, const pair &pair2) { function main (line 27) | int main() { FILE: competitive-programming/uri/sphere.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/spurs_rock.cpp type team (line 10) | struct team { function untie (line 18) | bool untie(const team &t1, const team &t2) { function main (line 43) | int main() { FILE: competitive-programming/uri/square_array_4.cpp function generateFirstStep (line 5) | void generateFirstStep(int n, int x) { function generateSecondStep (line 16) | void generateSecondStep(int n, int x) { function generateThirdStep (line 29) | void generateThirdStep(int n, int x) { function main (line 40) | int main() { FILE: competitive-programming/uri/square_game.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/square_matrix_1.cpp function get_limit (line 8) | int get_limit(int n) { function main (line 14) | int main() { FILE: competitive-programming/uri/square_matrix_2.cpp function string (line 7) | string generateSpaces(int n) { function main (line 13) | int main() { FILE: competitive-programming/uri/square_matrix_3.cpp function getNumberOfDigits (line 9) | int getNumberOfDigits(int n) { function string (line 19) | string generateSpaces(int n, int t) { function main (line 26) | int main() { FILE: competitive-programming/uri/square_root_of_10.cpp function rootNumber (line 8) | double rootNumber(int n1, int n2) { function main (line 13) | int main() { FILE: competitive-programming/uri/square_root_of_2.cpp function rootNumber (line 8) | double rootNumber(int n1, int n2) { function main (line 13) | int main() { FILE: competitive-programming/uri/square_spiral.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/squared_and_cubic.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/ssn_1.cpp function to_digit (line 8) | int to_digit(char num) { function main (line 12) | int main() { FILE: competitive-programming/uri/star_trek.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/start_grid.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/stick_collector_robot.cpp function isInsideGrid (line 9) | bool isInsideGrid(int x, int y, int lines, int columns) { function main (line 14) | int main() { FILE: competitive-programming/uri/sticks_game.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/strategy_game.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/subprime.cpp type bank (line 8) | struct bank { function main (line 14) | int main() { FILE: competitive-programming/uri/sucessor_par.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/sudoku.cpp function correct_mini_matrix (line 10) | bool correct_mini_matrix(vector< vector > &sudoku, int x, int y) { function correct_horizontal_line (line 26) | bool correct_horizontal_line(vector< vector > &sudoku) { function correct_vertical_line (line 41) | bool correct_vertical_line(vector< vector > &sudoku) { function main (line 56) | int main() { FILE: competitive-programming/uri/sum_of_consecutive_even_numbers.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sum_of_consecutive_odd_numbers_3.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sum_of_consecutive_odd_numbers_I.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sum_of_consecutive_odd_numbers_II.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sum_of_two_squares.cpp function is_int (line 10) | bool is_int(float n) { function main (line 16) | int main() { FILE: competitive-programming/uri/summer_camp.cpp type student (line 10) | struct student { function updateStartIndexOnClockWise (line 16) | int updateStartIndexOnClockWise(vector &students, int startInde... function updateStartIndexOnCounterClockWise (line 34) | int updateStartIndexOnCounterClockWise(vector &students, int st... function main (line 52) | int main() { FILE: competitive-programming/uri/summing_consecutive_integers.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/sunday_morning.cpp function get_minutes (line 8) | int get_minutes(string minutes) { function main (line 16) | int main() { FILE: competitive-programming/uri/superior_area.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/system_of_download.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/taxes_of_project.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/tda_rational_1.cpp function lcm (line 7) | int lcm(int num1, int num2) { function new_num (line 19) | int new_num(int num1, int num2, char op) { function main (line 26) | int main() { FILE: competitive-programming/uri/tda_rational_2.cpp function mdc (line 8) | int mdc(int num1, int num2) { function main (line 20) | int main() { FILE: competitive-programming/uri/tell_me_the_frequencies.cpp function toASCII (line 11) | int toASCII(char charac) { function compareByFrequency (line 16) | bool compareByFrequency(const pair &item1, const pair > &matrix, int x, int n, int m) { function main (line 26) | main() { FILE: competitive-programming/uri/the_wrath_of_khan.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/theons_answer.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/threebonacci_sequence.cpp function hasDigitThree (line 8) | bool hasDigitThree(unsigned long long int n) { function fibonacci (line 22) | unsigned long long int fibonacci(int n) { function main (line 41) | int main() { FILE: competitive-programming/uri/throwing_cards_away.cpp type num (line 8) | struct num { function main (line 13) | int main() { FILE: competitive-programming/uri/time_conversion.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/time_zone.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/to_care_or_not_to_care.cpp function add_zero_values (line 10) | void add_zero_values(vector &v1, vector &v2) { function to_binary_number (line 30) | vector to_binary_number(int n) { function to_decimal (line 40) | unsigned int to_decimal(vector &v) { function main (line 47) | int main() { FILE: competitive-programming/uri/to_care_or_not_to_care2.cpp function main (line 5) | int main() { FILE: competitive-programming/uri/top_n.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/tornado.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/train_swaping.cpp function numberOfSwaps (line 7) | int numberOfSwaps(int v[], int n) { function main (line 21) | int main() { FILE: competitive-programming/uri/tri-du.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/triangle.cpp function is_triangle (line 8) | int is_triangle(double a, double b, double c) { function main (line 13) | int main() { FILE: competitive-programming/uri/triangle_types.cpp function is_triangle (line 10) | int is_triangle(double a, double b, double c) { function main (line 15) | int main() { FILE: competitive-programming/uri/triangles.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/tribol.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/trinomial_triangle.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/tshirt2.cpp type tshirt (line 10) | struct tshirt { function clothesFound (line 15) | int clothesFound(vector< pair< tshirt, vector > > &clothes, stri... function compareClothes (line 24) | bool compareClothes(const pair< tshirt, vector > &p1, const pair... function main (line 33) | int main() { FILE: competitive-programming/uri/tshirts.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/tug_of_war.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/turma_jb6.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/turn_left.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/turn_left2.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/tustin_and_his_new_die.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/twilight_at_portland.cpp function isSecure (line 7) | bool isSecure(int matrix[101][101], int i, int j) { function main (line 16) | int main() { FILE: competitive-programming/uri/twitting.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/two_bills.cpp function getMaximumBill (line 7) | int getMaximumBill(int diff) { function main (line 16) | int main() { FILE: competitive-programming/uri/type_of_fuel.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/upset_fracil.cpp type msComparator (line 9) | struct msComparator { function main (line 13) | int main() { FILE: competitive-programming/uri/uri.cpp function is_power_of_two (line 8) | bool is_power_of_two(int n) { function string (line 15) | string get_winner(vector &points) { function main (line 36) | int main() { FILE: competitive-programming/uri/vai_na_sort.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/variations.cpp function in_new (line 8) | bool in_new(char l) { function main (line 13) | int main() { FILE: competitive-programming/uri/virus.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/vitoria_and_her_indecision.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/volleyball.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/weighted_averages.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/welcome_to_the_winter.cpp function main (line 7) | int main() { FILE: competitive-programming/uri/wertyu.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/where_is_the_marble.cpp function main (line 10) | int main() { FILE: competitive-programming/uri/which_triangle.cpp function string (line 8) | string is_rectangular(int a, int b, int c) { function main (line 13) | int main() { FILE: competitive-programming/uri/who_turn_is_it.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/wills_message.cpp function main (line 6) | int main() { FILE: competitive-programming/uri/world_cup.cpp function main (line 8) | int main() { FILE: competitive-programming/uri/zero_means_zero.cpp function main (line 9) | int main() { FILE: competitive-programming/uri/zero_or_one.cpp function main (line 7) | int main() { FILE: competitive-programming/uva/280-vertex.cpp function dfs (line 14) | void dfs(int vertex, vector & AdjList, set & reached, int dfs_n... function main (line 25) | int main() { FILE: competitive-programming/weekend-code-challenge/07-zero-to-hero/solution1.js function zeroToHero (line 1) | function zeroToHero(numbers) { FILE: computer_science/algorithms/binary-search/binary-search.js function getMiddle (line 1) | function getMiddle(start, end) { function binarySearch (line 5) | function binarySearch(numbers, target) { function logResult (line 23) | function logResult(list, target) { FILE: computer_science/algorithms/bubble-sort/bubble-sort.js function bubbleSort (line 1) | function bubbleSort(numbers) { FILE: computer_science/algorithms/dynamic_programming/factorial.cpp function factorial_dp (line 6) | unsigned long long factorial_dp(int n) { function main (line 16) | int main() { FILE: computer_science/algorithms/dynamic_programming/fibonacci.cpp function fibonacci (line 7) | int fibonacci(int n) { function fibonacci_dp (line 14) | int fibonacci_dp(int n) { function main (line 28) | int main() { FILE: computer_science/algorithms/find_kth_element/find_kth_element_1.cpp function find_kth_element (line 9) | int find_kth_element(vector &elements, int k) { function main (line 14) | int main() { FILE: computer_science/algorithms/graphs/bfs.cpp function bfs (line 14) | void bfs(vii AdjList, int s) { function main (line 33) | int main() { FILE: computer_science/algorithms/graphs/dfs.cpp function dfs (line 15) | void dfs(int u) { function main (line 24) | int main() { FILE: computer_science/algorithms/is-prime/is-prime.js function isPrime (line 1) | function isPrime(num) { FILE: computer_science/algorithms/kadane/kadane.js function maxSubArray (line 1) | function maxSubArray(nums) { FILE: computer_science/algorithms/knapsack/knapsack1.cpp function max (line 3) | int max(int a, int b) { function knapsack (line 7) | int knapsack(int totalWeight, int weights[], int values[], int n) { function main (line 21) | int main() { FILE: computer_science/algorithms/knapsack/knapsack2.cpp function max (line 6) | int max(int a, int b) { function knapsack (line 10) | int knapsack(int totalWeight, vector &weights, vector &values,... function main (line 24) | int main() { FILE: computer_science/algorithms/least_common_multiple/least_common_multiple.cpp function lcm (line 4) | int lcm(int num1, int num2) { function main (line 16) | int main() { FILE: computer_science/algorithms/linear-search/linear-search.js function linearSearch (line 1) | function linearSearch(list, value) { FILE: computer_science/algorithms/maximum_subsequence_sum/maximum_subsequence_sum_1.cpp function maximum_subsequence_sum (line 5) | int maximum_subsequence_sum(int ar[], int n) { function main (line 17) | int main() { FILE: computer_science/algorithms/maximum_subsequence_sum/maximum_subsequence_sum_2.cpp function maximum_subsequence_sum (line 6) | int maximum_subsequence_sum(vector &v) { function main (line 18) | int main() { FILE: computer_science/algorithms/min_and_max/minimax.cpp function minimax (line 5) | void minimax(int v[], int n, int &a, int &b) { function main (line 15) | int main() { FILE: computer_science/algorithms/parse_strings/parse_strings.cpp function parse_string (line 7) | vector parse_string(string line) { function main (line 27) | int main() { FILE: computer_science/algorithms/pointers/pointer.cpp function main (line 5) | int main() { FILE: computer_science/algorithms/prime_number/prime_number.cpp function is_prime_number (line 6) | bool is_prime_number(int n) { function main (line 19) | int main() { FILE: computer_science/algorithms/recursion/fibonacci/fibonacci.c function main (line 7) | int main() { function fibonacciHelper (line 12) | int fibonacciHelper(int n, int first, int second) { function fibonacci (line 19) | int fibonacci(int n) { FILE: computer_science/algorithms/recursion/fibonacci/fibonacci.py function fibonacci (line 3) | def fibonacci(num): FILE: computer_science/algorithms/recursion/log_2.c function main (line 6) | int main() { function log_2 (line 12) | int log_2(int n) { FILE: computer_science/algorithms/recursion/palindromo.c function main (line 6) | int main() { function palindromo (line 22) | int palindromo(char *n) { FILE: computer_science/algorithms/recursion/regua.c function regua (line 3) | void regua (int n) { function main (line 14) | int main() { FILE: computer_science/algorithms/recursion/reverse.c function main (line 6) | int main() { function reverse (line 13) | int reverse(char *str) { FILE: computer_science/algorithms/recursion/sum.py function list_sum (line 1) | def list_sum(list): FILE: computer_science/algorithms/reverse-string/reverse-string-in-place.js function reverseString (line 1) | function reverseString(s) { FILE: computer_science/algorithms/reverse-string/reverse-string.js function reverseString (line 1) | function reverseString(s) { FILE: computer_science/algorithms/search/binary_search.cpp function binary_search (line 6) | int binary_search(vector &v, int element) { function main (line 21) | int main() { FILE: computer_science/algorithms/search/binary_search.py function binary_search (line 1) | def binary_search(list, item): FILE: computer_science/algorithms/search/recursive_binary_search.py function binary_search (line 1) | def binary_search(list, item): FILE: computer_science/algorithms/search/sequential_search.py function sequential_search (line 1) | def sequential_search(list, item): FILE: computer_science/algorithms/segment-tree/sum/lazy_update.cpp function lazy_update (line 10) | void lazy_update(int p, int start, int end, int left, int right, int inc) { function main (line 42) | int main() { FILE: computer_science/algorithms/sorting/bubble_sort/bubble_sort.cpp function bubble_sort (line 6) | void bubble_sort(int v[], int n) { function main (line 14) | int main() { FILE: computer_science/algorithms/sorting/bubble_sort/bubble_sort.py function bubble_sort (line 1) | def bubble_sort(ar): FILE: computer_science/algorithms/sorting/insertion_sort.cpp function insertion_sort (line 5) | void insertion_sort(int n, int array[]) { function main (line 17) | int main() { FILE: computer_science/algorithms/sorting/merge_sort.cpp function merge (line 6) | vector merge(vector& vec, const vector& left, const vecto... function merge_sort (line 35) | vector merge_sort(vector& vec) { function main (line 50) | int main() { FILE: computer_science/algorithms/sorting/reverse_insertion_sort.cpp function reverse_insertion_sort (line 5) | void reverse_insertion_sort(int n, int array[]) { function main (line 14) | int main() { FILE: computer_science/algorithms/sorting/selection_sort.cpp function selection_sort (line 6) | void selection_sort(int v[], int n) { function main (line 14) | int main() { FILE: computer_science/algorithms/sorting/string_insertion_sort.cpp function insertion_sort (line 5) | void insertion_sort(int n, char array[]) { function main (line 19) | int main() { FILE: computer_science/algorithms/string_to_int/string_to_int.cpp function to_digit_test (line 7) | int to_digit_test(char digit) { function to_digit (line 12) | int to_digit(char digit) { function string_to_number (line 16) | int string_to_number(string n) { function string_to_int (line 30) | int string_to_int(string n) { function main (line 42) | int main() { FILE: computer_science/algorithms/subset/subset.js function getAllSubsets (line 1) | function getAllSubsets(subset, nums, output, index) { FILE: computer_science/big_o/example1.py function foo (line 1) | def foo(array): FILE: computer_science/big_o/example10.py function is_prime (line 3) | def is_prime(num): FILE: computer_science/big_o/example11.py function factorial (line 1) | def factorial(n): FILE: computer_science/big_o/example12.py function permutation (line 1) | def permutation(str): function handle_permutation (line 4) | def handle_permutation(str, prefix): FILE: computer_science/big_o/example13.py function fib (line 1) | def fib(n): FILE: computer_science/big_o/example14.py function all_fib (line 1) | def all_fib(n): function fib (line 5) | def fib(n): FILE: computer_science/big_o/example15.py function all_fib (line 1) | def all_fib(n): function fib (line 9) | def fib(n, memo): FILE: computer_science/big_o/example16.py function powers_of_2 (line 1) | def powers_of_2(n): FILE: computer_science/big_o/example17.py function product (line 1) | def product(a, b): FILE: computer_science/big_o/example18.py function power (line 1) | def power(a, b): FILE: computer_science/big_o/example19.py function mod (line 1) | def mod(a, b): function mod (line 15) | def mod(a, b): FILE: computer_science/big_o/example2.py function print_pairs (line 1) | def print_pairs(array): FILE: computer_science/big_o/example20.py function div (line 1) | def div(a, b): FILE: computer_science/big_o/example21.py function sqrt (line 1) | def sqrt(n): function sqrt_helper (line 4) | def sqrt_helper(n, min, max): FILE: computer_science/big_o/example22.py function square_root (line 3) | def square_root(n): FILE: computer_science/big_o/example3.py function print_unordered_pairs (line 1) | def print_unordered_pairs(array): FILE: computer_science/big_o/example4.py function print_unordered_pairs (line 1) | def print_unordered_pairs(array_a, array_b): FILE: computer_science/big_o/example5.py function print_unordered_pairs (line 1) | def print_unordered_pairs(array_a, array_b): FILE: computer_science/big_o/example6.py function reverse (line 1) | def reverse(array): FILE: computer_science/big_o/example9.py function sum (line 1) | def sum(node): FILE: computer_science/data_structures/array/array.cpp function main (line 5) | int main() { FILE: computer_science/data_structures/array/vectors.cpp function desc_sort (line 9) | void desc_sort(vector &v) { function desc_sort (line 14) | void desc_sort(vector *v) { function main (line 18) | int main() { FILE: computer_science/data_structures/binary-heap/min-heap.js class MinHeap (line 1) | class MinHeap { method constructor (line 2) | constructor() { method insert (line 6) | insert(value) { method extract (line 15) | extract() { method size (line 29) | size() { method isEmpty (line 33) | isEmpty() { method findMinimum (line 37) | findMinimum() { method siftUp (line 41) | siftUp(index) { method siftDown (line 50) | siftDown(index) { method swap (line 70) | swap(a, b) { method getLeftIndex (line 76) | getLeftIndex(index) { method getRightIndex (line 80) | getRightIndex(index) { method getParentIndex (line 84) | getParentIndex(index) { FILE: computer_science/data_structures/binary_search_tree/BinarySearchTree/index.js class BinarySearchTree (line 3) | class BinarySearchTree { method constructor (line 4) | constructor(value) { method insertLeft (line 10) | insertLeft(value) { method insertRight (line 20) | insertRight(value) { method preOrder (line 30) | preOrder() { method inOrder (line 36) | inOrder() { method postOrder (line 42) | postOrder() { method bfs (line 48) | bfs() { method insertNode (line 60) | insertNode(value) { method findNode (line 72) | findNode(value) { method removeNode (line 84) | removeNode(value, parent) { method clearNode (line 142) | clearNode() { method findMinimumValue (line 148) | findMinimumValue() { FILE: computer_science/data_structures/binary_search_tree/BinarySearchTree/index.test.js function buildBST (line 4) | function buildBST() { FILE: computer_science/data_structures/binary_search_tree/binary_search_tree.py class Node (line 4) | class Node: method __init__ (line 5) | def __init__(self, value): class BinarySearchTree (line 11) | class BinarySearchTree: method __init__ (line 12) | def __init__(self): method insert (line 15) | def insert(self, value): method insert_node (line 21) | def insert_node(self, current_node, value): method find (line 31) | def find(self, value): method find_node (line 34) | def find_node(self, current_node, value): method pre_order (line 42) | def pre_order(self): method pre_order_traversal (line 48) | def pre_order_traversal(self, current_node): method in_order (line 57) | def in_order(self): method in_order_traversal (line 63) | def in_order_traversal(self, current_node): method post_order (line 72) | def post_order(self): method post_order_traversal (line 78) | def post_order_traversal(self, current_node): method bfs (line 87) | def bfs(self): FILE: computer_science/data_structures/binary_search_tree_without_node/binary_search_tree.py class BinarySearchTree (line 1) | class BinarySearchTree: method __init__ (line 2) | def __init__(self, value): method insert_node (line 7) | def insert_node(self, value): method find_node (line 17) | def find_node(self, value): method remove_node (line 25) | def remove_node(self, value, parent): method clear_node (line 59) | def clear_node(self): method find_minimum_value (line 64) | def find_minimum_value(self): method pre_order_traversal (line 70) | def pre_order_traversal(self): method in_order_traversal (line 79) | def in_order_traversal(self): method post_order_traversal (line 88) | def post_order_traversal(self): FILE: computer_science/data_structures/binary_tree/BinaryTree/index.js class BinaryTree (line 3) | class BinaryTree { method constructor (line 4) | constructor(value) { method insertLeft (line 10) | insertLeft(value) { method insertRight (line 20) | insertRight(value) { method preOrder (line 30) | preOrder() { method inOrder (line 36) | inOrder() { method postOrder (line 42) | postOrder() { method bfs (line 48) | bfs() { FILE: computer_science/data_structures/binary_tree/binary_tree.py class BinaryTree (line 4) | class BinaryTree: method __init__ (line 5) | def __init__(self, value): method insert_left (line 10) | def insert_left(self, value): method insert_right (line 16) | def insert_right(self, value): method pre_order (line 22) | def pre_order(self): method post_order (line 31) | def post_order(self): method in_order (line 40) | def in_order(self): method bfs (line 49) | def bfs(self): FILE: computer_science/data_structures/graph/AdjacentListGraph/AdjacentListGraph.js function addNode (line 1) | function addNode(AdjacentListGraph, key) { function addEdge (line 5) | function addEdge(AdjacentListGraph, origin, destination) { function bfs (line 10) | function bfs(AdjacentListGraph, vertex) { function dfs (line 27) | function dfs(AdjacentListGraph, vertex, visitedVertices = new Set()) { FILE: computer_science/data_structures/graph/adjacency_list.cpp function main (line 11) | int main() { FILE: computer_science/data_structures/graph/graph.js class Vertex (line 1) | class Vertex { method constructor (line 2) | constructor(key) { method contains (line 7) | contains(key) { class Graph (line 18) | class Graph { method constructor (line 19) | constructor() { method addVertex (line 23) | addVertex(key) { method contains (line 32) | contains(key) { method addEdge (line 42) | addEdge(from, to) { method getVertex (line 64) | getVertex(key) { method print (line 72) | print() { FILE: computer_science/data_structures/graph/graph.py class Graph (line 1) | class Graph: method __init__ (line 2) | def __init__(self): method add_vertex (line 5) | def add_vertex(self, key): method print (line 11) | def print(self): method add_edge (line 17) | def add_edge(self, from_key, to_key): method get_vertex (line 31) | def get_vertex(self, key): method contains (line 36) | def contains(self, vertices, key): class Vertex (line 43) | class Vertex: method __init__ (line 44) | def __init__(self, key): FILE: computer_science/data_structures/hash_table/maps.cpp function main (line 7) | int main() { FILE: computer_science/data_structures/linked_list/linked-list.js class Node (line 1) | class Node { method constructor (line 2) | constructor(value, next = null) { class LinkedList (line 8) | class LinkedList { method constructor (line 9) | constructor() { method pushFront (line 13) | pushFront(value) { method pushBack (line 17) | pushBack(value) { method size (line 32) | size() { method search (line 44) | search(value) { method remove (line 54) | remove(value) { method isEmpty (line 76) | isEmpty() { FILE: computer_science/data_structures/linked_list/linked_list.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self, data): class LinkedList (line 7) | class LinkedList: method __init__ (line 8) | def __init__(self): method is_empty (line 11) | def is_empty(self): method push_front (line 14) | def push_front(self, data): method push_back (line 19) | def push_back(self, data): method size (line 28) | def size(self): method search (line 38) | def search(self, item): method remove (line 46) | def remove(self, item): FILE: computer_science/data_structures/queue/queue.js class Queue (line 1) | class Queue { method constructor (line 2) | constructor() { method enqueue (line 6) | enqueue(item) { method dequeue (line 10) | dequeue() { method isEmpty (line 14) | isEmpty() { method front (line 18) | front() { method back (line 22) | back() { method size (line 26) | size() { FILE: computer_science/data_structures/queue/queue.py class Emptiness (line 11) | class Emptiness(Exception): class Queue (line 15) | class Queue: method __init__ (line 16) | def __init__(self): method enqueue (line 19) | def enqueue(self, item): method dequeue (line 22) | def dequeue(self): method is_empty (line 28) | def is_empty(self): method front (line 31) | def front(self): method back (line 37) | def back(self): method size (line 43) | def size(self): function test_enqueue (line 47) | def test_enqueue(queue, item): function test_dequeue (line 52) | def test_dequeue(queue): function test_emptiness (line 57) | def test_emptiness(queue): function test_size (line 62) | def test_size(queue): function test_front (line 67) | def test_front(queue): function test_back (line 72) | def test_back(queue): FILE: computer_science/data_structures/segment_tree/frequency.cpp function initialize_frequency_map (line 11) | void initialize_frequency_map() { function build_segtree (line 18) | void build_segtree(int node, int start, int end) { function main (line 32) | int main() { FILE: computer_science/data_structures/segment_tree/max.cpp function build_segtree (line 10) | void build_segtree(int node, int start, int end) { function main (line 21) | int main() { FILE: computer_science/data_structures/segment_tree/min.cpp function build_segtree (line 10) | void build_segtree(int node, int start, int end) { function main (line 21) | int main() { FILE: computer_science/data_structures/segment_tree/sum.cpp function build_segtree (line 10) | void build_segtree(int node, int start, int end) { function main (line 21) | int main() { FILE: computer_science/data_structures/set/set.js class Set (line 1) | class Set { method constructor (line 2) | constructor() { method add (line 6) | add(item) { method delete (line 13) | delete(item) { method has (line 22) | has(item) { method clear (line 26) | clear() { method size (line 30) | size() { method values (line 34) | values() { method union (line 38) | union(otherSet) { method intersection (line 47) | intersection(otherSet) { method difference (line 59) | difference(otherSet) { method isSubsetOf (line 71) | isSubsetOf(otherSet) { FILE: computer_science/data_structures/set/sets.cpp function main (line 12) | int main() { FILE: computer_science/data_structures/stack/stack.cpp class Stack (line 7) | class Stack { method Stack (line 13) | Stack() { method push (line 17) | void push(int element) { method pop (line 26) | int pop() { method top (line 35) | int top() { method isEmpty (line 39) | bool isEmpty() { function main (line 44) | int main() { FILE: computer_science/data_structures/stack/stack.py class Emptiness (line 10) | class Emptiness(Exception): class Stack (line 14) | class Stack: method __init__ (line 15) | def __init__(self): method push (line 18) | def push(self, item): method pop (line 21) | def pop(self): method is_empty (line 27) | def is_empty(self): method top (line 30) | def top(self): method size (line 36) | def size(self): function reverse (line 72) | def reverse(bookshelf): FILE: computer_science/data_structures/stack/stack_class.js class Stack (line 1) | class Stack { method constructor (line 2) | constructor() { method push (line 6) | push(item) { method pop (line 10) | pop() { method top (line 14) | top() { method isEmpty (line 18) | isEmpty() { method size (line 22) | size() { function reverse (line 64) | function reverse(list) { FILE: computer_science/data_structures/string/strings.cpp function main (line 6) | int main() {