SYMBOL INDEX (2986 symbols across 852 files) FILE: 2D Arrays (Matrix)/2D_sorted.go function searchMatrix (line 1) | func searchMatrix(matrix [][]int, target int) bool { FILE: 2D Arrays (Matrix)/binary_search.cpp class Solution (line 18) | class Solution { method costumBinarySearch (line 19) | bool costumBinarySearch(const vector>& matrix, int target,... method searchMatrix (line 35) | bool searchMatrix(vector>& matrix, int target) { FILE: 2D Arrays (Matrix)/count_negatives_in_sorted_matrix.cpp class Solution (line 22) | class Solution { method countNegatives (line 24) | int countNegatives(vector>& grid) { FILE: 2D Arrays (Matrix)/matrix_diagonal_sum.cpp class Solution (line 31) | class Solution { method diagonalSum (line 33) | int diagonalSum(vector>& mat) { FILE: 2D Arrays (Matrix)/matrix_wave_print.cpp function wave_print (line 4) | void wave_print(int Mat[][10], int R, int C){ function main (line 18) | int main(){ FILE: 2D Arrays (Matrix)/rotate_matrix.cpp function rotateClockwise (line 19) | void rotateClockwise(vector>& image) { function rotateCounterclockwise (line 33) | void rotateCounterclockwise(vector>& image) { function printImage (line 47) | void printImage(vector>& image) { function main (line 57) | int main() { FILE: 2D Arrays (Matrix)/rotate_matrix.go function rotateClockwise (line 18) | func rotateClockwise(image [][]int) [][]int { function rotateCounterClockwise (line 30) | func rotateCounterClockwise(image [][]int) [][]int { function main (line 42) | func main() { FILE: 2D Arrays (Matrix)/rotate_matrix.java class RotateMatrix (line 11) | public class RotateMatrix { method rotateClockwise (line 14) | public static int[][] rotateClockwise(int[][] matrix) { method rotateAntiClockwise (line 28) | public static int[][] rotateAntiClockwise(int[][] matrix) { method printMatrix (line 42) | public static void printMatrix(int[][] matrix) { method main (line 52) | public static void main(String[] args) { FILE: 2D Arrays (Matrix)/rotate_matrix.js function rotateClockwise (line 13) | function rotateClockwise(matrix) { function rotateAntiClockwise (line 36) | function rotateAntiClockwise(matrix) { FILE: 2D Arrays (Matrix)/rotate_matrix.py function rotate_clockwise (line 14) | def rotate_clockwise(matrix): function rotate_counterclockwise (line 31) | def rotate_counterclockwise(matrix): FILE: 2D Arrays (Matrix)/search_element.cpp class Solution (line 18) | class Solution { method searchMatrix (line 20) | bool searchMatrix(vector> &matrix,int target) { FILE: 2D Arrays (Matrix)/searching_in_sorted_array.cpp function main (line 47) | int main(){ FILE: 2D Arrays (Matrix)/searching_in_sorted_array.java class Solution (line 33) | class Solution method searchMatrix (line 35) | public boolean searchMatrix(int[][] matrix, int target) method main (line 50) | public static void main(String[] args) FILE: 2D Arrays (Matrix)/searching_in_sorted_array.py class Solution (line 45) | class Solution(object): method searchMatrix (line 46) | def searchMatrix(self, matrix, target): FILE: 2D Arrays (Matrix)/set_matrix_0.cpp function setZeroes (line 40) | void setZeroes(vector>& matrix) { function printMatrix (line 64) | void printMatrix(const vector>& matrix) { function main (line 73) | int main() { FILE: 2D Arrays (Matrix)/set_matrix_0.go function setZeroes (line 40) | func setZeroes(matrix [][]int) { function main (line 64) | func main() { function printMatrix (line 80) | func printMatrix(matrix [][]int) { FILE: 2D Arrays (Matrix)/set_matrix_0.java class setMatrixZero (line 44) | public class setMatrixZero { method setZeroes_bruteForce (line 47) | private static void setZeroes_bruteForce(int[][] matrix, int n, int m) { method setZeroes_optimalMethod (line 89) | private static void setZeroes_optimalMethod(int[][] matrix, int n, int... method main (line 127) | public static void main(String[] args) { FILE: 2D Arrays (Matrix)/spiral_traverse.cpp function SpiralTraverse (line 38) | vector SpiralTraverse(vector> array) { function main (line 81) | int main() { FILE: 2D Arrays (Matrix)/spiral_traverse.go function SpiralTraverse (line 36) | func SpiralTraverse(array [][]int) []int { function main (line 83) | func main() { FILE: 2D Arrays (Matrix)/spiral_traverse.java class SpiralTraverse (line 33) | public class SpiralTraverse { method main (line 35) | public static void main(String[] args) { method spiralFillUsingLoop (line 45) | public static List spiralFillUsingLoop(int[][] array) { method spiralFillUsingRecursion (line 109) | public static void spiralFillUsingRecursion( FILE: 2D Arrays (Matrix)/spiral_traverse.py function spiralOrder (line 52) | def spiralOrder(matrix): FILE: 2D Arrays (Matrix)/zigzag_traversal.cpp function ZigzagTraverse (line 56) | vector ZigzagTraverse(vector>& array) { function isOutOfBounds (line 118) | bool isOutOfBounds(int row, int col, int height, int width) { FILE: 2D Arrays (Matrix)/zigzag_traversal.go function ZigzagTraverse (line 54) | func ZigzagTraverse(array [][]int) []int { function isOutOfBounds (line 114) | func isOutOfBounds(row, col, height, width int) bool { FILE: 2D Arrays (Matrix)/zigzag_traversal.java class Main (line 54) | public class Main { method ZigzagTraverse (line 56) | public static List ZigzagTraverse(int[][] array) { method isOutOfBounds (line 118) | public static boolean isOutOfBounds(int row, int col, int height, int ... method main (line 123) | public static void main(String[] args) { FILE: 2D Arrays (Matrix)/zigzag_traversal.js function ZigzagTraverse (line 51) | function ZigzagTraverse(array) { function isOutOfBounds (line 113) | function isOutOfBounds(row, col, height, width) { FILE: 2D Arrays (Matrix)/zigzag_traversal.py function ZigzagTraverse (line 52) | def ZigzagTraverse(array): function isOutOfBounds (line 106) | def isOutOfBounds(row, col, height, width): FILE: Arrays/Jobassign.cpp function main (line 8) | int main() { function hungarianAlgorithm (line 21) | void hungarianAlgorithm(int costMatrix[N][N]) { FILE: Arrays/Rotatedarr.cpp class Solution (line 1) | class Solution { method search (line 3) | int search(std::vector& nums, int target) { FILE: Arrays/array_of_products.cpp function ArrayOfProducts (line 42) | vector ArrayOfProducts(vector& array) { function main (line 65) | int main() { FILE: Arrays/array_of_products.go function ArrayOfProducts (line 39) | func ArrayOfProducts(array []int) []int { FILE: Arrays/array_of_products.java class ArrayOfProducts (line 36) | public class ArrayOfProducts { method arrayOfProducts (line 37) | public static int[] arrayOfProducts(int[] array) { method main (line 60) | public static void main(String[] args) { FILE: Arrays/array_of_products.js function arrayOfProducts (line 34) | function arrayOfProducts(array) { FILE: Arrays/array_of_products.py function array_of_products (line 34) | def array_of_products(array): FILE: Arrays/ceaser_cipher.cpp function string (line 52) | string CaesarCipherEncryptor(string str, int key) { function main (line 75) | int main() { FILE: Arrays/ceaser_cipher.go function CaesarCipherEncryptor (line 50) | func CaesarCipherEncryptor(str string, key int) string { FILE: Arrays/ceaser_cipher.java class CaesarCipherEncryptor (line 49) | public class CaesarCipherEncryptor { method encrypt (line 51) | public static String encrypt(String str, int key) { method main (line 74) | public static void main(String[] args) { FILE: Arrays/ceaser_cipher.js function caesarCipherEncryptor (line 45) | function caesarCipherEncryptor(str, key) { FILE: Arrays/ceaser_cipher.py function caesar_cipher_encryptor (line 47) | def caesar_cipher_encryptor(str, key): FILE: Arrays/dutch_national_flag.cpp function sortColors (line 45) | void sortColors(vector &nums) function main (line 68) | int main() FILE: Arrays/dutch_national_flag.go function sortColors (line 42) | func sortColors(nums []int) { function main (line 64) | func main() { FILE: Arrays/dutch_national_flag.java class Main (line 38) | public class Main { method sortColors (line 39) | public static void sortColors(int[] nums) { method main (line 65) | public static void main(String[] args) { FILE: Arrays/dutch_national_flag.js function sortColors (line 38) | function sortColors(nums) { FILE: Arrays/dutch_national_flag.py function sortColors (line 38) | def sortColors(nums): FILE: Arrays/find_three_largest_integers.js function findThreeLargestNumbers (line 34) | function findThreeLargestNumbers(array) { function updateLargest (line 48) | function updateLargest(triplets, num) { function shiftAndUpdate (line 66) | function shiftAndUpdate(triplets, num, idx) { FILE: Arrays/find_three_largest_number.cpp function main (line 49) | int main() { function findThreeLargestNumbers (line 64) | vector findThreeLargestNumbers(vector& array) { function updateLargest (line 77) | void updateLargest(vector& triplets, int num) { function shiftAndUpdate (line 90) | void shiftAndUpdate(vector& triplets, int num, int idx) { FILE: Arrays/find_three_largest_numbers.go function FindThreeLargestNumbers (line 39) | func FindThreeLargestNumbers(array []int) []int { function updateLargest (line 50) | func updateLargest(triplets []int, num int) { function shiftAndUpdate (line 64) | func shiftAndUpdate(triplets []int, num int, idx int) { FILE: Arrays/find_three_largest_numbers.java class Main (line 37) | public class Main { method findThreeLargestNumbers (line 39) | public static int[] findThreeLargestNumbers(int[] array) { method updateLargest (line 54) | private static void updateLargest(int[] triplets, int num) { method shiftAndUpdate (line 73) | private static void shiftAndUpdate(int[] triplets, int num, int idx) { method main (line 88) | public static void main(String[] args) { FILE: Arrays/find_three_largest_numbers.py function find_three_largest_numbers (line 35) | def find_three_largest_numbers(array): function update_largest (line 48) | def update_largest(triplets, num): function shift_and_update (line 63) | def shift_and_update(triplets, num, idx): FILE: Arrays/first_duplicate_value.cpp class Solution (line 14) | class Solution{ method findDuplicate1 (line 17) | int findDuplicate1(vector& nums) method findDuplicate2 (line 33) | int findDuplicate2(vector& nums) FILE: Arrays/first_duplicate_value.go function FirstDuplicateValue (line 41) | func FirstDuplicateValue(array []int) int { function FirstDuplicateValue2 (line 83) | func FirstDuplicateValue2(array []int) int { function abs (line 104) | func abs(num int) int { function main (line 111) | func main() { FILE: Arrays/first_duplicate_value.java method findDuplicate (line 18) | public static int findDuplicate(int[] nums) { method findDuplicate (line 37) | public static int findDuplicate(int[] nums) { FILE: Arrays/first_duplicate_value.js function findFirstDuplicate (line 17) | function findFirstDuplicate(nums){ function findFirstDuplicate (line 37) | function findFirstDuplicate(nums){ FILE: Arrays/first_duplicate_value.py function find_duplicate (line 13) | def find_duplicate(nums): FILE: Arrays/four_sum.py class Solution (line 39) | class Solution: method fourSum (line 40) | def fourSum(self, nums: List[int], target: int) -> List[List[int]]: FILE: Arrays/insert_interval.cpp type Interval (line 44) | struct Interval { method Interval (line 48) | Interval(int s, int e) : start(s), end(e) {} function insertInterval (line 51) | vector insertInterval(vector& intervals, Interval ne... function printIntervals (line 84) | void printIntervals(const vector& intervals) { function main (line 91) | int main() { FILE: Arrays/insert_interval.go type Interval (line 45) | type Interval struct function insert (line 51) | func insert(intervals []Interval, newInterval Interval) []Interval { function min (line 81) | func min(a, b int) int { function max (line 89) | func max(a, b int) int { function main (line 96) | func main() { FILE: Arrays/insert_interval.java class Interval (line 41) | class Interval { method Interval (line 45) | Interval(int start, int end) { class InsertInterval (line 51) | public class InsertInterval { method insertInterval (line 52) | public static List insertInterval(List intervals, ... method printIntervals (line 85) | public static void printIntervals(List intervals) { method main (line 92) | public static void main(String[] args) { FILE: Arrays/insert_interval.js class Interval (line 38) | class Interval { method constructor (line 39) | constructor(start, end) { function insertInterval (line 45) | function insertInterval(intervals, newInterval) { FILE: Arrays/insert_interval.py class Interval (line 38) | class Interval: method __init__ (line 39) | def __init__(self, start, end): function insertInterval (line 43) | def insertInterval(intervals, newInterval): FILE: Arrays/insert_intervals.cpp class Solution (line 14) | class Solution { method insert (line 16) | vector> insert(vector>& intervals, vector... FILE: Arrays/insert_intervals.go function insert (line 53) | func insert(intervals [][]int, newInterval []int) [][]int { function main (line 85) | func main() { FILE: Arrays/is_monotonic.cpp function IsMonotonic (line 25) | bool IsMonotonic(vector& array) { function main (line 45) | int main() { FILE: Arrays/is_monotonic.go function IsMonotonic (line 25) | func IsMonotonic(array []int) bool { function main (line 44) | func main() { FILE: Arrays/is_monotonic.java class Main (line 20) | public class Main { method isMonotonic (line 21) | public static boolean isMonotonic(int[] array) { method main (line 38) | public static void main(String[] args) { FILE: Arrays/is_monotonic.js function isMonotonic (line 20) | function isMonotonic(array) { FILE: Arrays/is_monotonic.py function is_monotonic (line 20) | def is_monotonic(array): FILE: Arrays/longest_peak.cpp function LongestPeak (line 37) | int LongestPeak(std::vector& array) { FILE: Arrays/longest_peak.go function LongestPeak (line 40) | func LongestPeak(array []int) int { function main (line 78) | func main() { FILE: Arrays/longest_peak.js function longestPeak (line 35) | function longestPeak(array) { FILE: Arrays/longest_peak.py function longest_peak (line 37) | def longest_peak(array): function longestPeak (line 82) | def longestPeak(arr: list) -> int: FILE: Arrays/majority_element.go function MajorityElement (line 72) | func MajorityElement(nums []int) int { function main (line 87) | func main() { FILE: Arrays/majority_element.java class Solution (line 15) | class Solution { method majorityElement (line 16) | public int majorityElement(int[] nums) { FILE: Arrays/maximum_subarray_sum.cpp function maxSubArraySum (line 38) | int maxSubArraySum(vector& nums) { function maxSubarraySumBruteForce (line 63) | int maxSubarraySumBruteForce(vector& nums) { function main (line 80) | int main() { FILE: Arrays/maximum_subarray_sum.go function maxSubarraySum (line 42) | func maxSubarraySum(arr []int) int { function maxSubarraySumBruteForce (line 66) | func maxSubarraySumBruteForce(nums []int) int { function main (line 89) | func main() { FILE: Arrays/maximum_subarray_sum.py function max_subarray_sum (line 27) | def max_subarray_sum(arr): FILE: Arrays/merge_intervals.cpp class Solution (line 12) | class Solution { method merge (line 14) | vector> merge(vector>& intervals) { FILE: Arrays/merge_intervals.go function MergeOverlappingIntervals (line 32) | func MergeOverlappingIntervals(intervals [][]int) [][]int { function max (line 81) | func max(a, b int) int { FILE: Arrays/merge_intervals.js function merge (line 35) | function merge(intervals) { FILE: Arrays/merge_intervals.py class Solution (line 34) | class Solution(object): method mergeIntervals (line 35) | def mergeIntervals(self, Intervals): FILE: Arrays/merge_sorted_array.cpp function merge (line 27) | void merge( vector < int > & nums1 , int m , vector< int > & nums2 , int... function merge (line 53) | void merge( vector< int > & nums1 , int m , vector< int > & nums2 , int ... FILE: Arrays/merge_sorted_array.java class merge_sorted_array (line 13) | class merge_sorted_array{ method merge (line 15) | public void merge(int[] nums1, int m, int[] nums2, int n){ method main (line 27) | public static void main(String[] args){ FILE: Arrays/merge_sorted_arrays.py class Solution (line 1) | class Solution: method merge (line 2) | def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) ->... FILE: Arrays/minimum_size_subarray_sum.java class MinimumSizeSubarraySum (line 29) | public class MinimumSizeSubarraySum { method main (line 30) | public static void main(String[] args) { method solve (line 37) | public static int solve(int[] nums, int target) { FILE: Arrays/move_element_to_end.cpp function MoveElementToEnd (line 25) | std::vector MoveElementToEnd(std::vector& array, int toMove) { FILE: Arrays/move_element_to_end.go function MoveElementToEnd (line 25) | func MoveElementToEnd(array []int, toMove int) []int { FILE: Arrays/move_element_to_end.java class MoveElementToEnd (line 26) | public class MoveElementToEnd { method moveElementToEnd (line 27) | public static List moveElementToEnd(List array, int ... FILE: Arrays/move_element_to_end.js function moveElementToEnd (line 23) | function moveElementToEnd(array, toMove) { FILE: Arrays/move_element_to_end.py function move_element_to_end (line 23) | def move_element_to_end(array, to_move): FILE: Arrays/non-overlapping intervals.cpp class Solution (line 26) | class Solution { method eraseOverlapIntervals (line 28) | int eraseOverlapIntervals(vector>& intervals) { FILE: Arrays/pallindromic_permutations.cpp function is_permutation_pallindrome (line 6) | bool is_permutation_pallindrome(string s){ function is_permutation_pallindrome_improved (line 25) | bool is_permutation_pallindrome_improved(string s){ function print_ans (line 43) | void print_ans(bool ans){ function main (line 51) | int main(){ FILE: Arrays/sign_of_the_product_of_an_array.cpp function arraySign (line 60) | int arraySign(vector &nums) function main (line 81) | int main() FILE: Arrays/smallest_difference.cpp function SmallestDifference (line 37) | vector SmallestDifference(vector array1, vector array2) { function main (line 73) | int main() { FILE: Arrays/smallest_difference.go function SmallestDifference (line 46) | func SmallestDifference(array1, array2 []int) []int { FILE: Arrays/smallest_difference.java class Main (line 38) | public class Main { method smallestDifference (line 40) | public static int[] smallestDifference(int[] array1, int[] array2) { method main (line 86) | public static void main(String[] args) { FILE: Arrays/smallest_difference.js function smallestDifference (line 32) | function smallestDifference(array1, array2) { FILE: Arrays/smallest_difference.py function smallest_difference (line 26) | def smallest_difference(array1: List[int], array2: List[int]) -> List[int]: function main (line 75) | def main(): FILE: Arrays/sorted_square_array.cpp function sortedSquaredArray (line 42) | std::vector sortedSquaredArray(std::vector& array) { function main (line 71) | int main() { FILE: Arrays/sorted_square_array.go function SortedSquaredArray (line 43) | func SortedSquaredArray(array []int) []int { function main (line 69) | func main() { FILE: Arrays/sorted_square_array.java class Main (line 41) | public class Main { method sortedSquaredArray (line 43) | public static int[] sortedSquaredArray(int[] array) { method main (line 72) | public static void main(String[] args) { FILE: Arrays/sorted_square_array.py function sortedSquaredArray (line 39) | def sortedSquaredArray(array): FILE: Arrays/string_halves.cpp class Solution (line 31) | class Solution { method halvesAreAlike (line 33) | bool halvesAreAlike(string s) { FILE: Arrays/three_largest_no.py function three_max_no (line 21) | def three_max_no(arr:list)-> list: FILE: Arrays/total_hamming_distance.cpp function totalHammingDistance (line 80) | int totalHammingDistance(vector& nums) { function main (line 96) | int main() FILE: Arrays/tournament_winner.go constant HOME_TEAM_WON (line 44) | HOME_TEAM_WON = 1 constant AWAY_TEAM_WON (line 45) | AWAY_TEAM_WON = 0 function TournamentWinner (line 47) | func TournamentWinner(competitions [][]string, results []int) string { function main (line 74) | func main() { FILE: Arrays/triplet_sum.cpp function threeNumberSum (line 21) | std::vector> threeNumberSum(std::vector& nums, int... function main (line 56) | int main() { FILE: Arrays/triplet_sum.go function findSumOfThree (line 18) | func findSumOfThree(nums []int, target int) bool { function main (line 55) | func main() { FILE: Arrays/triplet_sum.java class ThreeNumberSum (line 23) | public class ThreeNumberSum { method threeNumberSum (line 25) | public static List> threeNumberSum(int[] nums, int targe... method main (line 58) | public static void main(String[] args) { FILE: Arrays/triplet_sum.py function find3Numbers (line 7) | def find3Numbers(A, arr_size, sum): FILE: Arrays/urlify.go function Urlify (line 9) | func Urlify(s string, length int) string { function main (line 41) | func main() { FILE: Backtracking/Generate_Parentheses.py class Solution (line 13) | class Solution: method generate (line 17) | def generate(self,n,open,close,s,final_arr): method generateParenthesis (line 26) | def generateParenthesis(self, n: int) -> List[str]: FILE: Backtracking/geenrate_parentheses.go function generateParenthesis (line 50) | func generateParenthesis(n int) []string { function backtrack (line 57) | func backtrack(result *[]string, cur string, open int, close int, max in... function main (line 75) | func main() { FILE: Backtracking/n_queen.cpp function isSafe (line 7) | bool isSafe(vector& board, int row, int col, int N) { function solveNQueens (line 33) | bool solveNQueens(vector& board, int col, int N) { function solveNQueens (line 59) | void solveNQueens(int N) { function main (line 72) | int main() { FILE: Backtracking/n_queens.java class Solution (line 32) | class Solution { method solveNQueens (line 33) | public List> solveNQueens(int n) { method queens (line 56) | static void queens(boolean board[][], int row, List> list) { method isSafe (line 86) | private static boolean isSafe(boolean[][] board, int row, int col) { FILE: Backtracking/sudoko_solver.java class sudokoSolver (line 22) | public class sudokoSolver { method solveSudoku (line 25) | public void solveSudoku(char[][] board) { method Solver (line 29) | static boolean Solver(char[][] board , int total) method print (line 57) | static void print(char[][] board) method canElementBePlaced (line 69) | static boolean canElementBePlaced(char[][] board , int r , int c , cha... FILE: Binary Search/BinarySearchRecursive.java class BinarySearchRecursive (line 22) | public class BinarySearchRecursive { method main (line 24) | public static void main(String[] args) { method binarySearch (line 30) | static int binarySearch(int[] arr ,int target, int start , int end) { FILE: Binary Search/binary_search.cpp function binarySearch (line 22) | int binarySearch(vector arr, int target) { function main (line 49) | int main() { FILE: Binary Search/binary_search.py function binary_search (line 22) | def binary_search(lst, target): FILE: Binary Search/binary_search_iterative.go function BinarySearch (line 15) | func BinarySearch(array []int, target int) int { function main (line 39) | func main() { FILE: Binary Search/binary_search_recursive.go function BinarySearchRecursive (line 19) | func BinarySearchRecursive(Arr []int, key int) bool { function main (line 35) | func main() { FILE: Binary Search/binary_serach_first_and_last_occurence.py class Solution (line 1) | class Solution: method __init__ (line 2) | def __init__(self): method binarySearchLast (line 21) | def binarySearchLast(self,arr,low,high,target): method searchRange (line 33) | def searchRange(self, nums: List[int], target: int) -> List[int]: FILE: Binary Search/first_and_last_pos_of_element.cpp class Solution (line 33) | class Solution { method get_index (line 35) | int get_index(vector& nums, int target, bool found){ method searchRange (line 58) | vector searchRange(vector& nums, int target) { FILE: Binary Search/first_and_last_position.java class FirstandLastPosition (line 21) | class FirstandLastPosition { method searchRange (line 22) | public int[] searchRange(int[] nums, int target) { method firstPos (line 33) | private int firstPos(int[] arr,int target){ method lastPos (line 51) | private int lastPos(int[] arr,int target,int low){ FILE: Binary Search/first_last_pos.java class FirstLastPos (line 18) | public class FirstLastPos{ method firstOccurence (line 19) | public static int firstOccurence(int[] arr,int target){ method lastOccurence (line 41) | public static int lastOccurence(int[] arr,int target){ method main (line 63) | public static void main(String[] args){ FILE: Binary Search/first_occurance.go function FirstOccurance (line 9) | func FirstOccurance(Arr []int, key int) int { function main (line 26) | func main() { FILE: Binary Search/first_occurence.java class FirstOccurence (line 27) | public class FirstOccurence{ method firstOccurence (line 28) | public static int firstOccurence(int[] arr,int target){ method main (line 50) | public static void main(String[] args){ FILE: Binary Search/first_true.cpp function findBoundary (line 14) | int findBoundary(std::vector& arr) { function main (line 39) | int main() { FILE: Binary Search/first_true.go function findBoundary (line 18) | func findBoundary(arr []bool) int { function main (line 43) | func main() { FILE: Binary Search/first_true.java class Solution (line 16) | class Solution { method findBoundary (line 17) | public static int findBoundary(List arr) { FILE: Binary Search/first_true.js function findBoundary (line 11) | function findBoundary(arr) { FILE: Binary Search/first_true.py function findBoundary (line 11) | def findBoundary(arr): FILE: Binary Search/floor_of_target.java class FloorOfTarget (line 19) | public class FloorOfTarget{ method search_floor (line 21) | public static int search_floor(int[] nums,int target){ method main (line 37) | public static void main(String[] args){ FILE: Binary Search/index_position.java class IndexPosition (line 17) | public class IndexPosition { method search (line 20) | public static int search(int[] nums, int target) { method main (line 39) | public static void main(String[] args){ FILE: Binary Search/infinity_array.java class InfinityArray (line 15) | public class InfinityArray { method main (line 16) | public static void main(String[] args){ method range (line 22) | public static int range(int[] nums,int target){ method search (line 31) | public static int search(int[] nums, int target,int start,int end) { FILE: Binary Search/last_occurance.go function LastOccurance (line 9) | func LastOccurance(Arr []int, key int) int { function main (line 26) | func main() { FILE: Binary Search/median_of_two_sorted_arrays.cpp class Solution (line 32) | class Solution { method findMedianSortedArrays (line 34) | double findMedianSortedArrays(std::vector& nums1, std::vector& nums) { FILE: Binary Search/perfect_square.java class PerfectSquare (line 23) | class PerfectSquare { method isPerfectSquare (line 24) | public static boolean isPerfectSquare(int num) { method main (line 41) | public static void main(String[] args){ FILE: Binary Search/search_in_rotated_sorted_array.cpp class Solution (line 31) | class Solution { method search (line 33) | int search(vector& nums, int target) { FILE: Binary Search/search_in_sorted_rotated_array.cpp class Solution (line 31) | class Solution { method search (line 33) | int search(vector& nums, int target) { FILE: Binary Search/search_in_sorted_rotated_array.go function SearchInSortedMatrix (line 33) | func SearchInSortedMatrix(matrix [][]int, target int) []int { function main (line 57) | func main() { FILE: Binary Search/search_in_sorted_rotated_array.java class searchInRotatedArray (line 26) | public class searchInRotatedArray { method searchTarget (line 30) | public static int searchTarget(int nums[] , int target) method search (line 44) | public static int search(int nums[], int l, int h, int target) method main (line 92) | public static void main(String[] args) FILE: Binary Search/search_in_sorted_rotated_array.py class Solution (line 25) | class Solution: method binarySearch (line 26) | def binarySearch(nums,low,high,target): method search (line 37) | def search(self, nums: List[int], target: int) -> int: FILE: Binary Search/search_insert_position.js function findSearchPosition (line 30) | function findSearchPosition(nums, target) { FILE: Binary Search/square_root.java class SquareRoot (line 21) | public class SquareRoot{ method sqrt (line 22) | public static int sqrt(int x){ method main (line 39) | public static void main(String[] args){ FILE: Bit Manipulation/bloom_filter.cpp function h1 (line 30) | int h1(std::string s, int arrSize) function h2 (line 43) | int h2(std::string s, int arrSize) function h3 (line 56) | int h3(std::string s, int arrSize) function h4 (line 68) | int h4(std::string s, int arrSize) function lookup (line 82) | bool lookup(std::bitset<1000000> &bitarray, std::string s) function insert (line 94) | void insert(std::bitset<1000000> &bitarray, std::string s) function main (line 117) | int main() FILE: Bit Manipulation/bloom_filter.py class BloomFilter (line 32) | class BloomFilter: method __init__ (line 33) | def __init__(self, capacity, false_positive_rate): method calculate_size (line 41) | def calculate_size(self): method calculate_num_hashes (line 47) | def calculate_num_hashes(self): method add (line 52) | def add(self, item): method contains (line 59) | def contains(self, item): FILE: Bit Manipulation/count_bits.go function CountBits (line 12) | func CountBits(x int) (int, error) { function main (line 24) | func main() { FILE: Bit Manipulation/interesting_array.java class InterestingArray (line 5) | public class InterestingArray { method main (line 6) | public static void main(String[] args) { method solve (line 16) | public static String solve(int[] array) { FILE: Bit Manipulation/mod_array.java class ModArray (line 98) | public class ModArray { method main (line 99) | public static void main(String[] args) { method solve (line 105) | public static int solve(int[] array, int divisor) { FILE: Bit Manipulation/number_of_1_bits.java class NumberOf1Bits (line 40) | public class NumberOf1Bits { method main (line 41) | public static void main(String[] args) { method solve (line 46) | public static int solve(int num) { FILE: Bit Manipulation/parity_of_a_word.go function Parity (line 17) | func Parity(x int) int { function ParityImproved (line 26) | func ParityImproved(x int) int { function main (line 36) | func main() { FILE: Bit Manipulation/power_of_2.cpp class Solution (line 29) | class Solution { method isPowerOfTwo (line 31) | bool isPowerOfTwo(int n) { FILE: Bit Manipulation/reduce_to_zero.cpp class Solution (line 40) | class Solution { method numberOfSteps (line 42) | int numberOfSteps (int num) { FILE: Bit Manipulation/setbits.cpp function find_set_bits (line 7) | int find_set_bits(int n){ function main (line 15) | int main(){ FILE: Bit Manipulation/single_number.java class SingleNumber (line 55) | public class SingleNumber { method main (line 56) | public static void main(String[] args) { method solve (line 65) | public static int solve(int[] array) { FILE: Bit Manipulation/subarrays_with_bitwise_OR_1.java class subArrayWithBitwiseOR1 (line 46) | public class subArrayWithBitwiseOR1 { method main (line 47) | public static void main(String[] args) { method solve (line 53) | public static int solve(int[] array, int len) { FILE: Dynamic Programming/best_time_to_buy_and_sell_stock.cpp function maxProfit (line 22) | int maxProfit(vector& prices) { function main (line 34) | int main() { FILE: Dynamic Programming/best_time_to_buy_and_sell_stock.go function maxProfit (line 23) | func maxProfit(prices []int) int { function main (line 36) | func main() { FILE: Dynamic Programming/best_time_to_buy_and_sell_stock.java class Solution (line 16) | public class Solution { method maxProfit (line 17) | public int maxProfit(int[] prices) { method main (line 37) | public static void main(String[] args) { FILE: Dynamic Programming/best_time_to_buy_and_sell_stock.py function maxProfit (line 20) | def maxProfit(prices: List[int]) -> int: FILE: Dynamic Programming/climb_stairs.cpp function climbStairs (line 9) | int climbStairs(int n) { function climbStairsVariation (line 28) | int climbStairsVariation(int n) { function main (line 45) | int main() { FILE: Dynamic Programming/climb_stairs.go function ClimbStairs (line 10) | func ClimbStairs(n int) int { function ClimbStairs2 (line 28) | func ClimbStairs2(n int) int { function main (line 42) | func main() { FILE: Dynamic Programming/climb_stairs.java class StairClimbing (line 3) | public class StairClimbing { method climbStairs (line 7) | public static int climbStairs(int n) { method climbStairsVariation (line 26) | public static int climbStairsVariation(int n) { method main (line 43) | public static void main(String[] args) { FILE: Dynamic Programming/climb_stairs.js function climbStairs (line 7) | function climbStairs(n) { function climbStairsVariation (line 26) | function climbStairsVariation(n) { FILE: Dynamic Programming/climb_stairs.py function climb_stairs (line 8) | def climb_stairs(n): function climb_stairs_variation (line 23) | def climb_stairs_variation(n): FILE: Dynamic Programming/coin_change.cpp function coinChange (line 33) | int coinChange(vector& coins, int amount) { function main (line 60) | int main() { FILE: Dynamic Programming/coin_change.go function coinChange (line 38) | func coinChange(coins []int, amount int) int { function min (line 71) | func min(a, b int) int { function main (line 78) | func main() { FILE: Dynamic Programming/coin_change.java class Solution (line 52) | class Solution { method coinChange (line 53) | public int coinChange(int[] coins, int amount) { FILE: Dynamic Programming/coin_change.py function coin_change (line 21) | def coin_change(coins, amount): FILE: Dynamic Programming/dice_throws.go function DiceThrows (line 51) | func DiceThrows(numDice int, numSides int, target int) int { function diceThrowsHelper (line 67) | func diceThrowsHelper(numDice, numSides, target int, storedResults [][]i... function max (line 99) | func max(a, b int) int { FILE: Dynamic Programming/disk_stacking.go type Disk (line 67) | type Disk type Disks (line 70) | type Disks method Len (line 73) | func (disks Disks) Len() int { return len(disks) } method Swap (line 74) | func (disks Disks) Swap(i, j int) { disks[i], disks[j] = disks[j]... method Less (line 75) | func (disks Disks) Less(i, j int) bool { return disks[i][2] < disks[j]... function DiskStacking (line 78) | func DiskStacking(input [][]int) [][]int { function areValidDimensions (line 127) | func areValidDimensions(o Disk, c Disk) bool { function buildSequence (line 132) | func buildSequence(disks []Disk, sequences []int, index int) [][]int { function reverse (line 144) | func reverse(numbers [][]int) { FILE: Dynamic Programming/disk_stacking.py function DiskStacking (line 62) | def DiskStacking(disks): function are_valid_dimensions (line 89) | def are_valid_dimensions(other_disk, current_disk): function build_sequence (line 93) | def build_sequence(disks, sequences, index): FILE: Dynamic Programming/distance_of_nearest_0.cpp class Solution (line 59) | class Solution method updateMatrix (line 62) | vector> updateMatrix(vector> &mat) function main (line 114) | int main() FILE: Dynamic Programming/distance_of_nearest_0.py class Solution (line 49) | class Solution: method updateMatrix (line 50) | def updateMatrix(self, mat: List[List[int]]) -> List[List[int]]: FILE: Dynamic Programming/distane_of_nearest_0.go function updateMatrix (line 30) | func updateMatrix(mat [][]int) [][]int { FILE: Dynamic Programming/distane_of_nearest_0.java class Solution (line 23) | class Solution { method updateMatrix (line 26) | public int[][] updateMatrix(int[][] mat) { FILE: Dynamic Programming/distane_of_nearest_0.js function updateMatrix (line 23) | function updateMatrix(mat) { FILE: Dynamic Programming/edit_distance_dp.cpp function find_edit_distance (line 18) | int find_edit_distance(string s1, string s2, int l1, int l2){ function main (line 55) | int main(){ FILE: Dynamic Programming/edit_distance_dp.go function findEditDistance (line 20) | func findEditDistance(s1, s2 string) int { function main (line 62) | func main() { FILE: Dynamic Programming/edit_distance_dp.java class EditDistance (line 13) | public class EditDistance { method findEditDistance (line 16) | public static int findEditDistance(String s1, String s2) { method main (line 56) | public static void main(String[] args) { FILE: Dynamic Programming/edit_distance_dp.js function findEditDistance (line 14) | function findEditDistance(s1, s2) { FILE: Dynamic Programming/edit_distance_dp.py function find_edit_distance (line 15) | def find_edit_distance(s1, s2): FILE: Dynamic Programming/edit_distance_memoized.cpp function find_edit_distance (line 18) | int find_edit_distance(string s1, string s2, int l1, int l2){ function main (line 34) | int main(){ FILE: Dynamic Programming/edit_distance_recursive.cpp function find_edit_distance (line 17) | int find_edit_distance(string s1, string s2, int l1, int l2){ function main (line 31) | int main(){ FILE: Dynamic Programming/house_robber.cpp class Solution (line 30) | class Solution { method rob (line 32) | int rob(vector& nums) { FILE: Dynamic Programming/juice_bottling.cpp function juiceBottling (line 33) | std::vector juiceBottling(std::vector& prices) { function main (line 65) | int main() { FILE: Dynamic Programming/juice_bottling.go function JuiceBottling (line 31) | func JuiceBottling(prices []int) []int { FILE: Dynamic Programming/juice_bottling.java class JuiceBottling (line 33) | public class JuiceBottling { method juiceBottling (line 35) | public static List juiceBottling(int[] prices) { method main (line 67) | public static void main(String[] args) { FILE: Dynamic Programming/juice_bottling.js function juiceBottling (line 29) | function juiceBottling(prices) { FILE: Dynamic Programming/juice_bottling.py function juice_bottling (line 28) | def juice_bottling(prices): FILE: Dynamic Programming/knapsack.cpp function knapsackProblem (line 75) | vector knapsackProblem(vector>& items, int capacity) { function getKnapSackItems (line 112) | vector getKnapSackItems(vector>& values, vector knapsackProblem(int[][] items, int capacity) { method getKnapSackItems (line 112) | private static List getKnapSackItems(int[][] values, int[][] ... method max (line 143) | private static int max(int a, int b) { method reverseList (line 148) | private static void reverseList(List list) { FILE: Dynamic Programming/knapsack.js function KnapsackProblem (line 70) | function KnapsackProblem(items, capacity) { function getKnapSackItems (line 110) | function getKnapSackItems(values, items) { function max (line 141) | function max(a, b) { FILE: Dynamic Programming/knapsack.py function knapsack_problem (line 70) | def knapsack_problem(items, capacity): function get_knapsack_items (line 101) | def get_knapsack_items(values, items): FILE: Dynamic Programming/knight_probability_chessboard.cpp class Solution (line 32) | class Solution { method knightProbability (line 34) | double knightProbability(int n, int k, int row, int column) { method dfs (line 42) | double dfs(int n, int k, int row, int column, vector ... FILE: Dynamic Programming/kth_closest_point_to origin.java class Solution (line 51) | class Solution { method kClosest (line 53) | public int[][] kClosest(int[][] points, int k) { FILE: Dynamic Programming/largest_rectangle.java class Solution (line 44) | public class Solution { method maxArea (line 45) | public static int maxArea(int[][] matrix, int rows, int cols) { method main (line 77) | public static void main(String[] args) { FILE: Dynamic Programming/largest_rectangle.py class Solution (line 42) | class Solution: method maxArea (line 43) | def maxArea(self,matrix, rows, cols): FILE: Dynamic Programming/longest_common_subsequence_dp.cpp function find_longest_common_subsequence (line 7) | int find_longest_common_subsequence(string a, string b, int n, int m, in... function main (line 30) | int main(){ FILE: Dynamic Programming/longest_common_subsequence_memoization.cpp function get_max (line 14) | int get_max(int x, int y){ function find_longest_common_subsequence (line 17) | int find_longest_common_subsequence(string a, string b, int n, int m, in... function main (line 35) | int main(){ FILE: Dynamic Programming/longest_common_subsequence_recursive.cpp function get_max (line 11) | int get_max(int x, int y){ function find_longest_common_subsequence (line 14) | int find_longest_common_subsequence(string a, string b, int n, int m){ function main (line 32) | int main(){ FILE: Dynamic Programming/longest_increasing_subsequence.cpp function find_longest_increasing_subsequence (line 11) | int find_longest_increasing_subsequence(vector V, int n){ function main (line 26) | int main(){ FILE: Dynamic Programming/longest_pallindromic_substring.cpp function longestPalindromicSubstring (line 23) | int longestPalindromicSubstring(const std::string& Array) { function main (line 57) | int main() { FILE: Dynamic Programming/longest_pallindromic_substring.go function LongestPalindromicSubstring (line 25) | func LongestPalindromicSubstring(Array string) int { function main (line 63) | func main() { FILE: Dynamic Programming/longest_pallindromic_substring.java class LongestPalindromicSubstring (line 18) | public class LongestPalindromicSubstring { method longestPalindromicSubstring (line 20) | public static int longestPalindromicSubstring(String Array) { method main (line 54) | public static void main(String[] args) { FILE: Dynamic Programming/longest_pallindromic_substring.js function longestPalindromicSubstring (line 18) | function longestPalindromicSubstring(Array) { FILE: Dynamic Programming/longest_pallindromic_substring.py function longest_palindromic_substring (line 18) | def longest_palindromic_substring(Array): FILE: Dynamic Programming/max_path_sum.go type treenode (line 38) | type treenode struct function pathMaxSum (line 45) | func pathMaxSum(root *treenode) int{ function findMaxSum (line 52) | func findMaxSum(node *treenode, maxSum *int) int { function max (line 67) | func max(a,b int) int { function main (line 74) | func main() { FILE: Dynamic Programming/max_sum_increasing_subsequence.cpp function MaxSumIncreasingSubsequence (line 35) | std::pair> MaxSumIncreasingSubsequence(std::vector... FILE: Dynamic Programming/max_sum_increasing_subsequence.go function MaxSumIncreasingSubsequence (line 36) | func MaxSumIncreasingSubsequence(array []int) (int, []int) { function buildSequence (line 76) | func buildSequence(array []int, sequences []int, index int) []int { function reverse (line 94) | func reverse(numbers []int) { FILE: Dynamic Programming/max_sum_increasing_subsequence.java class Main (line 35) | public class Main { method maxSumIncreasingSubsequence (line 36) | public static int[] maxSumIncreasingSubsequence(int[] array) { method main (line 76) | public static void main(String[] args) { FILE: Dynamic Programming/max_sum_increasing_subsequence.js function maxSumIncreasingSubsequence (line 32) | function maxSumIncreasingSubsequence(array) { FILE: Dynamic Programming/max_sum_increasing_subsequence.py function max_sum_increasing_subsequence (line 31) | def max_sum_increasing_subsequence(array): FILE: Dynamic Programming/maximal_sqaure.cpp function maximalSquare (line 83) | int maximalSquare(std::vector>& matrix) { FILE: Dynamic Programming/maximal_sqaure.go function maximalSquare (line 87) | func maximalSquare(matrix [][]byte) int { function max (line 129) | func max(a, b int) int { function min (line 136) | func min(a, b int) int { FILE: Dynamic Programming/maximal_sqaure.js function maximalSquare (line 79) | function maximalSquare(matrix) { FILE: Dynamic Programming/maximal_sqaure.py function maximalSquare (line 80) | def maximalSquare(matrix): FILE: Dynamic Programming/maximal_square.java class LargestSquare (line 33) | public class LargestSquare { method maximalSquare (line 34) | public int maximalSquare(char[][] matrix) { FILE: Dynamic Programming/min_cost_travel_in_a_grid.cpp function min_cost_path_in_a_grid (line 19) | int min_cost_path_in_a_grid(int grid[][100], int m, int n){ function main (line 38) | int main(){ FILE: Dynamic Programming/min_insertion_steps_for_string_palindrome.java class PalindromeInsertion (line 22) | public class PalindromeInsertion { method findMinInsertions (line 23) | public static int findMinInsertions(String s) { method main (line 40) | public static void main(String[] args) { FILE: Dynamic Programming/min_number_of_jumps.cpp function MinNumberOfJumpsOptimal (line 42) | int MinNumberOfJumpsOptimal(std::vector& array) { FILE: Dynamic Programming/min_number_of_jumps.go function MinNumberOfJumps (line 38) | func MinNumberOfJumps(array []int) int { function min (line 66) | func min(a, b int) int { function MinNumberOfJumpsOptimal (line 112) | func MinNumberOfJumpsOptimal(array []int) int { FILE: Dynamic Programming/min_number_of_jumps.java class min_number_of_jumps (line 1) | public class min_number_of_jumps { method minNumberOfJumpsOptimal (line 42) | public static int minNumberOfJumpsOptimal(int[] array) { FILE: Dynamic Programming/min_number_of_jumps.js function minNumberOfJumpsOptimal (line 39) | function minNumberOfJumpsOptimal(array) { FILE: Dynamic Programming/min_number_of_jumps.py function min_number_of_jumps_optimal (line 39) | def min_number_of_jumps_optimal(array): FILE: Dynamic Programming/min_steps_to_make_string_palindrome.go function lcs (line 28) | func lcs(s1, s2 string) int { function max (line 48) | func max(a, b int) int { function minInsertions (line 55) | func minInsertions(s string) int { function main (line 65) | func main() { FILE: Dynamic Programming/min_steps_to_make_string_palindrome.java class Main (line 23) | public class Main { method lcs (line 26) | public static int lcs(String s1, String s2) { method minInsertions (line 59) | public static int minInsertions(String s) { method main (line 68) | public static void main(String[] args) { FILE: Dynamic Programming/min_steps_to_make_string_palindrome.py function lcs (line 22) | def lcs(s1, s2): function min_insertions (line 42) | def min_insertions(s): FILE: Dynamic Programming/min_steps_to_make_string_pallindrome.cpp function lcs (line 25) | int lcs(string s1,string s2){ function main (line 54) | int main(){ FILE: Dynamic Programming/min_steps_to_make_string_pallindrome.js function lcs (line 22) | function lcs(s1, s2) { function minInsertions (line 47) | function minInsertions(s) { FILE: Dynamic Programming/min_steps_to_reduce_a_number_to_one.cpp function find_min_steps (line 18) | int find_min_steps(int number){ function find_min_steps (line 38) | int find_min_steps(int number){ function main (line 53) | int main(){ FILE: Dynamic Programming/num_ways_to_make_change.cpp function NumberOfWaysToMakeChange (line 46) | int NumberOfWaysToMakeChange(int n, const std::vector& denoms) { FILE: Dynamic Programming/num_ways_to_make_change.go function NumberOfWaysToMakeChange (line 46) | func NumberOfWaysToMakeChange(n int, denoms []int) int { FILE: Dynamic Programming/num_ways_to_make_change.java class CoinChange (line 46) | public class CoinChange { method numberOfWaysToMakeChange (line 48) | public static int numberOfWaysToMakeChange(int n, int[] denoms) { method main (line 72) | public static void main(String[] args) { FILE: Dynamic Programming/num_ways_to_make_change.js function numberOfWaysToMakeChange (line 44) | function numberOfWaysToMakeChange(n, denoms) { FILE: Dynamic Programming/num_ways_to_make_change.py function number_of_ways_to_make_change (line 43) | def number_of_ways_to_make_change(n, denoms): FILE: Dynamic Programming/num_ways_to_traverse_graph.cpp function numberOfWaysToTraverseGraph (line 56) | int numberOfWaysToTraverseGraph(int width, int height) { function numberOfWaysToTraverseGraphCombinatorics (line 106) | int numberOfWaysToTraverseGraphCombinatorics(int width, int height) { function factorial (line 119) | int factorial(int n) { function numberOfWaysToTraverseGraphRecursive (line 171) | int numberOfWaysToTraverseGraphRecursive(int width, int height) { FILE: Dynamic Programming/num_ways_to_traverse_graph.go function NumberOfWaysToTraverseGraph (line 57) | func NumberOfWaysToTraverseGraph(width int, height int) int { function NumberOfWaysToTraverseGraphCombinatorics (line 119) | func NumberOfWaysToTraverseGraphCombinatorics(width int, height int) int { function factorial (line 134) | func factorial(num int) int { function NumberOfWaysToTraverseGraphRecursive (line 184) | func NumberOfWaysToTraverseGraphRecursive(width int, height int) int { FILE: Dynamic Programming/num_ways_to_traverse_graph.js function numberOfWaysToTraverseGraph (line 55) | function numberOfWaysToTraverseGraph(width, height) { function numberOfWaysToTraverseGraphCombinatorics (line 106) | function numberOfWaysToTraverseGraphCombinatorics(width, height) { function factorial (line 120) | function factorial(n) { function numberOfWaysToTraverseGraphRecursive (line 171) | function numberOfWaysToTraverseGraphRecursive(width, height) { FILE: Dynamic Programming/num_ways_to_traverse_graph.py function number_of_ways_to_traverse_graph (line 54) | def number_of_ways_to_traverse_graph(width, height): function number_of_ways_to_traverse_graph_combinatorics (line 111) | def number_of_ways_to_traverse_graph_combinatorics(width, height): function number_of_ways_to_traverse_graph_recursive (line 165) | def number_of_ways_to_traverse_graph_recursive(width, height): FILE: Dynamic Programming/numbers_in_pi.go function NumbersInPi (line 50) | func NumbersInPi(pi string, numbers []string) int { function getMinSpaces (line 68) | func getMinSpaces(pi string, numbersTable map[string]bool, cache map[int... function min (line 98) | func min(a, b int) int { FILE: Dynamic Programming/reconstruct_bst_in_python.py class TreeNode (line 1) | class TreeNode: method __init__ (line 2) | def __init__(self, val): function constructBST (line 7) | def constructBST(preorder): function inorderTraversal (line 22) | def inorderTraversal(root): FILE: Dynamic Programming/rod_cutting_problem_dp.cpp function max_profit (line 15) | int max_profit(vector profit, int total_length){ function main (line 26) | int main(){ FILE: Dynamic Programming/rod_cutting_problem_memoized.cpp function max_profit (line 16) | int max_profit(vector length, int n){ function main (line 27) | int main(){ FILE: Dynamic Programming/rod_cutting_problem_recursive.cpp function max_profit (line 15) | int max_profit(vector length, int n){ function main (line 24) | int main(){ FILE: Dynamic Programming/trapping_rain_water.cpp class Solution (line 24) | class Solution { method trap (line 26) | int trap(vector& height) { FILE: Dynamic Programming/unique_paths_with_obstacles.cpp class Solution (line 19) | class Solution { method uniquePathsWithObstacles (line 21) | int uniquePathsWithObstacles(vector>& obstacleGrid) { FILE: Dynamic Programming/wine_selling_problem_dp.cpp function find_max_profit (line 17) | int find_max_profit(int *A, int n){ function main (line 45) | int main(){ FILE: Dynamic Programming/wine_selling_problem_memoized.cpp function find_max_profit (line 18) | int find_max_profit(int *A, int start, int end, int year){ function main (line 29) | int main(){ FILE: Dynamic Programming/wine_selling_problem_recursive.cpp function find_max_profit (line 17) | int find_max_profit(int *A, int start, int end, int year){ function main (line 24) | int main(){ FILE: Famous Algorithms/N_queen.js function solveNQueens (line 1) | function solveNQueens(n) { FILE: Famous Algorithms/euclidean_algorithm.java class euclidean_algorithm (line 5) | public class euclidean_algorithm { method euclid (line 6) | public static int euclid(int a, int b, int c, int d){ method main (line 20) | public static void main(String[] args) { FILE: Famous Algorithms/euclidean_algorithm.js function euclid (line 6) | function euclid(a,b,c,d){ FILE: Famous Algorithms/euclidean_algorithm.py function euclidExtended (line 5) | def euclidExtended(a,b): FILE: Famous Algorithms/kadanes_algorithm.go function KadanesAlgorithm (line 31) | func KadanesAlgorithm(array []int) int { function max (line 49) | func max(a, b int) int { FILE: Famous Algorithms/kadanes_algorithm.java class kadanes_algo (line 42) | public class kadanes_algo { method maxSubArraySum (line 43) | public static int maxSubArraySum(int[] arr) { method main (line 66) | public static void main(String[] args) { FILE: Famous Algorithms/kadanes_algorithm.py function maxSubArraySum (line 63) | def maxSubArraySum(a, size): FILE: Famous Algorithms/kadenes_algorithm.js function largestSumOfSubArray (line 61) | function largestSumOfSubArray(arr) { FILE: Famous Algorithms/kmp.java class Graph_KMPAlgorithm (line 34) | public class Graph_KMPAlgorithm { method computeLPSArray (line 36) | public static int[] computeLPSArray(String pattern) { method searchPattern (line 59) | public static int searchPattern(String text, String pattern) { method main (line 88) | public static void main(String[] args) { FILE: Famous Algorithms/kmp.js function computeLPSArray (line 38) | function computeLPSArray(pattern) { function KMP (line 69) | function KMP(text, pattern) { FILE: Famous Algorithms/kmp.py function search (line 23) | def search(pat, txt): FILE: Fast and Slow Pointers/happy_number.go function pow (line 25) | func pow(digit int, power int) int { function sumDigits (line 34) | func sumDigits(number int) int { function happyNumber (line 44) | func happyNumber(num int) bool { function main (line 54) | func main() { FILE: Fast and Slow Pointers/linked_list_compute_midpoint.cpp class node (line 7) | class node{ method node (line 11) | node(int d){ function insert_at_tail (line 16) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 28) | void print_linked_list(node *head){ function makeLinkedList (line 34) | void makeLinkedList(node *&head){ function node (line 42) | node* compute_midpoint(node *head){ method node (line 11) | node(int d){ function main (line 54) | int main(){ FILE: Fast and Slow Pointers/linked_list_compute_midpoint.java class linked_list_compute_midpoint (line 47) | public class linked_list_compute_midpoint { class Node (line 49) | static class Node { method Node (line 54) | public Node(int data) { method insertAtTail (line 60) | static Node insertAtTail(Node head, int data) { method printLinkedList (line 74) | static void printLinkedList(Node head) { method makeLinkedList (line 81) | static Node makeLinkedList() { method computeMidpoint (line 93) | static Node computeMidpoint(Node head) { method main (line 106) | public static void main(String[] args) { FILE: Fast and Slow Pointers/linked_list_find_middle.py class Node (line 3) | class Node: method __init__ (line 6) | def __init__(self, data): class LinkedList (line 10) | class LinkedList: method __init__ (line 12) | def __init__(self): method push (line 15) | def push(self, new_data): method printMiddle (line 24) | def printMiddle(self): FILE: Fast and Slow Pointers/linked_list_floyds_cycle_detection.cpp class node (line 8) | class node{ method node (line 12) | node(int d){ function insert_at_tail (line 17) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 29) | void print_linked_list(node *head){ function makeLinkedList (line 35) | void makeLinkedList(node *&head){ function detect_cycle (line 44) | bool detect_cycle(node *head){ function main (line 68) | int main(){ FILE: Fast and Slow Pointers/linked_list_floyds_cycle_detection.py class Solution (line 14) | class Solution: method hasCycle (line 15) | def hasCycle(self, head: Optional[ListNode]) -> bool: FILE: Graphs/Diljstra.go type Graph (line 9) | type Graph struct method AddEdge (line 14) | func (g *Graph) AddEdge(node1, node2 string, weight float64) { function Dijkstra (line 29) | func Dijkstra(graph Graph, startNode string) map[string]float64 { function main (line 66) | func main() { FILE: Graphs/GraphBFS.java class GraphBFS (line 8) | class GraphBFS { method GraphBFS (line 13) | GraphBFS(int v) { method addEdge (line 22) | void addEdge(int u, int v) { method bfs (line 32) | void bfs(int s) { method main (line 54) | public static void main(String[] args) { FILE: Graphs/Graph_Dijstra.java class Graph (line 3) | class Graph { method Graph (line 7) | public Graph(int V) { method addEdge (line 16) | public void addEdge(int source, int destination, int weight) { method dijkstra (line 21) | public void dijkstra(int source) { class Node (line 50) | private static class Node { method Node (line 54) | Node(int vertex, int weight) { class DijkstraAlgorithm (line 61) | public class DijkstraAlgorithm { method main (line 62) | public static void main(String[] args) { FILE: Graphs/Graphs_Dijkstras.py function dijkstra (line 8) | def dijkstra(graph, start): FILE: Graphs/Graphs_Ford_Fulkerson.cpp function bfs (line 27) | bool bfs(int rGraph[V][V], int s, int t, int parent[]) function fordFulkerson (line 61) | int fordFulkerson(int graph[V][V], int s, int t) function main (line 106) | int main() FILE: Graphs/Graphs_bfs.cpp class Graph (line 7) | class Graph{ method Graph (line 10) | Graph(){ method addEdge (line 13) | void addEdge(T u, T v, bool bidir = true){ method printAdjList (line 19) | void printAdjList(){ method bfs (line 28) | void bfs(int n){ function main (line 47) | int main(){ FILE: Graphs/Graphs_bfs.js function bfs (line 2) | function bfs(graph, startNode) { FILE: Graphs/Graphs_bfs.py class Graph (line 3) | class Graph: method __init__ (line 4) | def __init__(self): method insertEdge (line 7) | def insertEdge(self,v1,v2): method subBfs (line 10) | def subBfs(self,visited,queue): method bfs (line 21) | def bfs(self,v): FILE: Graphs/Graphs_bfs_sssp.cpp class Graph (line 7) | class Graph{ method Graph (line 10) | Graph(){ method addEdge (line 13) | void addEdge(T u, T v, bool bidir = true){ method printAdjList (line 19) | void printAdjList(){ method bfs_sssp (line 28) | void bfs_sssp(int n){ function main (line 61) | int main(){ FILE: Graphs/Graphs_cycle_detection_bfs.cpp class Graph (line 6) | class Graph{ method Graph (line 9) | Graph(){ method add_edge (line 12) | void add_edge(T u, T v, bool bidir = true){ method print_edge (line 18) | void print_edge(){ method is_cyclic (line 27) | bool is_cyclic(T source){ function main (line 53) | int main(){ FILE: Graphs/Graphs_cycle_detection_dfs.cpp class Graph (line 6) | class Graph{ method Graph (line 9) | Graph(){ method add_edge (line 12) | void add_edge(T u, T v, bool bidir = true){ method is_cyclic_helper (line 18) | bool is_cyclic_helper(T node, map &visited, map &in_... method is_cyclic (line 29) | bool is_cyclic(){ function main (line 47) | int main(){ FILE: Graphs/Graphs_dfs.cpp class Graph (line 7) | class Graph{ method Graph (line 10) | Graph(){ method addEdge (line 13) | void addEdge(T u, T v, bool bidir = true){ method printAdjList (line 19) | void printAdjList(){ method dfsHelper (line 28) | void dfsHelper(int node, map &visited){ method dfs (line 37) | void dfs(int src){ function main (line 42) | int main(){ FILE: Graphs/Graphs_dfs.java class Node (line 25) | class Node { method Node (line 30) | Node(int value) { method addNeighbor (line 36) | void addNeighbor(Node neighbor) { class DepthFirstSearch (line 41) | class DepthFirstSearch { method dfs (line 42) | void dfs(Node startNode) { class Main (line 56) | public class Main { method main (line 57) | public static void main(String[] args) { FILE: Graphs/Graphs_dfs.js function dfs (line 2) | function dfs(graph, startNode) { function dfsHelper (line 12) | function dfsHelper(node, visited, graph) { FILE: Graphs/Graphs_dfs.py class Graph (line 3) | class Graph: method __init__ (line 4) | def __init__(self): method insertEdge (line 7) | def insertEdge(self,v1,v2): method dfsSub (line 10) | def dfsSub(self,v,visited): method dfs (line 19) | def dfs(self,v): FILE: Graphs/Graphs_dfs_connected_components.cpp class Graph (line 7) | class Graph{ method Graph (line 10) | Graph(){ method addEdge (line 13) | void addEdge(T u, T v, bool bidir = true){ method printAdjList (line 19) | void printAdjList(){ method dfsHelper (line 28) | void dfsHelper(T node, map &visited){ method dfs (line 37) | void dfs(T src){ function main (line 53) | int main(){ FILE: Graphs/Graphs_dijkstras.js class PriorityQueue (line 2) | class PriorityQueue { method constructor (line 3) | constructor() { method enqueue (line 8) | enqueue(item, priority) { method dequeue (line 23) | dequeue() { method isEmpty (line 30) | isEmpty() { method size (line 35) | size() { function dijkstra (line 41) | function dijkstra(graph, n, start) { function findShortestPath (line 84) | function findShortestPath(graph, n, start, end) { FILE: Graphs/Graphs_flood_fill.cpp function print_matrix (line 73) | void print_matrix(char input[][50]){ function flood_fill (line 83) | void flood_fill(char input[][50], int i, int j, char ch, char color){ function main (line 98) | int main(){ FILE: Graphs/Graphs_kill_process.cpp class Graph (line 17) | class Graph{ method Graph (line 20) | Graph(){ method add_list (line 23) | void add_list(int u, int v, bool bidir = false){ method print_graph (line 29) | void print_graph(){ method kill_process (line 38) | void kill_process(int process){ function main (line 56) | int main(){ FILE: Graphs/Graphs_kruskals_algo.cpp class D_S (line 27) | class D_S { method D_S (line 33) | D_S(int n) method find (line 44) | int find(int i) method unite (line 52) | void unite(int x, int y) class Graph (line 70) | class Graph { method Graph (line 77) | Graph(int V) { this->V = V; } method addEdge (line 80) | void addEdge(int x, int y, int w) method kruskals_mst (line 87) | void kruskals_mst() function main (line 113) | int main() FILE: Graphs/Graphs_kruskals_algorithm.js class DisjointSet (line 16) | class DisjointSet { method constructor (line 17) | constructor(n) { method find (line 28) | find(x) { method union (line 42) | union(x, y) { function kruskalsAlgorithm (line 63) | function kruskalsAlgorithm(n, edges) { FILE: Graphs/Graphs_topological_sort_bfs.cpp class Graph (line 10) | class Graph{ method Graph (line 13) | Graph(){ method addEdge (line 16) | void addEdge(int u, int v, bool bidir = false){ method printList (line 22) | void printList(){ method bfsTopologicalSort (line 31) | void bfsTopologicalSort(){ function main (line 69) | int main(){ FILE: Graphs/Graphs_topological_sort_dfs.cpp class Graph (line 10) | class Graph{ method Graph (line 13) | Graph(){ method addEdge (line 16) | void addEdge(T v, T u, bool bidir = false){ method print_edge (line 22) | void print_edge(){ method dfsHelper (line 31) | void dfsHelper(T node, map &visited, list &ordering){ method dfs (line 41) | void dfs(){ function main (line 55) | int main(){ FILE: Graphs/a_star_algorithm.py class Graph (line 51) | class Graph: method __init__ (line 59) | def __init__(self, adjacency_list): method get_neighbors (line 62) | def get_neighbors(self, v): method h (line 66) | def h(self, n): method a_star_algorithm (line 71) | def a_star_algorithm(self, start_node, stop_node): FILE: Graphs/adjacency_list.java class GraphNode (line 37) | public class GraphNode { method GraphNode (line 43) | public GraphNode(String name, int index) { class AdjacencyList (line 49) | public class AdjacencyList { method AdjacencyList (line 53) | public AdjacencyList(ArrayList nodeList) { method addUndirectedEdge (line 58) | public void addUndirectedEdge(int i, int j) { method printGraph (line 66) | public String printGraph() { class Main (line 83) | public class Main { method main (line 84) | public static void main(String[] args) { FILE: Graphs/adjacency_matrix.go type AdjacencyMatrix (line 5) | type AdjacencyMatrix struct method Init (line 32) | func (G *AdjacencyMatrix) Init() { method AddEdge (line 39) | func (G *AdjacencyMatrix) AddEdge(vertexOne int, vertexTwo int) error { method AddEdgeWithWeight (line 52) | func (G *AdjacencyMatrix) AddEdgeWithWeight(vertexOne int, vertexTwo i... method RemoveEdge (line 65) | func (G *AdjacencyMatrix) RemoveEdge(vertexOne int, vertexTwo int) err... method HasEdge (line 77) | func (G *AdjacencyMatrix) HasEdge(vertexOne int, vertexTwo int) bool { method GetIndegreeForVertex (line 84) | func (G *AdjacencyMatrix) GetIndegreeForVertex(vertex int) int { method GetGraphType (line 95) | func (G *AdjacencyMatrix) GetGraphType() GraphType { method GetAdjacentNodesForVertex (line 98) | func (G *AdjacencyMatrix) GetAdjacentNodesForVertex(vertex int) map[in... method GetWeightOfEdge (line 111) | func (G *AdjacencyMatrix) GetWeightOfEdge(vertexOne int, vertexTwo int... method GetNumberOfVertices (line 118) | func (G *AdjacencyMatrix) GetNumberOfVertices() int { method GetNumberOfEdges (line 122) | func (G *AdjacencyMatrix) GetNumberOfEdges() int { type GraphType (line 11) | type GraphType constant DIRECTED (line 14) | DIRECTED GraphType = "DIRECTED" constant UNDIRECTED (line 15) | UNDIRECTED GraphType = "UNDIRECTED" type Graph (line 18) | type Graph interface FILE: Graphs/adjacency_matrix.java class GraphNode (line 45) | public class GraphNode { method GraphNode (line 50) | GraphNode(String name, int index) { class AdjacencyMatrix (line 57) | public class AdjacencyMatrix { method AdjacencyMatrix (line 62) | public AdjacencyMatrix(ArrayList nodeList) { method addUndirectedEdge (line 68) | public void addUndirectedEdge(int i, int j) { method printGraph (line 74) | public String printGraph() { class Main (line 97) | public class Main { method main (line 98) | public static void main(String[] args) { FILE: Graphs/dijkstras.cpp function dijkstra (line 33) | vector dijkstra(vector>& graph, int start, int n) { function main (line 61) | int main() { FILE: Graphs/dijkstras.go function DijkstrasAlgorithm (line 55) | func DijkstrasAlgorithm(start int, edges [][][]int) []int { function getVertexWithMinDistance (line 115) | func getVertexWithMinDistance(distances []int, visited map[int]bool) (in... FILE: Graphs/dijkstras.java class Main (line 3) | class Main { class Node (line 5) | static class Node implements Comparable { method Node (line 9) | Node(String name) { method compareTo (line 14) | @Override class Edge (line 21) | static class Edge { method Edge (line 26) | Edge(Node source, Node destination, int weight) { method dijkstra (line 34) | static void dijkstra(Map> graph, String start) { method main (line 68) | public static void main(String[] args) { FILE: Graphs/dijkstras_heap_based.go function DijkstrasAlgorithm (line 54) | func DijkstrasAlgorithm(start int, edges [][][]int) []int { type Item (line 114) | type Item struct type MinHeap (line 120) | type MinHeap struct method IsEmpty (line 140) | func (h *MinHeap) IsEmpty() bool { method Remove (line 145) | func (h *MinHeap) Remove() (int, int) { method Update (line 156) | func (h *MinHeap) Update(vertex int, value int) { method swap (line 162) | func (h MinHeap) swap(i, j int) { method length (line 169) | func (h MinHeap) length() int { method buildHeap (line 174) | func (h *MinHeap) buildHeap() { method siftDown (line 182) | func (h *MinHeap) siftDown(currentIdx, endIdx int) { method siftUp (line 204) | func (h *MinHeap) siftUp(currentIdx int) { function NewMinHeap (line 126) | func NewMinHeap(array []Item) *MinHeap { FILE: Graphs/ford_fulkerson.cpp function bfs (line 38) | bool bfs(int rGraph[V][V], int s, int t, int parent[]) function fordFulkerson (line 80) | int fordFulkerson(int graph[V][V], int s, int t) function main (line 130) | int main() FILE: Graphs/graphs_adjacency_list.cpp class Graph (line 6) | class Graph{ method Graph (line 10) | Graph(int v){ method addEdge (line 15) | void addEdge(int u, int v, bool bidir = true){ method printAdjacencyList (line 21) | void printAdjacencyList(){ function main (line 31) | int main(){ FILE: Graphs/graphs_adjacency_list_generic.cpp class Graph (line 7) | class Graph{ method Graph (line 10) | Graph(){ method addEdge (line 13) | void addEdge(T u, T v, bool bidir = true){ method printAdjList (line 19) | void printAdjList(){ function main (line 29) | int main(){ FILE: Graphs/graphs_bfs.go type Graph (line 31) | type Graph struct method addEdge (line 38) | func (g *Graph) addEdge(u, v int) { function BFS (line 46) | func BFS(g *Graph, start int) { function main (line 70) | func main() { FILE: Graphs/graphs_dfs.go type Node (line 33) | type Node struct function DFS (line 40) | func DFS(node *Node) { function main (line 56) | func main() { FILE: Graphs/kruskals_algorithm.java class KruskalsMST (line 25) | public class KruskalsMST { class Edge (line 28) | static class Edge { method Edge (line 31) | public Edge(int src, int dest, int weight) class Subset (line 40) | static class Subset { method Subset (line 43) | public Subset(int parent, int rank) method main (line 51) | public static void main(String[] args) method kruskals (line 72) | private static void kruskals(int V, List edges) method union (line 124) | private static void union(Subset[] subsets, int x, method findRoot (line 144) | private static int findRoot(Subset[] subsets, int i) FILE: Graphs/kruskals_algorithm.py class UnionFind (line 13) | class UnionFind: method __init__ (line 14) | def __init__(self, n): method find (line 19) | def find(self, x): method union (line 25) | def union(self, x, y): function kruskal (line 40) | def kruskal(graph): FILE: Graphs/remove_island.go function RemoveIslands (line 83) | func RemoveIslands(matrix [][]int) [][]int { function findOnesConnectedToBorder (line 124) | func findOnesConnectedToBorder(matrix [][]int, startRow, startCol int, o... function getNeighbors (line 151) | func getNeighbors(matrix [][]int, row, col int) [][]int { function main (line 172) | func main() { function printMatrix (line 192) | func printMatrix(matrix [][]int) { FILE: Graphs/river_sizes.cpp function riverSizes (line 67) | vector riverSizes(vector>& matrix) { function traverseNode (line 90) | vector traverseNode(int i, int j, vector>& matrix, vect... function getUnvisitedNeighbors (line 138) | vector> getUnvisitedNeighbors(int i, int j, vector riverSizes(int[][] matrix) { method traverseNode (line 90) | private static List traverseNode(int i, int j, int[][] matrix... method getUnvisitedNeighbors (line 131) | private static List getUnvisitedNeighbors(int i, int j, int[][]... method main (line 160) | public static void main(String[] args) { FILE: Graphs/river_sizes.js function riverSizes (line 62) | function riverSizes(matrix) { function traverseNode (line 87) | function traverseNode(i, j, matrix, visited) { function getUnvisitedNeighbors (line 130) | function getUnvisitedNeighbors(i, j, matrix, visited) { FILE: Graphs/river_sizes.py function riverSizes (line 64) | def riverSizes(matrix): function traverseNode (line 84) | def traverseNode(i, j, matrix, visited, sizes): function getUnvisitedNeighbors (line 124) | def getUnvisitedNeighbors(i, j, matrix, visited): FILE: Graphs/single_cycle_check.cpp function hasSingleCycle (line 56) | bool hasSingleCycle(vector& array) { function getNextIdx (line 74) | int getNextIdx(vector& array, int currIdx) { function main (line 85) | int main() { FILE: Graphs/single_cycle_check.go function HasSingleCycle (line 55) | func HasSingleCycle(array []int) bool { function getNextIdx (line 72) | func getNextIdx(array []int, currIdx int) int { function main (line 84) | func main() { FILE: Graphs/single_cycle_check.java class Main (line 52) | public class Main { method hasSingleCycle (line 54) | public static boolean hasSingleCycle(int[] array) { method getNextIdx (line 72) | public static int getNextIdx(int[] array, int currIdx) { method main (line 83) | public static void main(String[] args) { FILE: Graphs/single_cycle_check.js function hasSingleCycle (line 50) | function hasSingleCycle(array) { function getNextIdx (line 67) | function getNextIdx(array, currIdx) { FILE: Graphs/single_cycle_check.py function has_single_cycle (line 51) | def has_single_cycle(array): function get_next_idx (line 66) | def get_next_idx(array, curr_idx): FILE: Graphs/snack_ladders.cpp class Graph (line 49) | class Graph{ method Graph (line 52) | Graph(){ method addEdge (line 55) | void addEdge(T u, T v, bool bidir = true){ method printAdjList (line 61) | void printAdjList(){ method bfs_sssp (line 70) | int bfs_sssp(int n, int m){ function main (line 108) | int main(){ FILE: Graphs/snack_ladders.js constant BOARD_SIZE (line 3) | const BOARD_SIZE = 100; function buildGraph (line 19) | function buildGraph() { function playGame (line 49) | function playGame() { FILE: Graphs/snack_ladders.py function snakesAndLadders (line 41) | def snakesAndLadders(board): function getRowCol (line 64) | def getRowCol(idx, n): FILE: Graphs/snakes_ladders.java class SnakesAndLadders (line 35) | public class SnakesAndLadders { method SnakesAndLadders (line 40) | public SnakesAndLadders() { method addSnake (line 46) | public void addSnake(int start, int end) { method addLadder (line 50) | public void addLadder(int start, int end) { method playGame (line 54) | public int playGame() { method rollDice (line 83) | private int rollDice() { method main (line 88) | public static void main(String[] args) { FILE: Graphs/topological_sort.cpp type Dep (line 77) | struct Dep { class JobGraph (line 82) | class JobGraph method JobGraph (line 92) | JobGraph(vector& jobs) { method addPrereq (line 100) | void addPrereq(int job, int prereq) { method addNode (line 108) | void addNode(int job) { method JobNode (line 115) | JobNode* getNode(int job) { class JobGraph (line 89) | class JobGraph { method JobGraph (line 92) | JobGraph(vector& jobs) { method addPrereq (line 100) | void addPrereq(int job, int prereq) { method addNode (line 108) | void addNode(int job) { method JobNode (line 115) | JobNode* getNode(int job) { function TopologicalSort (line 129) | vector TopologicalSort(vector& jobs, vector& deps) { function JobGraph (line 137) | JobGraph createJobGraph(vector& jobs, vector& deps) { method JobGraph (line 92) | JobGraph(vector& jobs) { method addPrereq (line 100) | void addPrereq(int job, int prereq) { method addNode (line 108) | void addNode(int job) { method JobNode (line 115) | JobNode* getNode(int job) { function getOrderedJobs (line 148) | vector getOrderedJobs(JobGraph& graph) { function depthFirstTraverse (line 167) | bool depthFirstTraverse(JobGraph& graph, int jobId, vector& ordered... class JobNode (line 204) | class JobNode { method JobNode (line 212) | JobNode(int jobId) : job(jobId), visited(false), visiting(false) {} FILE: Graphs/topological_sort.go type Dep (line 74) | type Dep struct function TopologicalSort (line 80) | func TopologicalSort(jobs []int, deps []Dep) []int { function createJobGraph (line 89) | func createJobGraph(jobs []int, deps []Dep) *JobGraph { function getOrderedJobs (line 99) | func getOrderedJobs(graph *JobGraph) []int { function depthFirstTraverse (line 121) | func depthFirstTraverse(node *JobNode, orderedJobs *[]int) bool { type JobGraph (line 155) | type JobGraph struct method Addprereq (line 173) | func (g *JobGraph) Addprereq(job, prereq int) { method AddNode (line 181) | func (g *JobGraph) AddNode(job int) { method GetNode (line 188) | func (g *JobGraph) GetNode(job int) *JobNode { function NewJobGraph (line 161) | func NewJobGraph(jobs []int) *JobGraph { type JobNode (line 197) | type JobNode struct FILE: Graphs/topological_sort.java class Dep (line 77) | class Dep { method Dep (line 81) | public Dep(int Prereq, int Job) { class JobGraph (line 87) | class JobGraph { class JobNode (line 90) | static class JobNode { method JobNode (line 97) | public JobNode(int job) { method JobGraph (line 109) | public JobGraph(List jobs) { method addPrereq (line 119) | public void addPrereq(int job, int prereq) { method addNode (line 127) | public void addNode(int job) { method getNode (line 135) | public JobNode getNode(int job) { method TopologicalSort (line 147) | public static List TopologicalSort(List jobs, List jobs, List deps) { method getOrderedJobs (line 166) | public static List getOrderedJobs(JobGraph graph) { FILE: Graphs/topological_sort.js class Dep (line 72) | class Dep { method constructor (line 73) | constructor(Prereq, Job) { class JobGraph (line 79) | class JobGraph { method constructor (line 80) | constructor(jobs) { method addPrereq (line 89) | addPrereq(job, prereq) { method addNode (line 96) | addNode(job) { method getNode (line 103) | getNode(job) { function TopologicalSort (line 112) | function TopologicalSort(jobs, deps) { function createJobGraph (line 119) | function createJobGraph(jobs, deps) { function getOrderedJobs (line 129) | function getOrderedJobs(graph) { function depthFirstTraverse (line 146) | function depthFirstTraverse(graph, jobId, orderedJobs) { FILE: Graphs/topological_sort.py function main (line 11) | def main(): function dfs (line 25) | def dfs(adj_list, visited, stack): function dfs_visit (line 34) | def dfs_visit(adj_list, visited, node, stack): FILE: Graphs/two_colorable.cpp function isTwoColorable (line 42) | bool isTwoColorable(std::vector>& edges) { function main (line 80) | int main() { FILE: Graphs/two_colorable.go function TwoColorable (line 39) | func TwoColorable(edges [][]int) bool { FILE: Graphs/two_colorable.java class TwoColorable (line 39) | public class TwoColorable { method isTwoColorable (line 41) | public static boolean isTwoColorable(List> edges) { method main (line 78) | public static void main(String[] args) { FILE: Graphs/two_colorable.js function isTwoColorable (line 37) | function isTwoColorable(edges) { FILE: Graphs/two_colorable.py function is_two_colorable (line 37) | def is_two_colorable(edges): FILE: Graphs/union_find.cpp class UnionFind (line 59) | class UnionFind { method createSet (line 64) | void createSet(int value) { method find (line 69) | int find(int value) { method unionSets (line 90) | void unionSets(int valueOne, int valueTwo) { function main (line 109) | int main() { FILE: Graphs/union_find.go type UnionFind (line 60) | type UnionFind struct method CreateSet (line 74) | func (union *UnionFind) CreateSet(value int) { method Find (line 80) | func (union *UnionFind) Find(value int) *int { method Union (line 101) | func (union *UnionFind) Union(valueOne, valueTwo int) { function NewUnionFind (line 66) | func NewUnionFind() *UnionFind { function main (line 122) | func main() { FILE: Graphs/union_find.java class UnionFind (line 59) | class UnionFind { method UnionFind (line 63) | public UnionFind() { method createSet (line 68) | public void createSet(int value) { method find (line 73) | public int find(int value) { method unionSets (line 94) | public void unionSets(int valueOne, int valueTwo) { class Main (line 113) | public class Main { method main (line 114) | public static void main(String[] args) { FILE: Graphs/union_find.js class UnionFind (line 56) | class UnionFind { method constructor (line 57) | constructor() { method createSet (line 62) | createSet(value) { method find (line 67) | find(value) { method union (line 88) | union(valueOne, valueTwo) { FILE: Graphs/union_find.py class UnionFind (line 56) | class UnionFind: method __init__ (line 57) | def __init__(self): method create_set (line 61) | def create_set(self, value): method find (line 65) | def find(self, value): method union (line 82) | def union(self, value_one, value_two): FILE: Graphs/validate_bst.cpp type TreeNode (line 28) | struct TreeNode { method TreeNode (line 33) | TreeNode(int x) : value(x), left(nullptr), right(nullptr) {} function isValidBST (line 37) | bool isValidBST(TreeNode* root) { function isValidBSTHelper (line 42) | bool isValidBSTHelper(TreeNode* node, long long minVal, long long maxVal) { function main (line 62) | int main() { FILE: Graphs/validate_bst.go type BST (line 29) | type BST struct method ValidateBst (line 37) | func (tree *BST) ValidateBst() bool { method validateBST (line 44) | func (tree *BST) validateBST(min, max int) bool { FILE: Graphs/validate_bst.java class TreeNode (line 27) | class TreeNode { method TreeNode (line 32) | TreeNode(int x) { class ValidateBST (line 39) | public class ValidateBST { method isValidBST (line 42) | public static boolean isValidBST(TreeNode root) { method isValidBSTHelper (line 47) | private static boolean isValidBSTHelper(TreeNode node, long minVal, lo... method main (line 67) | public static void main(String[] args) { FILE: Graphs/validate_bst.js class TreeNode (line 25) | class TreeNode { method constructor (line 26) | constructor(value) { function isValidBST (line 34) | function isValidBST(root) { function isValidBSTHelper (line 39) | function isValidBSTHelper(node, minVal, maxVal) { FILE: Graphs/validate_bst.py class BST (line 27) | class BST: method __init__ (line 28) | def __init__(self, value): method validate_bst (line 34) | def validate_bst(self): method _validate_bst (line 38) | def _validate_bst(self, min_val, max_val): FILE: Graphs/youngest_common_ancestor.cpp class AncestralTree (line 49) | class AncestralTree { method AncestralTree (line 54) | AncestralTree(string name) { function getDescendantDepth (line 61) | int getDescendantDepth(AncestralTree* descendant, AncestralTree* topAnce... function AncestralTree (line 71) | AncestralTree* backTrackAncestralTree(AncestralTree* lowestDescendant, A... method AncestralTree (line 54) | AncestralTree(string name) { function AncestralTree (line 84) | AncestralTree* getYoungestCommonAncestor(AncestralTree* topAncestor, Anc... method AncestralTree (line 54) | AncestralTree(string name) { function main (line 94) | int main() { FILE: Graphs/youngest_common_ancestor.go type AncestralTree (line 47) | type AncestralTree struct function GetYoungestCommonAncestor (line 53) | func GetYoungestCommonAncestor(topAncestor, descendantOne, descendantTwo... function getDescendantDepth (line 69) | func getDescendantDepth(descendant, topAncestor *AncestralTree) int { function backTrackAncestralTree (line 79) | func backTrackAncestralTree(lowestDescendant, higherDescendant *Ancestra... function main (line 96) | func main() { FILE: Graphs/youngest_common_ancestor.java class AncestralTree (line 43) | class AncestralTree { method AncestralTree (line 47) | public AncestralTree(String name) { class Main (line 53) | public class Main { method getDescendantDepth (line 55) | public static int getDescendantDepth(AncestralTree descendant, Ancestr... method backTrackAncestralTree (line 65) | public static AncestralTree backTrackAncestralTree(AncestralTree lowes... method getYoungestCommonAncestor (line 78) | public static AncestralTree getYoungestCommonAncestor(AncestralTree to... method main (line 88) | public static void main(String[] args) { FILE: Graphs/youngest_common_ancestor.js class AncestralTree (line 43) | class AncestralTree { method constructor (line 44) | constructor(name) { function getDescendantDepth (line 51) | function getDescendantDepth(descendant, topAncestor) { function backTrackAncestralTree (line 61) | function backTrackAncestralTree(lowestDescendant, higherDescendant, diff) { function getYoungestCommonAncestor (line 74) | function getYoungestCommonAncestor(topAncestor, descendantOne, descendan... FILE: Graphs/youngest_common_ancestor.py class AncestralTree (line 42) | class AncestralTree: method __init__ (line 43) | def __init__(self, name): function get_descendant_depth (line 48) | def get_descendant_depth(descendant, top_ancestor): function back_track_ancestral_tree (line 56) | def back_track_ancestral_tree(lowest_descendant, higher_descendant, diff): function get_youngest_common_ancestor (line 66) | def get_youngest_common_ancestor(top_ancestor, descendant_one, descendan... FILE: Greedy/coin_change.go function coinChangeGreedy (line 21) | func coinChangeGreedy(coins []int, target int) int { function main (line 32) | func main() { FILE: Greedy/coin_change.java class CoinChange (line 13) | public class CoinChange { method minCoins (line 22) | public static int minCoins(int[] coins, int n) { method main (line 45) | public static void main(String[] args) { FILE: Greedy/coin_change.js function coinChangeGreedy (line 2) | function coinChangeGreedy(s, l) { FILE: Greedy/coin_change.py function coinChangeGreedy (line 99) | def coinChangeGreedy(s:int, l:list[int]): function coinChangeGreedySorted (line 116) | def coinChangeGreedySorted(s:int, l:list[int]): FILE: Greedy/task_assignment.cpp function getTaskDurationToIndices (line 60) | unordered_map> getTaskDurationToIndices(vector& ta... function TaskAssignment (line 73) | vector> TaskAssignment(int k, vector& tasks) { FILE: Greedy/task_assignment.go function TaskAssignment (line 56) | func TaskAssignment(k int, tasks []int) [][]int { function getTaskDurationToIndices (line 85) | func getTaskDurationToIndices(tasks []int) map[int][]int { FILE: Greedy/task_assignment.java class TaskAssignment (line 58) | public class TaskAssignment { method taskAssignment (line 60) | public static int[][] taskAssignment(int k, int[] tasks) { method getTaskDurationToIndices (line 87) | private static Map> getTaskDurationToIndices(in... method main (line 100) | public static void main(String[] args) { FILE: Greedy/task_assignment.js function taskAssignment (line 52) | function taskAssignment(k, tasks) { function getTaskDurationToIndices (line 79) | function getTaskDurationToIndices(tasks) { FILE: Greedy/task_assignment.py function task_assignment (line 53) | def task_assignment(k, tasks): function get_task_duration_to_indices (line 76) | def get_task_duration_to_indices(tasks): FILE: Hash Table/Bloomfilter.cpp class BloomFilter (line 6) | class BloomFilter { method BloomFilter (line 14) | BloomFilter(int size, std::vector keys() { FILE: Hash Table/Longest_substring_without_repeating_characters.py class Solution (line 26) | class Solution: method lengthOfLongestSubstring (line 30) | def lengthOfLongestSubstring(self, s: str) -> int: method lengthOfLongestSubstring (line 47) | def lengthOfLongestSubstring(self, s: str) -> int: FILE: Hash Table/Partition.java class PalindromePartitioning (line 4) | public class PalindromePartitioning { method partition (line 5) | public static List> partition(String s) { method backtrack (line 12) | private static void backtrack(List> result, List ... method isPalindrome (line 27) | private static boolean isPalindrome(String s, int start, int end) { method main (line 38) | public static void main(String[] args) { FILE: Hash Table/Partition_string.py function is_palindrome (line 1) | def is_palindrome(s): function min_partition (line 4) | def min_partition(s): FILE: Hash Table/add_first_missing_positive.cpp function firstMissingPositive (line 20) | int firstMissingPositive(std::vector& nums) { function main (line 55) | int main() { FILE: Hash Table/add_first_missing_positive.java class AddFirstMissingPositive (line 20) | public class AddFirstMissingPositive{ method firstMissingPositive (line 21) | public int firstMissingPositive(int[] nums) { FILE: Hash Table/find_optimal_partition_of_string.cpp function main (line 30) | int main(){ FILE: Hash Table/find_optimal_partition_of_string.go function min (line 19) | func min(x, y int) int { function isPalindrome (line 26) | func isPalindrome(s string, i, j int) bool { function minCut (line 37) | func minCut(s string) int { function main (line 68) | func main() { FILE: Hash Table/first_duplicate_value.go function FirstDuplicateValue (line 32) | func FirstDuplicateValue(array []int) int { function main (line 43) | func main() { FILE: Hash Table/first_missing_positve.go function firstMissingPositive (line 49) | func firstMissingPositive(nums []int) int { FILE: Hash Table/first_missing_positve.js function firstMissingPositive (line 55) | function firstMissingPositive(nums) { FILE: Hash Table/first_missing_positve.py function firstMissingPositive (line 42) | def firstMissingPositive(nums): FILE: Hash Table/first_non_repeated_character.go function FirstNonRepeatingCharacter (line 29) | func FirstNonRepeatingCharacter(str string) int { function main (line 50) | func main() { FILE: Hash Table/first_repeated_character.go function FirstRepeatedCCharacter (line 9) | func FirstRepeatedCCharacter(word string) byte { function main (line 31) | func main() { FILE: Hash Table/four_number_sum.java class FourNumberSum (line 20) | public class FourNumberSum { method main (line 21) | public static void main(String[] args) { method solve (line 31) | public static List solve(int[] array, int targetSum) { FILE: Hash Table/frequency_of_elements.java class FrequencyOfElements (line 61) | public class FrequencyOfElements { method main (line 62) | public static void main(String[] args) { method solve (line 70) | public static int[] solve(int[] nums, int[] queries) { FILE: Hash Table/group_anagrams.cpp function groupAnagrams (line 33) | vector> groupAnagrams(vector& strs) { function main (line 51) | int main() { FILE: Hash Table/group_anagrams.go function groupAnagrams (line 37) | func groupAnagrams(strs []string) [][]string { function sortString (line 61) | func sortString(s string) string { function main (line 66) | func main() { FILE: Hash Table/group_anagrams.java class group_anagrams (line 25) | public class group_anagrams{ method groupAnagrams (line 27) | public List> groupAnagrams(String[] strs) { method main (line 51) | public static void main(String[] args) { FILE: Hash Table/group_anagrams.js function groupAnagrams (line 30) | function groupAnagrams(strs) { FILE: Hash Table/group_anagrams.py function groupAnagrams (line 28) | def groupAnagrams(strs): FILE: Hash Table/integer_to_roman.cpp function string (line 16) | string intToRoman(int num) { function main (line 41) | int main() { FILE: Hash Table/integer_to_roman.go function intToRoman (line 16) | func intToRoman(num int) string { function main (line 33) | func main() { FILE: Hash Table/integer_to_roman.java method intToRoman (line 14) | public static String intToRoman(int num) { FILE: Hash Table/integer_to_roman.js function intToRoman (line 8) | function intToRoman(num) { FILE: Hash Table/integer_to_roman.py function intToRoman (line 16) | def intToRoman(num: int) -> str: FILE: Hash Table/remove_duplicates.go function RemoveDuplicates (line 10) | func RemoveDuplicates(word string) string { function main (line 25) | func main() { FILE: Hash Table/roman_to_integer.cpp class Solution (line 48) | class Solution { method romanToInt (line 50) | int romanToInt(string s) { FILE: Hash Table/roman_to_integer.go function romanToInt (line 24) | func romanToInt(s string) int { function main (line 60) | func main() { FILE: Hash Table/roman_to_integer.java class Solution (line 2) | class Solution { method romanToInt (line 3) | public int romanToInt(String s) { FILE: Hash Table/roman_to_integer.py function roman_to_int (line 15) | def roman_to_int(s: str) -> int: FILE: Hash Table/sum_of_unique_elements.java class Solution (line 31) | class Solution { method sumOfUnique (line 32) | public int sumOfUnique(int[] nums) { class SumOfUniqueElements (line 50) | class SumOfUniqueElements { method main (line 51) | public static void main(String[] args) { FILE: Hash Table/three_number_sum.java class ThreeNumberSum (line 20) | public class ThreeNumberSum { method main (line 22) | public static void main(String[] args){ method solve (line 28) | public static List solve(int[] array, int targetSum) { FILE: Hash Table/two_sum.cpp function twoNumberSum (line 14) | std::vector twoNumberSum(std::vector& nums, int target) { function main (line 37) | int main() { FILE: Hash Table/two_sum.go function TwoNUmberSumBruteForce (line 19) | func TwoNUmberSumBruteForce(array []int, target int) []int { function TwoNumberSumTwoPointerMethod (line 40) | func TwoNumberSumTwoPointerMethod(array []int, target int) []int { function TwoNumberSum (line 66) | func TwoNumberSum(array []int, target int) []int { function main (line 89) | func main() { FILE: Hash Table/two_sum.java class TwoNumberSum (line 12) | public class TwoNumberSum { method main (line 14) | public static void main(String[] args) { method TwoSumBruteForce (line 22) | public static int[] TwoSumBruteForce(int[] array, int targetSum) { method TwoSumBySorting (line 36) | public static int[] TwoSumBySorting(int[] array, int targetSum) { method TwoSumOptimal (line 54) | public static int[] TwoSumOptimal(int[] array, int targetSum) { FILE: Hash Table/two_sum.js function twoNumberSum (line 10) | function twoNumberSum(nums, target) { FILE: Hash Table/two_sum.py class Solution (line 13) | class Solution: method twoSum (line 14) | def twoSum(self, nums: List[int], target: int) -> List[int]: method twoSum (line 25) | def twoSum(self, nums: List[int], target: int) -> List[int]: class Solution (line 24) | class Solution: method twoSum (line 14) | def twoSum(self, nums: List[int], target: int) -> List[int]: method twoSum (line 25) | def twoSum(self, nums: List[int], target: int) -> List[int]: FILE: Hash Table/zero_sum_subarray.cpp function zeroSumSubarray (line 28) | vector zeroSumSubarray(vector& nums) { function main (line 47) | int main() { FILE: Hash Table/zero_sum_subarray.go function ZeroSumSubarray (line 26) | func ZeroSumSubarray(nums []int) bool { function main (line 39) | func main() { FILE: Hash Table/zero_sum_subarray.java class ZeroSumSubarray (line 11) | public class ZeroSumSubarray { method hasZeroSumSubarray (line 13) | public static boolean hasZeroSumSubarray(int[] nums) { method main (line 26) | public static void main(String[] args) { FILE: Hash Table/zero_sum_subarray.js function hasZeroSumSubarray (line 21) | function hasZeroSumSubarray(nums) { FILE: Hash Table/zero_sum_subarray.py function zero_sum_subarray (line 22) | def zero_sum_subarray(nums): FILE: Heaps/heap.cpp class MinHeap (line 44) | class MinHeap { method buildHeap (line 48) | void buildHeap(std::vector& array) { method siftDown (line 55) | void siftDown(int currentIndex, int endIndex) { method siftUp (line 78) | void siftUp() { method peek (line 95) | int peek() { method remove (line 102) | int remove() { method insert (line 111) | void insert(int value) { method swap (line 116) | void swap(int i, int j) { method length (line 122) | int length() { function MinHeap (line 127) | MinHeap* newMinHeap(std::vector& array) { method buildHeap (line 48) | void buildHeap(std::vector& array) { method siftDown (line 55) | void siftDown(int currentIndex, int endIndex) { method siftUp (line 78) | void siftUp() { method peek (line 95) | int peek() { method remove (line 102) | int remove() { method insert (line 111) | void insert(int value) { method swap (line 116) | void swap(int i, int j) { method length (line 122) | int length() { FILE: Heaps/heap.go type MinHeap (line 45) | type MinHeap method BuildHeap (line 58) | func (h *MinHeap) BuildHeap(array []int) { method siftDown (line 68) | func (h *MinHeap) siftDown(currentIndex, endIndex int) { method siftUp (line 90) | func (h *MinHeap) siftUp() { method Peek (line 106) | func (h MinHeap) Peek() int { method Remove (line 114) | func (h *MinHeap) Remove() int { method Insert (line 124) | func (h *MinHeap) Insert(value int) { method swap (line 130) | func (h MinHeap) swap(i, j int) { method length (line 135) | func (h MinHeap) length() int { function NewMinHeap (line 48) | func NewMinHeap(array []int) *MinHeap { FILE: Heaps/heap.java class MinHeap (line 44) | public class MinHeap { method MinHeap (line 48) | public MinHeap(int[] array) { method buildHeap (line 54) | private void buildHeap() { method siftDown (line 61) | private void siftDown(int currentIndex) { method siftUp (line 84) | private void siftUp() { method peek (line 101) | public int peek() { method remove (line 108) | public int remove() { method insert (line 116) | public void insert(int value) { method swap (line 125) | private void swap(int i, int j) { method length (line 131) | public int length() { class Main (line 136) | public class Main { method main (line 137) | public static void main(String[] args) { FILE: Heaps/heap.js class MinHeap (line 42) | class MinHeap { method constructor (line 43) | constructor(array) { method buildHeap (line 49) | buildHeap() { method siftDown (line 56) | siftDown(currentIndex) { method siftUp (line 79) | siftUp() { method peek (line 96) | peek() { method remove (line 103) | remove() { method insert (line 112) | insert(value) { method swap (line 118) | swap(i, j) { method length (line 122) | length() { FILE: Heaps/heap.py class MinHeap (line 42) | class MinHeap: method __init__ (line 43) | def __init__(self): method build_heap (line 46) | def build_heap(self, array): method sift_down (line 52) | def sift_down(self, current_idx, end_idx): method sift_up (line 70) | def sift_up(self): method peek (line 83) | def peek(self): method remove (line 88) | def remove(self): method insert (line 95) | def insert(self, value): method swap (line 99) | def swap(self, i, j): method length (line 102) | def length(self): function new_min_heap (line 106) | def new_min_heap(array): FILE: Heaps/k_closest.py class Solution (line 1) | class Solution: method kClosest (line 2) | def kClosest(self, points: List[List[int]], k: int) -> List[List[int]]: FILE: Linked List/Intersection_LL.cpp class Solution (line 9) | class Solution { method ListNode (line 11) | ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { FILE: Linked List/LFU_Cache.cpp class LFUCache (line 27) | class LFUCache { method LFUCache (line 35) | LFUCache(int capacity) { method get (line 41) | int get(int key) { method put (line 56) | void put(int key, int value) { FILE: Linked List/Linked_List_Component.java class Solution (line 40) | class Solution { method numComponents (line 41) | public int numComponents(ListNode head, int[] nums) { FILE: Linked List/MiddleOfLinkedList.java class Solution (line 36) | class Solution { method middleNode (line 37) | public ListNode middleNode(ListNode head) { FILE: Linked List/MiddleofLL.py class ListNode (line 1) | class ListNode: method __init__ (line 2) | def __init__(self, value=0, next=None): function find_middle (line 6) | def find_middle(head): FILE: Linked List/RemoveKthNodeFromEnd.java class Solution (line 63) | class Solution { method calcLength (line 65) | public int calcLength(ListNode head) { method removeNthFromEnd (line 74) | public ListNode removeNthFromEnd(ListNode head, int n) { FILE: Linked List/Remove_nth_node_from_end.java class Solution (line 36) | class Solution { method removeNthFromEnd (line 37) | public ListNode removeNthFromEnd(ListNode head, int n) { method size (line 64) | int size(ListNode temp) { FILE: Linked List/add_two_numbers.cpp class Solution (line 11) | class Solution method ListNode (line 14) | ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) method ListNode (line 54) | ListNode *solve(ListNode *&head1, ListNode *&head2) FILE: Linked List/delete_kth_node.js class Node (line 17) | class Node { method constructor (line 18) | constructor(value) { function removeKthFromEnd (line 23) | function removeKthFromEnd(head, k) { FILE: Linked List/double_linked_list.go type Node (line 19) | type Node struct type LinkedList (line 26) | type LinkedList struct method AddNode (line 32) | func (list *LinkedList) AddNode(data int) { method PrintList (line 54) | func (list *LinkedList) PrintList() { function main (line 65) | func main() { FILE: Linked List/doubly_linked_list.cpp class Node (line 68) | class Node { method Node (line 73) | Node(int d) { function PrintForward (line 81) | void PrintForward(Node* head) { function PrintBackward (line 90) | void PrintBackward(Node* tail) { function main (line 98) | int main() { FILE: Linked List/doubly_linked_list.java class Node (line 3) | class Node { method Node (line 8) | public Node(int data) { class DoublyLinkedList (line 15) | class DoublyLinkedList { method DoublyLinkedList (line 18) | public DoublyLinkedList() { method insert (line 23) | public void insert(int data) { method delete (line 44) | public void delete(int data) { method display (line 76) | public void display() { class Main (line 88) | public class Main { method main (line 89) | public static void main(String[] args) { FILE: Linked List/doubly_linked_list.js class Node (line 1) | class Node { method constructor (line 2) | constructor(val) { class DoublyLinkedList (line 9) | class DoublyLinkedList { method constructor (line 10) | constructor() { method insertAtTail (line 16) | insertAtTail(val) { method insertAtHead (line 31) | insertAtHead(val) { method deleteAtTail (line 46) | deleteAtTail() { method deleteAtHead (line 60) | deleteAtHead() { method print (line 74) | print() { method getLength (line 93) | getLength() { method getAtIdx (line 97) | getAtIdx(idx) { method putAtIdx (line 113) | putAtIdx(val, idx) { method deleteAtIdx (line 139) | deleteAtIdx(idx) { method search (line 155) | search(val) { method toArray (line 169) | toArray() { FILE: Linked List/floyds_cycle_detection.cpp class Node (line 18) | class Node { method Node (line 23) | Node(int data) class Linkedlist (line 32) | class Linkedlist { method insert (line 35) | void insert(int value) method detectLoop (line 48) | bool detectLoop() function main (line 66) | int main() FILE: Linked List/floyds_cycle_detection.go type Node (line 31) | type Node struct function hasCycle (line 38) | func hasCycle(head *Node) bool { function main (line 57) | func main() { FILE: Linked List/floyds_cycle_detection.java class GFG (line 17) | class GFG{ class Node (line 19) | static class Node { method Node (line 23) | Node(int data) class Linkedlist (line 32) | static class Linkedlist { method insert (line 34) | void insert(int value) method detectLoop (line 47) | boolean detectLoop() method main (line 65) | public static void main(String[] args) FILE: Linked List/intersection_of_two_linked_lists.cpp class Solution (line 33) | class Solution { method ListNode (line 35) | ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { FILE: Linked List/liniked_list_sort_list.cpp class Solution (line 32) | class Solution { method ListNode (line 34) | ListNode* compute_midpoint(ListNode* head){ method ListNode (line 46) | ListNode* merge_two_lists(ListNode* A, ListNode* B){ method ListNode (line 62) | ListNode* sortList(ListNode* head) { FILE: Linked List/linked_list.go type node (line 9) | type node struct type linkedlist (line 14) | type linkedlist struct method PushBack (line 20) | func (ll *linkedlist) PushBack(n *node) { method Front (line 34) | func (ll linkedlist) Front() (int, error) { method Back (line 41) | func (ll linkedlist) Back() (int, error) { method DeleteFromFront (line 48) | func (ll *linkedlist) DeleteFromFront() { method DeleteFromBack (line 57) | func (ll *linkedlist) DeleteFromBack() { method Display (line 74) | func (ll linkedlist) Display() { function main (line 81) | func main() { FILE: Linked List/linked_list.js class Node (line 16) | class Node { method constructor (line 17) | constructor(val) { class LinkedList (line 23) | class LinkedList { method constructor (line 24) | constructor() { method insertAtTail (line 30) | insertAtTail(val) { method insertAtHead (line 44) | insertAtHead(val) { method print (line 58) | print() { method deleteAtTail (line 73) | deleteAtTail() { method deleteAtHead (line 91) | deleteAtHead() { method getLength (line 102) | getLength() { method getAtIdx (line 106) | getAtIdx (idx) { method putAtIdx (line 122) | putAtIdx (val, idx) { method deleteAtIdx (line 148) | deleteAtIdx (idx) { method search (line 167) | search (val) { method toArray (line 184) | toArray () { method reverse (line 198) | reverse () { FILE: Linked List/linked_list.py class Node (line 15) | class Node: method __init__ (line 16) | def __init__(self, data): class LinkedList (line 22) | class LinkedList: method __init__ (line 23) | def __init__(self): method insert_at_beginning (line 28) | def insert_at_beginning(self, data): method insert_at_end (line 39) | def insert_at_end(self, data): method delete_node (line 57) | def delete_node(self, data): method print_list (line 76) | def print_list(self): FILE: Linked List/linked_list_add_two_numbers.py class Solution (line 37) | class Solution: method addTwoNumbers (line 38) | def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]... FILE: Linked List/linked_list_compute_middle.cpp class Node (line 16) | class Node method Node (line 22) | Node() method Node (line 27) | Node(int data) function Node (line 34) | Node *middleNode(Node *head) method Node (line 22) | Node() method Node (line 27) | Node(int data) function main (line 55) | int main() FILE: Linked List/linked_list_compute_middle.java class ListNode (line 5) | class ListNode { method ListNode (line 9) | ListNode(int val) { class FindMiddleLinkedList (line 15) | class FindMiddleLinkedList { method findMiddle (line 16) | public ListNode findMiddle(ListNode head) { method main (line 31) | public static void main(String[] args) { FILE: Linked List/linked_list_delete_at_any_pos.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function length (line 15) | int length(node* head){ function insert_at_head (line 23) | void insert_at_head(node *&head, int data){ function insert_at_tail (line 28) | void insert_at_tail(node *&head, int data){ function insert_at_anypos (line 40) | void insert_at_anypos(node *&head, int data, int pos){ function delete_at_head (line 57) | void delete_at_head(node *&head){ function delete_at_tail (line 65) | void delete_at_tail(node *&head){ function delete_at_any_pos (line 75) | void delete_at_any_pos(node *&head, int pos){ function print_linked_list (line 94) | void print_linked_list(node *head){ function main (line 100) | int main(){ FILE: Linked List/linked_list_delete_at_head.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_head (line 15) | void insert_at_head(node *&head, int data){ function delete_at_head (line 20) | void delete_at_head(node *&head){ function print_linked_list (line 28) | void print_linked_list(node *head){ function main (line 34) | int main(){ FILE: Linked List/linked_list_delete_at_tail.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_tail (line 16) | void insert_at_tail(node *&head, int data){ function delete_at_tail (line 28) | void delete_at_tail(node *&head){ function print_linked_list (line 38) | void print_linked_list(node *head){ function main (line 44) | int main(){ FILE: Linked List/linked_list_delete_node.go function deleteNode (line 13) | func deleteNode(node *ListNode) { FILE: Linked List/linked_list_even_or_odd.go type node (line 12) | type node struct type LinkedList (line 17) | type LinkedList struct method IsLengthEven (line 23) | func (ll *LinkedList) IsLengthEven() bool { FILE: Linked List/linked_list_find_length.cpp class node (line 6) | class node{ method node (line 11) | node(int d){ function length (line 16) | int length(node* head){ function insert_at_head (line 24) | void insert_at_head(node *&head, int data){ function print_linked_list (line 29) | void print_linked_list(node *head){ function main (line 35) | int main(){ FILE: Linked List/linked_list_insert_at_any_pos.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function length (line 15) | int length(node* head){ function insert_at_head (line 23) | void insert_at_head(node *&head, int data){ function insert_at_tail (line 28) | void insert_at_tail(node *&head, int data){ function insert_at_anypos (line 40) | void insert_at_anypos(node *&head, int data, int pos){ function print_linked_list (line 57) | void print_linked_list(node *head){ function main (line 63) | int main(){ FILE: Linked List/linked_list_insert_at_head.cpp class node (line 6) | class node{ method node (line 11) | node(int d){ function insert_at_head (line 16) | void insert_at_head(node *&head, int data){ function print_linked_list (line 21) | void print_linked_list(node *head){ function main (line 27) | int main(){ FILE: Linked List/linked_list_insert_at_tail.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_tail (line 16) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 28) | void print_linked_list(node *head){ function main (line 34) | int main(){ FILE: Linked List/linked_list_kth_from_end.go function kthFromEnd (line 22) | func kthFromEnd(head *ListNode, n int) *ListNode { FILE: Linked List/linked_list_kth_node_from_end.cpp class node (line 5) | class node{ method node (line 9) | node(int d){ function insert_at_tail (line 14) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 26) | void print_linked_list(node *head){ function makeLinkedList (line 32) | void makeLinkedList(node *&head){ function node (line 40) | node* kth_node_from_end(node *head, int k){ method node (line 9) | node(int d){ function main (line 55) | int main(){ FILE: Linked List/linked_list_linear_search.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function linear_search (line 15) | bool linear_search(node *head, int key){ function insert_at_head (line 30) | void insert_at_head(node *&head, int data){ function print_linked_list (line 35) | void print_linked_list(node *head){ function main (line 41) | int main(){ FILE: Linked List/linked_list_merge_k_sorted_lists.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_tail (line 16) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 28) | void print_linked_list(node *head){ function makeLinkedList (line 34) | void makeLinkedList(node *&head){ function istream (line 42) | istream& operator>>(istream &is, node *&head){ function ostream (line 46) | ostream& operator<<(ostream &os, node *&head){ function node (line 50) | node* merge_two_lists(node *a, node *b){ method node (line 10) | node(int d){ function node (line 68) | node* merge_k_lists(node *arr[], int last){ method node (line 10) | node(int d){ function main (line 81) | int main(){ FILE: Linked List/linked_list_merge_two_sorted_linked_list.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_tail (line 16) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 28) | void print_linked_list(node *head){ function makeLinkedList (line 34) | void makeLinkedList(node *&head){ function istream (line 42) | istream& operator>>(istream &is, node *&head){ function ostream (line 46) | ostream& operator<<(ostream &os, node *&head){ function node (line 50) | node* merge_two_lists(node *a, node *b){ method node (line 10) | node(int d){ function main (line 68) | int main(){ FILE: Linked List/linked_list_mergesort_an_unsorted_list.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_tail (line 15) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 27) | void print_linked_list(node *head){ function makeLinkedList (line 33) | void makeLinkedList(node *&head){ function node (line 41) | node* compute_midpoint(node *head){ method node (line 10) | node(int d){ function istream (line 53) | istream& operator>>(istream &is, node *&head){ function ostream (line 57) | ostream& operator<<(ostream &os, node *&head){ function node (line 61) | node* merge_two_lists(node *a, node *b){ method node (line 10) | node(int d){ function node (line 79) | node* mergeSort(node* head){ method node (line 10) | node(int d){ function main (line 92) | int main(){ FILE: Linked List/linked_list_middle.go function middleNode (line 30) | func middleNode(head *ListNode) *ListNode { FILE: Linked List/linked_list_odd_even.cpp class node (line 5) | class node{ method node (line 9) | node(int d){ function insert_at_tail (line 14) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 26) | void print_linked_list(node *head){ function makeLinkedList (line 33) | void makeLinkedList(node *&head){ function node (line 41) | node* oddEvenLinkedList(node *head){ method node (line 9) | node(int d){ function main (line 57) | int main(){ FILE: Linked List/linked_list_pallindrome.cpp class Solution (line 41) | class Solution { method isPalindrome (line 43) | bool isPalindrome(ListNode* head) { FILE: Linked List/linked_list_recursive_search.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function recursive_search (line 15) | bool recursive_search(node *head, int key){ function insert_at_head (line 26) | void insert_at_head(node *&head, int data){ function print_linked_list (line 31) | void print_linked_list(node *head){ function main (line 37) | int main(){ FILE: Linked List/linked_list_remove_dups.cpp class Node (line 5) | class Node{ method Node (line 10) | Node(int d){ function insert_at_tail (line 15) | void insert_at_tail(Node *&head, int data){ function print_linked_list (line 27) | void print_linked_list(Node *head){ function make_linked_list (line 33) | void make_linked_list(Node *&head){ function remove_duplicates (line 41) | void remove_duplicates(Node *&head){ function remove_duplicates_without_buffer (line 59) | void remove_duplicates_without_buffer(Node *&head){ function main (line 77) | int main(){ FILE: Linked List/linked_list_remove_kth_node_from_end.py class node (line 9) | class node: method __init__ (line 10) | def __init__(self,v=0,n=None): function create_list (line 16) | def create_list(n): function print_list (line 26) | def print_list(head): function __remove_node (line 32) | def __remove_node(prev,curr): function recursive (line 35) | def recursive(head, n): function iterative (line 61) | def iterative(head,k): FILE: Linked List/linked_list_remove_nth_node_from_end.cpp class Solution (line 46) | class Solution { method ListNode (line 48) | ListNode* removeNthFromEnd(ListNode* head, int n) { FILE: Linked List/linked_list_remove_nth_node_from_end.py class Solution (line 1) | class Solution: method removeNthFromEnd (line 2) | def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Option... FILE: Linked List/linked_list_reverse.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_tail (line 15) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 27) | void print_linked_list(node *head){ function makeLinkedList (line 33) | void makeLinkedList(node *&head){ function reverse_linked_list (line 41) | void reverse_linked_list(node *&head){ function main (line 53) | int main(){ FILE: Linked List/linked_list_reverse_recursive.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_tail (line 15) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 27) | void print_linked_list(node *head){ function makeLinkedList (line 33) | void makeLinkedList(node *&head){ function node (line 42) | node* recursive_reverse(node *head){ method node (line 10) | node(int d){ function main (line 52) | int main(){ FILE: Linked List/linked_list_sum_lists.cpp class Node (line 7) | class Node{ method Node (line 12) | Node(int d){ function insert_at_head (line 17) | void insert_at_head(Node *&head, int data){ function print_linked_list (line 22) | void print_linked_list(Node *head){ function make_linked_list (line 28) | void make_linked_list(Node *&head){ function Node (line 36) | Node* add_lists(Node *l1, Node *l2, int carry){ method Node (line 12) | Node(int d){ function main (line 57) | int main(){ FILE: Linked List/linked_list_swap_nodes_in_pair.cpp class node (line 5) | class node{ method node (line 9) | node(int d){ function insert_at_tail (line 14) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 26) | void print_linked_list(node *head){ function makeLinkedList (line 33) | void makeLinkedList(node *&head){ function node (line 41) | node* swapNodesInPairRecursive(node *head){ method node (line 9) | node(int d){ function main (line 51) | int main(){ FILE: Linked List/linked_list_swap_nodes_in_pair_iterative.cpp class node (line 5) | class node{ method node (line 9) | node(int d){ function insert_at_tail (line 14) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 26) | void print_linked_list(node *head){ function makeLinkedList (line 33) | void makeLinkedList(node *&head){ function node (line 42) | node* swapNodesInPairIterative(node *head){ method node (line 9) | node(int d){ function main (line 62) | int main(){ FILE: Linked List/linked_list_take_input.cpp class node (line 5) | class node{ method node (line 9) | node(int d){ function insert_at_tail (line 14) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 26) | void print_linked_list(node *head){ function makeLinkedList (line 33) | void makeLinkedList(node *&head){ function main (line 42) | int main(){ FILE: Linked List/linked_list_take_input_as_array_operator_overloading.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_tail (line 16) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 28) | void print_linked_list(node *head){ function makeLinkedList (line 34) | void makeLinkedList(node *&head){ function istream (line 42) | istream& operator>>(istream &is, node *&head){ function ostream (line 46) | ostream& operator<<(ostream &os, node *&head){ function main (line 50) | int main(){ FILE: Linked List/linked_list_take_input_operator_overloading.cpp class node (line 5) | class node{ method node (line 10) | node(int d){ function insert_at_tail (line 16) | void insert_at_tail(node *&head, int data){ function print_linked_list (line 28) | void print_linked_list(node *head){ function makeLinkedList (line 34) | void makeLinkedList(node *&head){ function istream (line 42) | istream& operator>>(istream &is, node *&head){ function ostream (line 46) | ostream& operator<<(ostream &os, node *&head){ function main (line 50) | int main(){ FILE: Linked List/recursive and iterative in singly linkedlist.py class ListNode (line 46) | class ListNode: method __init__ (line 47) | def __init__(self, val=0, next=None): function create_linked_list (line 51) | def create_linked_list(): function reverse_linked_list_iterative (line 71) | def reverse_linked_list_iterative(head): function reverse_linked_list_recursive (line 83) | def reverse_linked_list_recursive(head): function reverse_linked_list (line 93) | def reverse_linked_list(head, method='iterative'): FILE: Linked List/reverse_linked_list.go type ListNode (line 22) | type ListNode struct function ReverseListIteratively (line 28) | func ReverseListIteratively(head *ListNode) *ListNode { function ReverseListRecursively (line 43) | func ReverseListRecursively(head *ListNode) *ListNode { function main (line 55) | func main() { FILE: Linked List/reverse_linked_list.java class Solution (line 36) | class Solution { method reverseList (line 37) | public ListNode reverseList(ListNode head) { FILE: Linked List/singly_linked_list.cpp type Node (line 31) | struct Node method Node (line 37) | Node(int val = 0) : data(val), next(nullptr) {} method Node (line 39) | Node(int val, Node *tempNext) : data(val), next(tempNext) {} class LinkedList (line 42) | class LinkedList method LinkedList (line 49) | LinkedList() : head(nullptr) method insert (line 54) | void insert(int val) method search (line 74) | bool search(int val) method remove (line 86) | void remove(int val) method display (line 118) | void display() function main (line 130) | int main() FILE: Linked List/singly_linked_list.go type node (line 25) | type node struct type linkedList (line 31) | type linkedList struct method IsEmpty (line 48) | func (l *linkedList) IsEmpty() bool { method insertAtTail (line 53) | func (l *linkedList) insertAtTail(val interface{}) { method insertAtHead (line 70) | func (l *linkedList) insertAtHead(val interface{}) { method print (line 89) | func (l *linkedList) print() { method deleteAtTail (line 106) | func (l *linkedList) deleteAtTail() { method deleteAtHead (line 133) | func (l *linkedList) deleteAtHead() { method getLength (line 151) | func (l *linkedList) getLength() int { method getAtIdx (line 156) | func (l *linkedList) getAtIdx(idx int) (interface{}, error) { method replaceAtIdx (line 171) | func (l *linkedList) replaceAtIdx(val interface{}, idx int) error { method deleteAtIdx (line 186) | func (l *linkedList) deleteAtIdx(idx int) error { method search (line 203) | func (l *linkedList) search(val interface{}) (int, error) { method toArray (line 216) | func (l *linkedList) toArray() []interface{} { method reverse (line 229) | func (l *linkedList) reverse() error { function newNode (line 38) | func newNode(val interface{}) *node { function newLinkedList (line 43) | func newLinkedList() *linkedList { function reverseListRecursive (line 238) | func reverseListRecursive(head *node) *node { function main (line 251) | func main() { FILE: Linked List/singly_linked_list.java class Node (line 18) | class Node { method Node (line 22) | Node(int x) // parameterized constructor class Main (line 29) | class Main method insertStart (line 31) | static Node insertStart(Node head, int data) method delete (line 44) | public static Node delete(Node head) method display (line 58) | static void display(Node node) { method main (line 68) | public static void main(String args[]) FILE: Linked List/singly_linked_list.py class Node (line 5) | class Node: method __init__ (line 6) | def __init__(self, data): class LinkedList (line 10) | class LinkedList: method __init__ (line 11) | def __init__(self): method append (line 14) | def append(self, data): method prepend (line 24) | def prepend(self, data): method delete_node (line 29) | def delete_node(self, data): method print_list (line 42) | def print_list(self): FILE: Linked List/sll.go type ListNode (line 20) | type ListNode struct type LinkedList (line 25) | type LinkedList struct method Display (line 30) | func (ll *LinkedList) Display() error { method Length (line 44) | func (ll *LinkedList) Length() int { method InsertAtBeginning (line 55) | func (ll *LinkedList) InsertAtBeginning(data interface{}) { method InsertAtEnd (line 71) | func (ll *LinkedList) InsertAtEnd(data interface{}) { method InsertAtAnyPos (line 91) | func (ll *LinkedList) InsertAtAnyPos(data interface{}, position int) e... method DeleteFirst (line 118) | func (ll *LinkedList) DeleteFirst() (interface{}, error) { method DeleteLast (line 131) | func (ll *LinkedList) DeleteLast() (interface{}, error) { method DeleteFromAnyPos (line 155) | func (ll *LinkedList) DeleteFromAnyPos(position int) (interface{}, err... FILE: Linked List/sort_linked_list.cpp class Solution (line 15) | class Solution { method ListNode (line 17) | ListNode* compute_midpoint(ListNode* head){ method ListNode (line 29) | ListNode* merge_two_lists(ListNode* A, ListNode* B){ method ListNode (line 45) | ListNode* sortList(ListNode* head) { FILE: Math/Basic_operations.py function divide (line 1) | def divide(dividend, divisor): FILE: Math/Factorial.cpp function factorial (line 22) | unsigned long long factorial(int num) { function main (line 32) | int main() { FILE: Math/Factorial.go function factorial (line 25) | func factorial(n int) int { function main (line 32) | func main() { FILE: Math/Factorial.java class Factorial (line 19) | public class Factorial { method factorial (line 21) | public static int factorial(int n) { method main (line 31) | public static void main(String[] args) { FILE: Math/Factorial.py function factorial (line 16) | def factorial(num): FILE: Math/Hamming_distance.py class Solution (line 22) | class Solution: method totalHammingDistance (line 23) | def totalHammingDistance(self, nums: List[int]) -> int: FILE: Math/Hammingdistance.cpp class Solution (line 3) | class Solution { method totalHammingDistance (line 5) | int totalHammingDistance(std::vector& nums) { FILE: Math/K_closest.cpp class Solution (line 33) | class Solution { method kClosest (line 35) | vector> kClosest(vector>& points, int k) { function main (line 64) | int main() { FILE: Math/K_closest_points_to_origin.java class Solution (line 28) | class Solution { method kClosest (line 29) | public int[][] kClosest(int[][] points, int k) { class SortBySmallerDistanceComparator (line 70) | class SortBySmallerDistanceComparator implements Comparator List[List[int]]: FILE: Math/Number_of_Substrings_With_Only_1s.cpp class Solution (line 34) | class Solution { method numSub (line 37) | int numSub(string s) { FILE: Math/PowXn.go function Pow (line 24) | func Pow(x float64, n int) float64 { function main (line 34) | func main() { FILE: Math/PowXn.java class Solution (line 28) | class Solution { method myPow (line 29) | public double myPow(double x, int n) { class PowXn (line 47) | class PowXn { method main (line 48) | public static void main(String[] args) { FILE: Math/PowXn.py function power (line 18) | def power(x, n): FILE: Math/Reverse_Integer.cpp function reverse (line 24) | int reverse(int x) { FILE: Math/Sum_four.cpp function fourSum (line 7) | vector> fourSum(vector& nums, int target) { function main (line 61) | int main() { FILE: Math/circle.cpp class Solution (line 1) | class Solution { method if (line 15) | if (isInsideCircle(pointX, pointY, centerX, centerY, radius)) { function boolean (line 24) | boolean isInsideCircle(int x, int y, int centerX, int centerY, int radiu... FILE: Math/count_numbers_with_unique_digits.java class Solution (line 41) | class Solution { method countNumbersWithUniqueDigits (line 43) | public int countNumbersWithUniqueDigits(int n) { FILE: Math/count_primes.cpp class Solution (line 21) | class Solution { method countPrimes (line 23) | int countPrimes(int n) { FILE: Math/count_primes.java class Solution (line 27) | class Solution { method countPrimes (line 29) | int countPrimes(int n) { FILE: Math/count_unique_digits.cpp class Solution (line 14) | class Solution { method countNumbersWithUniqueDigits (line 23) | int countNumbersWithUniqueDigits(int n) { FILE: Math/count_unique_digits.go function countNumbersWithUniqueDigits (line 21) | func countNumbersWithUniqueDigits(n int) int { function main (line 46) | func main() { FILE: Math/factorial.py function factorial (line 16) | def factorial(num): FILE: Math/factorial_iterative.js function factorialIterative (line 2) | function factorialIterative(number) { FILE: Math/find_longest_increasing_subsequence.cpp class Solution (line 32) | class Solution{ method lengthOfLIS (line 34) | int lengthOfLIS(vector &nums) FILE: Math/hamming_distance.cpp class Solution (line 27) | class Solution { method totalHammingDistance (line 29) | int totalHammingDistance(vector& nums) { function main (line 45) | int main() { FILE: Math/is_power_of_two.js function isPowerOfTwo (line 4) | function isPowerOfTwo(inputNumber) { function isPowerOfTwoConst (line 21) | function isPowerOfTwoConst(inputNumber) { function isPowerOfTwoConst (line 33) | function isPowerOfTwoConst(inputNumber) { FILE: Math/is_prime.js function isPrime (line 3) | function isPrime(input) { function isPrimeLogn (line 30) | function isPrimeLogn(input) { FILE: Math/k_closest_points_to_origin.cpp class Solution (line 16) | class Solution { method kClosest (line 18) | vector> kClosest(vector>& points, int k) { FILE: Math/modular_expo_itera.cpp function modular_expo (line 9) | int modular_expo(int x, int n, int mod){ function main (line 23) | int main(){ FILE: Math/modular_expo_recursive.cpp function modular_expo (line 9) | int modular_expo(int x, int n, int mod){ function main (line 20) | int main(){ FILE: Math/num_points_inside_a_circle.cpp class Solution (line 33) | class Solution method countPoints (line 36) | vector countPoints(vector> &points, vector bool: FILE: Math/powXn.cpp class Solution (line 34) | class Solution { method pow (line 36) | double pow(double x, int n) method myPow (line 45) | double myPow(double x, int n) { FILE: Math/powXn.js function pow (line 4) | function pow(x, n) { FILE: Math/prime_factorization.cpp function prime_factor (line 12) | void prime_factor(int n){ function main (line 39) | int main(){ FILE: Math/shuffle_an_array.cpp class Solution (line 32) | class Solution { method Solution (line 37) | Solution(vector& nums) { method reset (line 46) | vector reset() { method shuffle (line 51) | vector shuffle() { FILE: Math/shuffle_an_array.py class Solution (line 5) | class Solution: method __init__ (line 7) | def __init__(self, nums: List[int]): method reset (line 12) | def reset(self) -> List[int]: method shuffle (line 16) | def shuffle(self) -> List[int]: FILE: Math/sieve_of_eratosthenes.cpp function seive_of_ero (line 16) | void seive_of_ero(int n){ function main (line 28) | int main(){ FILE: Math/substrings_with_1s.py function numSub (line 18) | def numSub(self, s: str) -> int: FILE: Math/unique_digits.py class Solution (line 16) | class Solution: method countNumbersWithUniqueDigits (line 17) | def countNumbersWithUniqueDigits(self, n: int) -> int: FILE: Math/unique_integers_that_sum_up_to_0.cpp class Solution (line 21) | class Solution { method sumZero (line 23) | vector sumZero(int n) { FILE: Misc/tictactoe.java class TicTacToe (line 39) | public class TicTacToe { method TicTacToe (line 45) | public TicTacToe() { method clearBoard (line 48) | public void clearBoard() { method putMark (line 55) | public void putMark(int i, int j) throws IllegalArgumentException { method isWin (line 64) | public boolean isWin(int mark) { method winner (line 75) | public int winner() { method toString (line 84) | public String toString() { method main (line 100) | public static void main(String[] args) { FILE: Patterns/CompleteSquare.java class CompleteSquare (line 15) | public class CompleteSquare { method main (line 17) | public static void main(String[] args) { FILE: Patterns/HollowPattern.cpp function printHollowPattern (line 28) | void printHollowPattern(int n) { function main (line 45) | int main() { FILE: Patterns/HollowPattern.go function printHollowPattern (line 30) | func printHollowPattern(n int) { function main (line 47) | func main() { FILE: Patterns/HollowPattern.java class HollowPattern (line 28) | public class HollowPattern { method printHollowPattern (line 29) | public static void printHollowPattern(int n) { method main (line 46) | public static void main(String[] args) { FILE: Patterns/HollowPattern.py function print_hollow_pattern (line 31) | def print_hollow_pattern(n): FILE: Patterns/Ladder_Pattern.java class LadderPattern (line 20) | public class LadderPattern { method main (line 21) | public static void main(String[] args) { method printSideRail (line 36) | public static void printSideRail() { method printStep (line 41) | public static void printStep(int stepNumber) { FILE: Patterns/ReverseRightTrianglePattern.java class ReverseRightTrianglePattern (line 19) | public class ReverseRightTrianglePattern { method main (line 21) | public static void main(String[] args) { method pattern (line 26) | public static void pattern(int size) { FILE: Patterns/RightPascalTriangle.java class RightPascalTriangle (line 21) | public class RightPascalTriangle { method main (line 23) | public static void main(String[] args) { method pattern (line 28) | public static void pattern(int size) { FILE: Patterns/StarDiamond.java class StarDiamond (line 16) | public class StarDiamond { method main (line 18) | public static void main(String[] args) { method pattern (line 23) | public static void pattern(int size) { FILE: Patterns/diamond_pattern.cpp function printDiamondPattern (line 35) | void printDiamondPattern(int n) { function main (line 67) | int main() { FILE: Patterns/diamond_pattern.go function printSpaces (line 39) | func printSpaces(num int) { function printStars (line 45) | func printStars(num int) { function printDiamondPattern (line 51) | func printDiamondPattern(n int) { function main (line 67) | func main() { FILE: Patterns/diamond_pattern.java class DiamondPattern (line 25) | public class DiamondPattern { method main (line 27) | public static void main(String[] args) { method printDiamondPattern (line 32) | public static void printDiamondPattern(int n) { FILE: Patterns/diamond_pattern.py function print_diamond_pattern (line 24) | def print_diamond_pattern(n): FILE: Patterns/numerical_pattern.java class NumericalPattern (line 35) | public class NumericalPattern { method printPattern (line 36) | public static void printPattern(int n) { method main (line 45) | public static void main(String[] args) { FILE: Patterns/triangular_pattern.java class triangular_pattern (line 26) | public class triangular_pattern { method main (line 27) | public static void main(String[] args) { FILE: Patterns/triangular_pattern.py function print_triangular_pattern (line 28) | def print_triangular_pattern(n): FILE: Priority Queues/In_Place_HeapSort.cpp function heapSort (line 44) | void heapSort(int arr[], int n) function main (line 119) | int main() FILE: Priority Queues/buy_the_ticket.cpp function buyTicket (line 70) | int buyTicket(int *arr, int n, int k) function main (line 118) | int main() FILE: Priority Queues/check_max_heap.cpp function isMaxHeap (line 41) | bool isMaxHeap(int arr[], int n) function main (line 65) | int main() FILE: Priority Queues/kth_largest_element.cpp function kthLargest (line 51) | int kthLargest(int *arr, int n, int k) function main (line 78) | int main() FILE: Priority Queues/kth_smallest_element.cpp function kSmallest (line 50) | vector kSmallest(int arr[], int n, int k) function main (line 83) | int main() FILE: Priority Queues/merge_k_sorted_arrays.cpp function mergeKSortedArrays (line 51) | vector mergeKSortedArrays(vector *> input) function main (line 94) | int main() FILE: Priority Queues/running_median.cpp function findMedian (line 71) | void findMedian(int *arr, int n) function main (line 129) | int main() FILE: Queue/queue.cpp class Queue (line 16) | class Queue { method Queue (line 21) | Queue() { method isFull (line 26) | bool isFull() { method isEmpty (line 30) | bool isEmpty() { method enqueue (line 34) | void enqueue(int x) { method dequeue (line 48) | void dequeue() { method peek (line 61) | int peek() { method print (line 69) | void print() { function main (line 82) | int main() { FILE: Queue/queue.go type Queue (line 21) | type Queue struct method IsEmpty (line 34) | func (q *Queue) IsEmpty() bool { method Enqueue (line 39) | func (q *Queue) Enqueue(val int) { method Dequeue (line 52) | func (q *Queue) Dequeue() (int, error) { function NewQueue (line 28) | func NewQueue() *Queue { function main (line 75) | func main() { FILE: Queue/queue.java class Queue (line 10) | public class Queue { method Queue (line 17) | public Queue(int size) { method enqueue (line 25) | public void enqueue(int item) { method dequeue (line 38) | public int dequeue() { method isEmpty (line 52) | public boolean isEmpty() { method isFull (line 56) | public boolean isFull() { method size (line 60) | public int size() { method Queue (line 81) | public Queue() { class Node (line 87) | private static class Node { method Node (line 91) | public Node(T data) { method enqueue (line 97) | public void enqueue(T item) { method dequeue (line 108) | public T dequeue() { method isEmpty (line 122) | public boolean isEmpty() { method size (line 126) | public int size() { class Queue (line 76) | public class Queue { method Queue (line 17) | public Queue(int size) { method enqueue (line 25) | public void enqueue(int item) { method dequeue (line 38) | public int dequeue() { method isEmpty (line 52) | public boolean isEmpty() { method isFull (line 56) | public boolean isFull() { method size (line 60) | public int size() { method Queue (line 81) | public Queue() { class Node (line 87) | private static class Node { method Node (line 91) | public Node(T data) { method enqueue (line 97) | public void enqueue(T item) { method dequeue (line 108) | public T dequeue() { method isEmpty (line 122) | public boolean isEmpty() { method size (line 126) | public int size() { FILE: Queue/queue.js class Queue (line 10) | class Queue { method constructor (line 11) | constructor() { method enqueue (line 15) | enqueue(element) { method dequeue (line 19) | dequeue() { method front (line 26) | front() { method isEmpty (line 33) | isEmpty() { method printQueue (line 37) | printQueue() { method constructor (line 62) | constructor() { method enqueue (line 68) | enqueue(data) { method dequeue (line 80) | dequeue() { method isEmpty (line 93) | isEmpty() { method getFront (line 97) | getFront() { method printQueue (line 101) | printQueue() { class Node (line 54) | class Node { method constructor (line 55) | constructor(data) { class Queue (line 61) | class Queue { method constructor (line 11) | constructor() { method enqueue (line 15) | enqueue(element) { method dequeue (line 19) | dequeue() { method front (line 26) | front() { method isEmpty (line 33) | isEmpty() { method printQueue (line 37) | printQueue() { method constructor (line 62) | constructor() { method enqueue (line 68) | enqueue(data) { method dequeue (line 80) | dequeue() { method isEmpty (line 93) | isEmpty() { method getFront (line 97) | getFront() { method printQueue (line 101) | printQueue() { FILE: Queue/queue.py class Queue (line 12) | class Queue: method __init__ (line 13) | def __init__(self): method is_empty (line 19) | def is_empty(self): method enqueue (line 25) | def enqueue(self, item): method dequeue (line 31) | def dequeue(self): method peek (line 40) | def peek(self): method size (line 49) | def size(self): FILE: Queue/queue_using_stacks.go type MyQueue (line 1) | type MyQueue struct method Push (line 12) | func (this *MyQueue) Push(x int) { method Pop (line 17) | func (this *MyQueue) Pop() int { method Peek (line 27) | func (this *MyQueue) Peek() int { method Empty (line 35) | func (this *MyQueue) Empty() bool { method moveElements (line 40) | func (this *MyQueue) moveElements() { function Constructor (line 7) | func Constructor() MyQueue { FILE: Queue/queues_using_stacks.py class Queue (line 25) | class Queue: method __init__ (line 26) | def __init__(self): method enqueue (line 31) | def enqueue(self, val): method dequeue (line 35) | def dequeue(self): FILE: Queue/stack_using_queue.cpp class Queue_As_stack (line 54) | class Queue_As_stack { method PUSH (line 56) | void PUSH(int d) { method POP (line 79) | void POP() method TOP (line 85) | int TOP() method DISPLAY (line 90) | void DISPLAY() method EMPTY (line 101) | bool EMPTY() function main (line 113) | int main() FILE: Recursion/calculatextopowern.cpp function power1 (line 9) | int power1(int x, int n){ function power (line 16) | int power(int x, int n){ function main (line 26) | int main(){ FILE: Recursion/count_digits.cpp function count_digits (line 7) | int count_digits(int n){ function main (line 14) | int main(){ FILE: Recursion/count_digits.go function CountDigits (line 8) | func CountDigits(n int) int { function main (line 17) | func main() { FILE: Recursion/count_zeros.cpp function count_zeros (line 6) | int count_zeros(int n){ function main (line 17) | int main(){ FILE: Recursion/count_zeros.go function CountZeroes (line 8) | func CountZeroes(n int) int { function main (line 23) | func main() { FILE: Recursion/factorial.cpp function factorial (line 6) | int factorial(int n){ function main (line 14) | int main(){ FILE: Recursion/factorial.go function Factorial (line 9) | func Factorial(n int) int { function main (line 16) | func main() { FILE: Recursion/factorial.js function recursiveFactorial (line 4) | function recursiveFactorial(number) { FILE: Recursion/fibonacci.cpp function fib (line 14) | int fib(int n){ function main (line 19) | int main(){ FILE: Recursion/fibonacci.go function Fibonacci (line 16) | func Fibonacci(n int) int { function main (line 23) | func main() { FILE: Recursion/fibonacci_memoization.cpp function fib (line 13) | int fib(int n){ function main (line 19) | int main(){ FILE: Recursion/fibonacci_memoization.go function Fibonacci (line 16) | func Fibonacci(n int) int { function GetNthFib (line 24) | func GetNthFib(n int) int { function main (line 39) | func main() { FILE: Recursion/geometric_sum.cpp function g_sum (line 3) | double g_sum(int m){ function main (line 9) | int main(){ FILE: Recursion/is_array_sorted.cpp function is_sorted (line 8) | bool is_sorted(int A[], int m){ function main (line 16) | int main(){ FILE: Recursion/is_array_sorted.go function isSorted (line 8) | func isSorted(A []int) bool { function main (line 22) | func main() { FILE: Recursion/is_element_present.cpp function is_element_present (line 8) | bool is_element_present(int A[], int m, int key){ function is_element_present2 (line 15) | bool is_element_present2(int A[], int m, int key, int i){ function main (line 22) | int main(){ FILE: Recursion/modular_exponentiation.cpp function mod (line 10) | int mod(int x, int n, int m){ function main (line 19) | int main(){ FILE: Recursion/multiplication.cpp function multiply (line 6) | int multiply(int n, int m){ function main (line 12) | int main(){ FILE: Recursion/powerset.cpp function powerset (line 45) | vector> powerset(vector& array, int index) { function Powerset (line 73) | vector> Powerset(vector& array) { function powerset (line 79) | vector> powerset(vector& array) { FILE: Recursion/powerset.go function Powerset (line 44) | func Powerset(array []int) [][]int { function powerset (line 49) | func powerset(array []int, index int) [][]int { function PowersetIterative (line 78) | func PowersetIterative(array []int) [][]int { FILE: Recursion/powerset.java class Main (line 44) | class Main { method powerset (line 46) | public static List> powerset(int[] array, int index) { method powerset (line 76) | public static List> powerset(int[] array) { method main (line 81) | public static void main(String[] args) { class Powerset (line 94) | public class Powerset { method powerset (line 95) | public static List> powerset(int[] array) { method main (line 122) | public static void main(String[] args) { FILE: Recursion/powerset.js function powerset (line 41) | function powerset(array, index) { function getPowerSet (line 67) | function getPowerSet(array) { function powersetIterative (line 82) | function powersetIterative(array) { FILE: Recursion/powerset.py function powerset (line 41) | def powerset(array): function Powerset (line 66) | def Powerset(array): function powersetIterative (line 72) | def powersetIterative(array): FILE: Recursion/print_numbers.cpp function print (line 6) | void print(int n){ function main (line 12) | int main(){ FILE: Recursion/recursive_bubble_sort.cpp function bubble_sort (line 16) | void bubble_sort(int *A, int len){ function main (line 26) | int main(){ FILE: Recursion/reverse_print.go function print (line 6) | func print(n int) int { function main (line 14) | func main() { FILE: Recursion/tower_of_hannoi.cpp function towerOfHanoi (line 14) | void towerOfHanoi(int numDisks, char fromPeg, char toPeg, char auxPeg) { function main (line 24) | int main() { FILE: Recursion/tower_of_hannoi.java class TowerOfHanoi (line 17) | public class TowerOfHanoi { method main (line 18) | public static void main(String[] args) { method solveHanoi (line 28) | public static void solveHanoi(int n, char fromRod, char toRod, char au... FILE: Recursion/tower_of_hannoi.js function towerOfHanoi (line 12) | function towerOfHanoi(numDisks, fromPeg, toPeg, auxPeg) { FILE: Recursion/tower_of_hannoi.py function TowerOfHanoi (line 14) | def TowerOfHanoi(n, A,B,C): FILE: Recursion/tower_of_hanoi.go function TowerOfHanoiHelper (line 16) | func TowerOfHanoiHelper(n int, from, to, temp string) { function TowersOfHanoi (line 34) | func TowersOfHanoi(n int) { function main (line 37) | func main() { FILE: Recursion/valid_palindrome_2.py class Solution (line 13) | class Solution: method subPalindrome (line 14) | def subPalindrome(self,s,low,high,count): method validPalindrome (line 24) | def validPalindrome(self, s: str) -> bool: FILE: Scheduling Algortihms/fcfs.c type process (line 49) | typedef struct function main (line 59) | int main() { FILE: Scheduling Algortihms/sjf.c type process (line 54) | typedef struct function main (line 64) | int main() { FILE: Scheduling Algortihms/srtf.c type process (line 67) | typedef struct function main (line 77) | int main() { FILE: Scheduling/fcfs.c type process (line 49) | typedef struct function main (line 59) | int main() { FILE: Scheduling/sjf.c type process (line 54) | typedef struct function main (line 64) | int main() { FILE: Scheduling/srtf.c type process (line 67) | typedef struct function main (line 77) | int main() { FILE: Searching/linear_search_string.cpp function main (line 4) | int main(){ FILE: Searching/semordnilap.go function Semordnilap (line 16) | func Semordnilap(words []string) [][]string { function reverse (line 37) | func reverse(s string) string { FILE: Searching/separate_0s_and_1s.go function SeparateZerosAndOnes (line 9) | func SeparateZerosAndOnes(Arr []int) []int { function main (line 29) | func main() { FILE: Searching/separate_even_odd.go function SeparateEvenAndOdd (line 9) | func SeparateEvenAndOdd(Arr []int) []int { function main (line 29) | func main() { FILE: Sliding Window/find_max.go function printKMax (line 30) | func printKMax(arr []int, N int, K int) { function main (line 47) | func main() { FILE: Sliding Window/fruits_into_basket.cpp function totalFruit (line 45) | int totalFruit(vector& fruits) { function main (line 71) | int main() { FILE: Sliding Window/fruits_into_basket.go function totalFruit (line 43) | func totalFruit(fruits []int) int { function main (line 71) | func main() { FILE: Sliding Window/fruits_into_basket.java class Solution (line 39) | class Solution { method totalFruit (line 40) | public int totalFruit(int[] fruits) { FILE: Sliding Window/fruits_into_basket.py class Solution (line 39) | class Solution: method totalFruit (line 40) | def totalFruit(self, fruits): FILE: Sliding Window/longest_repeated_character_replacement.cpp class Solution (line 36) | class Solution { method characterReplacement (line 38) | int characterReplacement(std::string s, int k) { FILE: Sliding Window/longest_repeated_character_replacement.go function characterReplacement (line 32) | func characterReplacement(s string, k int) int { function maxInt (line 59) | func maxInt(a, b int) int { FILE: Sliding Window/longest_repeated_character_replacement.java class Solution (line 32) | class Solution { method characterReplacement (line 33) | public int characterReplacement(String s, int k) { FILE: Sliding Window/longest_repeated_character_replacement.js class Solution (line 32) | class Solution { method characterReplacement (line 33) | characterReplacement(s, k) { FILE: Sliding Window/longest_repeated_character_replacement.py class Solution (line 32) | class Solution: method characterReplacement (line 33) | def characterReplacement(self, s: str, k: int) -> int: FILE: Sliding Window/longest_substring_with_k_distinct_chars.go function longestSubstringWithKDistinctChars (line 11) | func longestSubstringWithKDistinctChars(s string, k int) int { function max (line 40) | func max(a, b int) int { function main (line 47) | func main() { FILE: Sliding Window/longest_substring_with_k_distinct_chars.java class LongestSubstringWithKDistinctChars (line 6) | public class LongestSubstringWithKDistinctChars { method longestSubstringWithKDistinctChars (line 7) | public int longestSubstringWithKDistinctChars(String s, int k) { method main (line 37) | public static void main(String[] args) { FILE: Sliding Window/longest_substring_with_k_distinct_chars.js function longestSubstringWithKDistinctChars (line 5) | function longestSubstringWithKDistinctChars(s, k) { function max (line 35) | function max(a, b) { FILE: Sliding Window/longest_substring_with_k_distinct_chars.py function longestSubstringWithKDistinctChars (line 5) | def longestSubstringWithKDistinctChars(s, k): function max (line 30) | def max(a, b): FILE: Sliding Window/longest_substring_without_repeating_characters.go function LengthOfLongestSubstring1 (line 35) | func LengthOfLongestSubstring1(s string) int { function max (line 47) | func max(a, b int) int { function check (line 54) | func check(s string, start int, end int) bool { function LengthOfLongestSubstring2 (line 67) | func LengthOfLongestSubstring2(s string) int { FILE: Sliding Window/max_eraser_value.go function maximumUniqueSubarray (line 48) | func maximumUniqueSubarray(nums []int) int { function main (line 78) | func main() { FILE: Sliding Window/max_eraser_value.java class Solution (line 44) | class Solution { method maximumUniqueSubarray (line 45) | public int maximumUniqueSubarray(int[] nums) { FILE: Sliding Window/sliding_window_max.java class SlidingWindowMax (line 6) | public class SlidingWindowMax { method findMaxSlidingWindow (line 7) | public static int[] findMaxSlidingWindow(int[] nums, int windowSize) { method main (line 40) | public static void main(String[] args) { FILE: Sliding Window/sliding_window_max.js function findMaxSlidingWindow (line 4) | function findMaxSlidingWindow(nums, windowSize) { FILE: Sliding Window/sliding_window_max.py function slidingWindowMax (line 5) | def slidingWindowMax(arr,windowSize) -> list[int]: FILE: Sliding Window/subaray_sum_equals_k.cpp function subarraySum (line 61) | int subarraySum(std::vector& nums, int k) { function main (line 95) | int main() { FILE: Sliding Window/subaray_sum_equals_k.go function subarraySum (line 57) | func subarraySum(nums []int, k int) int { FILE: Sliding Window/subaray_sum_equals_k.java method subarraySum (line 57) | public int subarraySum(int[] nums, int k) { FILE: Sliding Window/subaray_sum_equals_k.js function subarraySum (line 57) | function subarraySum(nums, k) { FILE: Sliding Window/subaray_sum_equals_k.py function subarraySum (line 58) | def subarraySum(nums, k): FILE: Sliding Window/subarray_product_less_than_k.cpp class Solution (line 22) | class Solution { method numSubarrayProductLessThanK (line 24) | int numSubarrayProductLessThanK(std::vector& nums, int k) { FILE: Sliding Window/subarray_product_less_than_k.go function numSubarrayProductLessThanK (line 20) | func numSubarrayProductLessThanK(nums []int, k int) int { FILE: Sliding Window/subarray_product_less_than_k.java class Solution (line 19) | class Solution { method numSubarrayProductLessThanK (line 20) | public int numSubarrayProductLessThanK(int[] nums, int k) { FILE: Sliding Window/subarray_product_less_than_k.py class Solution (line 21) | class Solution: method numSubarrayProductLessThanK (line 22) | def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int: FILE: Stacks/Stack_with_max_API.cpp class MaxStack (line 9) | class MaxStack { method push (line 15) | void push(int val) { method pop (line 24) | void pop() { method top (line 33) | int top() { method max (line 37) | int max() { method empty (line 41) | bool empty() { FILE: Stacks/Stacks_using_queues.py class Stack (line 29) | class Stack: method __init__ (line 30) | def __init__(self): #The Stack class is defined with a con... method push (line 33) | def push(self, x: int) -> None: method pop (line 39) | def pop(self) -> int: method top (line 42) | def top(self) -> int: #The top method returns the element ... method empty (line 45) | def empty(self) -> bool: #The empty method returns True if t... FILE: Stacks/balanced_parenthesis.go type Stack (line 10) | type Stack struct method Init (line 17) | func (stack *Stack) Init(capacity uint) *Stack { method Size (line 31) | func (stack *Stack) Size() uint { method IsFull (line 37) | func (stack *Stack) IsFull() bool { method IsEmpty (line 44) | func (stack *Stack) IsEmpty() bool { method Resize (line 51) | func (stack *Stack) Resize() { method Push (line 66) | func (stack *Stack) Push(data interface{}) error { method Pop (line 78) | func (stack *Stack) Pop() (interface{}, error) { method Peek (line 93) | func (stack *Stack) Peek() (interface{}, error) { method Drain (line 104) | func (stack *Stack) Drain() { function NewStack (line 25) | func NewStack(capacity uint) *Stack { type Pair (line 109) | type Pair struct function IsValid (line 126) | func IsValid(s string) bool { function main (line 146) | func main() { FILE: Stacks/is_palindrome.go function IsPalindrome (line 5) | func IsPalindrome(s string) bool { FILE: Stacks/next_greater_element.go function NextGreaterElement (line 53) | func NextGreaterElement(array []int) []int { FILE: Stacks/next_greater_element.java class NextGreaterElement (line 51) | public class NextGreaterElement { method nextGreaterElement (line 52) | public int[] nextGreaterElement(int[] array) { FILE: Stacks/next_greater_element.js function nextGreaterElement (line 49) | function nextGreaterElement(array) { FILE: Stacks/next_greater_element.py function next_greater_element (line 49) | def next_greater_element(array): FILE: Stacks/queue using stack.go type Queue (line 7) | type Queue struct method Enqueue (line 13) | func (q *Queue) Enqueue(value int) { method Dequeue (line 18) | func (q *Queue) Dequeue() int { function main (line 40) | func main() { FILE: Stacks/queue using stack.java class MyQueue (line 51) | class MyQueue method push (line 56) | public void push(int x) method pop (line 69) | public int pop() method peek (line 74) | public int peek() method empty (line 79) | public boolean empty() method main (line 83) | public static void main(String[] args) FILE: Stacks/queue using stack.js class Queue (line 2) | class Queue { method constructor (line 3) | constructor() { method enqueue (line 8) | enqueue(value) { method dequeue (line 13) | dequeue() { FILE: Stacks/queue using stack.py class Queue (line 2) | class Queue: method __init__ (line 3) | def __init__(self): method enqueue (line 7) | def enqueue(self, value): method dequeue (line 11) | def dequeue(self): FILE: Stacks/queue_using_stacks.cpp type Queue (line 24) | struct Queue { method enQueue (line 28) | void enQueue(int x) method deQueue (line 34) | int deQueue() function main (line 62) | int main() FILE: Stacks/reverse_polish_notation.cpp class Solution (line 44) | class Solution { method evalRPN (line 46) | int evalRPN(vector& tokens) { FILE: Stacks/stack.cpp class Stack (line 15) | class Stack { method Stack (line 20) | Stack() { method push (line 25) | void push(int x) { method pop (line 34) | int pop() { method peek (line 45) | int peek() { method isEmpty (line 54) | bool isEmpty() { function main (line 59) | int main() { FILE: Stacks/stack.go type Stack (line 8) | type Stack method IsEmpty (line 11) | func (s *Stack) IsEmpty() bool { method Push (line 16) | func (s *Stack) Push(str string) { method Pop (line 21) | func (s *Stack) Pop() (string, bool) { function main (line 31) | func main() { FILE: Stacks/stack.java class Stack (line 8) | public class Stack { method Stack (line 15) | public Stack(int capacity) { method push (line 23) | public void push(T element) { method pop (line 36) | public T pop() { method peek (line 51) | public T peek() { method isEmpty (line 62) | public boolean isEmpty() { method size (line 67) | public int size() { FILE: Stacks/stack.js class Stack (line 14) | class Stack { method constructor (line 15) | constructor() { method push (line 20) | push(element) { method pop (line 25) | pop() { method peek (line 32) | peek() { method isEmpty (line 39) | isEmpty() { method printStack (line 44) | printStack() { FILE: Stacks/stack.py class Stack (line 13) | class Stack: method __init__ (line 17) | def __init__(self): method is_empty (line 23) | def is_empty(self): method push (line 32) | def push(self, item): method pop (line 41) | def pop(self): method peek (line 55) | def peek(self): method size (line 69) | def size(self): FILE: Stacks/stack_array_based.go type Stack (line 11) | type Stack struct method Init (line 18) | func (stack *Stack) Init(capacity uint) *Stack { method IsFull (line 32) | func (stack *Stack) IsFull() bool { method IsEmpty (line 39) | func (stack *Stack) IsEmpty() bool { method Size (line 46) | func (stack *Stack) Size() uint { method Push (line 53) | func (stack *Stack) Push(data interface{}) error { method Pop (line 65) | func (stack *Stack) Pop() (interface{}, error) { method Peek (line 77) | func (stack *Stack) Peek() (interface{}, error) { method Drain (line 88) | func (stack *Stack) Drain() { function NewStack (line 26) | func NewStack(capacity uint) *Stack { function main (line 93) | func main() { FILE: Stacks/stack_dynamic_array.go type Stack (line 13) | type Stack struct method Init (line 20) | func (stack *Stack) Init(capacity uint) *Stack { method Size (line 34) | func (stack *Stack) Size() uint { method IsFull (line 40) | func (stack *Stack) IsFull() bool { method IsEmpty (line 47) | func (stack *Stack) IsEmpty() bool { method Resize (line 54) | func (stack *Stack) Resize() { method Push (line 69) | func (stack *Stack) Push(data interface{}) error { method Pop (line 81) | func (stack *Stack) Pop() (interface{}, error) { method Peek (line 96) | func (stack *Stack) Peek() (interface{}, error) { method Drain (line 107) | func (stack *Stack) Drain() { function NewStack (line 28) | func NewStack(capacity uint) *Stack { function IsOperator (line 113) | func IsOperator(c uint8) bool { function IsOperand (line 117) | func IsOperand(c uint8) bool { function GetOperatorWeight (line 121) | func GetOperatorWeight(op string) int { function ToPostfix (line 129) | func ToPostfix(s string) string { function HasHigherPrecedence (line 156) | func HasHigherPrecedence(op1 string, op2 string) bool { function main (line 162) | func main() { FILE: Stacks/stack_linked_list.go type Stack (line 5) | type Stack struct method Length (line 16) | func (s *Stack) Length() int { method Push (line 23) | func (s *Stack) Push(data interface{}) { method IsEmpty (line 31) | func (s *Stack) IsEmpty() bool { method IsFull (line 37) | func (s *Stack) IsFull() bool { method Pop (line 43) | func (s *Stack) Pop() (data interface{}) { method Peek (line 55) | func (s *Stack) Peek() (data interface{}) { type ListNode (line 10) | type ListNode struct function main (line 64) | func main() { FILE: Stacks/stack_using_queue.cpp class StackUsingQueues (line 5) | class StackUsingQueues { method StackUsingQueues (line 7) | StackUsingQueues() {} method push (line 10) | void push(int x) { method pop (line 16) | int pop() { method top (line 41) | int top() { method isEmpty (line 55) | bool isEmpty() { function main (line 64) | int main() { FILE: Stacks/stack_using_queue.go type Stack (line 10) | type Stack struct method Push (line 24) | func (s *Stack) Push(value int) { method Pop (line 30) | func (s *Stack) Pop() int { method Top (line 48) | func (s *Stack) Top() int { method IsEmpty (line 59) | func (s *Stack) IsEmpty() bool { function NewStack (line 16) | func NewStack() *Stack { function main (line 63) | func main() { FILE: Stacks/stack_using_queue.java class StackUsingQueues (line 5) | public class StackUsingQueues { method StackUsingQueues (line 9) | public StackUsingQueues() { method push (line 14) | public void push(int value) { method pop (line 19) | public int pop() { method top (line 40) | public int top() { method isEmpty (line 53) | public boolean isEmpty() { method main (line 57) | public static void main(String[] args) { FILE: Stacks/stack_using_queue.js class StackUsingQueues (line 2) | class StackUsingQueues { method constructor (line 3) | constructor() { method push (line 9) | push(x) { method pop (line 15) | pop() { method top (line 35) | top() { method isEmpty (line 49) | isEmpty() { FILE: Stacks/stack_using_queue.py class MyStack (line 41) | class MyStack: method __init__ (line 43) | def __init__(self): method push (line 49) | def push(self, x: int) -> None: method pop (line 56) | def pop(self) -> int: method top (line 62) | def top(self) -> int: method empty (line 68) | def empty(self) -> bool: FILE: Stacks/stacks_API.cpp class Stack (line 18) | class Stack { method Stack (line 24) | Stack() : sequenceNumber(0) {} method push (line 26) | void push(int value) { method pop (line 30) | int pop() { method top (line 40) | int top() const { method empty (line 48) | bool empty() const { function main (line 53) | int main() { FILE: Stacks/stacks_using_queues.java class StackUsingQueues (line 26) | public class StackUsingQueues { method push (line 35) | public void push(int x) { method pop (line 41) | public int pop() { method peek (line 57) | public int peek() { method isEmpty (line 62) | public boolean isEmpty() { method main (line 67) | public static void main(String[] args) { FILE: Stacks/stacks_with_queues.cpp class MyStack (line 20) | class MyStack { method MyStack (line 26) | MyStack() { method push (line 30) | void push(int x) { method pop (line 44) | int pop() { method top (line 54) | int top() { method empty (line 62) | bool empty() { FILE: Stacks/stacks_with_queues.py class Stack (line 26) | class Stack: method __init__ (line 31) | def __init__(self): method push (line 38) | def push(self, item): method pop (line 52) | def pop(self): method top (line 62) | def top(self): method is_empty (line 72) | def is_empty(self): method size (line 78) | def size(self): FILE: Stacks/valid_parentheses.cpp class Solution (line 29) | class Solution { method Are_pair (line 31) | bool Are_pair(char opening, char closing){ method isValid (line 37) | bool isValid(string s) { FILE: Strings/Dp_plaindrome.py function find_min_insertion_steps (line 1) | def find_min_insertion_steps(s): FILE: Strings/KMP.go function computeLPSArray (line 8) | func computeLPSArray(pattern string) []int { function KMPSearch (line 33) | func KMPSearch(text, pattern string) []int { function main (line 64) | func main() { FILE: Strings/Longest_palindromic_substring.py class Solution (line 17) | class Solution: method __init__ (line 23) | def __init__(self): method CheckLeftRight (line 26) | def CheckLeftRight(self, s, index, value): method longestPalindrome (line 37) | def longestPalindrome(self, s: str) -> str: FILE: Strings/MaxConcatenatedstr.java class Solution (line 1) | class Solution { method solve (line 2) | public: method maxLength (line 44) | int maxLength(vector& arr) { FILE: Strings/Min_palindrome.js function minInsertionStepsToPalindrome (line 1) | function minInsertionStepsToPalindrome(str) { FILE: Strings/check panagram.java class Abhay (line 23) | class Abhay { method isLetter (line 28) | static boolean isLetter(char ch) method allLetter (line 39) | static boolean allLetter(String str, method main (line 79) | public static void main(String args[]) FILE: Strings/check_anagrams.java class CheckAnagrams (line 44) | public class CheckAnagrams { method main (line 45) | public static void main(String[] args) { method solve (line 53) | public static int solve(String string1, String string2) { FILE: Strings/check_palindrome.cpp function palindrome_checker (line 9) | int palindrome_checker(string str) // palindrome checker function function main (line 25) | int main() FILE: Strings/check_permutations.cpp function check_permutations (line 7) | bool check_permutations(string a, string b){ function main (line 25) | int main(){ FILE: Strings/count_occurances.java class CountOccurrences (line 47) | public class CountOccurrences { method main (line 48) | public static void main(String[] args) { method solve (line 54) | public static int solve(String string) { FILE: Strings/group_anagrams.cpp function sortWord (line 33) | std::string sortWord(const std::string& word) { function GroupAnagrams (line 40) | std::vector> GroupAnagrams(const std::vector> groupAnagrams(String[] words) { method sortWord (line 58) | private String sortWord(String word) { method main (line 69) | public static void main(String[] args) { FILE: Strings/group_anagrams.js function sortWord (line 26) | function sortWord(word) { function groupAnagrams (line 31) | function groupAnagrams(words) { FILE: Strings/group_anagrams.py function sortWord (line 29) | def sortWord(word: str) -> str: function GroupAnagrams (line 33) | def GroupAnagrams(words: List[str]) -> List[List[str]]: FILE: Strings/is_pallindrome.cpp function isPalindrome (line 32) | bool isPalindrome(string str) { function main (line 46) | int main() { FILE: Strings/is_pallindrome.go function IsPalindrome (line 13) | func IsPalindrome(str string) bool { function main (line 28) | func main() { FILE: Strings/is_pallindrome.java method isPalindrome (line 28) | public static boolean isPalindrome(String str) { FILE: Strings/is_pallindrome.js function isPalindrome (line 25) | function isPalindrome(str) { FILE: Strings/is_pallindrome.py function is_palindrome (line 17) | def is_palindrome(s: str) -> bool: FILE: Strings/is_unique.cpp function isUniqueUsingBitVector (line 19) | bool isUniqueUsingBitVector(const std::string& s) { function main (line 32) | int main() { FILE: Strings/is_unique.go function is_unique_normal (line 12) | func is_unique_normal(s string) bool { function IsUniqueUsingBitVector (line 28) | func IsUniqueUsingBitVector(s string) bool { function main (line 40) | func main() { FILE: Strings/is_unique.java class Main (line 15) | public class Main { method isUniqueUsingBitVector (line 16) | public static boolean isUniqueUsingBitVector(String s) { method main (line 29) | public static void main(String[] args) { FILE: Strings/is_unique.js function isUniqueUsingBitVector (line 17) | function isUniqueUsingBitVector(s) { FILE: Strings/is_unique.py function is_unique_using_bit_vector (line 13) | def is_unique_using_bit_vector(s): FILE: Strings/length_of_longest_substring.java class Solution (line 23) | class Solution { method lengthOfLongestSubstring (line 24) | public int lengthOfLongestSubstring(String s) { FILE: Strings/longest palindromic substring.java class Solution (line 35) | class Solution { method longestPalindrome (line 39) | public String longestPalindrome(String s) { method expandPalindrome (line 53) | public void expandPalindrome(char[] s, int j, int k) { method main (line 64) | public static void main(String[] args) { FILE: Strings/longest_common_prefix.cpp class Solution (line 30) | class Solution { method string (line 32) | string longestCommonPrefix(vector& strs) { FILE: Strings/longest_string.cpp class Solution (line 12) | class Solution { method longestPalindrome (line 20) | std::string longestPalindrome(std::string s) { FILE: Strings/one_edit.cpp function OneEdit (line 47) | bool OneEdit(string stringOne, string stringTwo) { function main (line 77) | int main() { FILE: Strings/one_edit.go function OneEdit (line 45) | func OneEdit(stringOne string, stringTwo string) bool { function abs (line 75) | func abs(a int) int { function min (line 82) | func min(a, b int) int { FILE: Strings/one_edit.java class Main (line 43) | public class Main { method main (line 44) | public static void main(String[] args) { method isOneEdit (line 55) | public static boolean isOneEdit(String stringOne, String stringTwo) { FILE: Strings/one_edit.js function isOneEdit (line 43) | function isOneEdit(stringOne, stringTwo) { FILE: Strings/one_edit.py function OneEdit (line 42) | def OneEdit(stringOne, stringTwo): function abs (line 67) | def abs(a): function min (line 72) | def min(a, b): FILE: Strings/plaindrome_str.cpp function isPalindrome (line 6) | bool isPalindrome(string s, int start, int end) { function partitionPalindrome (line 17) | vector> partitionPalindrome(string s) { function backtrack (line 26) | void backtrack(string s, int start, vector& current, vector bool: FILE: Strings/well_formed_parentheses.cpp class Solution (line 15) | class Solution { method solve (line 19) | void solve(string s,int count) method generateParenthesis (line 29) | vector generateParenthesis(int n) { FILE: Strings/well_formed_parentheses.java class Solution (line 25) | class Solution { method generateParenthesis (line 28) | public List generateParenthesis(int n) { method isValid (line 94) | public boolean isValid(String s) { FILE: Strings/zigzag_conversion.cpp class Solution (line 35) | class Solution { method string (line 37) | string convert(string s, int numRows) { FILE: Trees/AVL/avl.go type AVLTreeNode (line 8) | type AVLTreeNode struct function Height (line 17) | func Height(node *AVLTreeNode) int { function SingleLeftRotate (line 27) | func SingleLeftRotate(X *AVLTreeNode) *AVLTreeNode { function SingleRightRotate (line 43) | func SingleRightRotate(X *AVLTreeNode) *AVLTreeNode { function DoubleRotateRightLeft (line 57) | func DoubleRotateRightLeft(Z *AVLTreeNode) *AVLTreeNode { function DoubleRotateLeftRight (line 63) | func DoubleRotateLeftRight(Z *AVLTreeNode) *AVLTreeNode { function main (line 68) | func main() { FILE: Trees/Binary Search Trees/Kth_Largest_Value_In_BST.py class Node (line 16) | class Node: method __init__ (line 18) | def __init__(self, val): function kthLargestUtil (line 24) | def kthLargestUtil(root, k, c): function kthLargest (line 46) | def kthLargest(root, k): function insert (line 56) | def insert(node, key): FILE: Trees/Binary Search Trees/Kth_largest_BST.cpp class Node (line 66) | class Node{ method Node (line 76) | Node(int item){ class BinaryTree (line 93) | class BinaryTree{ method traverseRL (line 102) | void traverseRL(Node* node, int k){ method BinaryTree (line 123) | BinaryTree(int root_data){ method Node (line 128) | Node* insertNode(Node* node, int data){ //insert a new node on the rig... method Node (line 141) | Node* getKthLargest(int k){ //get the kth largest data node function main (line 155) | int main() { FILE: Trees/Binary Search Trees/Kth_largest_BST.java class Node (line 4) | class Node { method Node (line 8) | Node(int data) { class BST (line 17) | class BST { method BST (line 20) | BST() { method kthLargest (line 34) | public int kthLargest(int k) { method kthLargestHelper (line 42) | private void kthLargestHelper(Node node, List result, int k) { method insert (line 58) | public void insert(int data) { method insertHelper (line 68) | private Node insertHelper(Node node, int data) { class KthLargestBST (line 85) | public class KthLargestBST { method main (line 86) | public static void main(String[] args) { FILE: Trees/Binary Search Trees/Kth_largest_BST.js class Node (line 4) | class Node { method constructor (line 5) | constructor(value) { class BST (line 15) | class BST { method constructor (line 16) | constructor() { method insert (line 24) | insert(value) { method insertNode (line 51) | insertNode(node, newNode) { method findKthLargest (line 72) | findKthLargest(k) { method inOrderTraversal (line 92) | inOrderTraversal(node, values) { FILE: Trees/Binary Search Trees/Validate_BST.cpp type Node (line 33) | struct Node { type Node (line 36) | struct Node method Node (line 38) | Node(int data) function validate (line 46) | bool validate(Node* root,long long int min , long long int max){ function isValidBST (line 64) | bool isValidBST(Node* root) { function main (line 72) | int main() FILE: Trees/Binary Search Trees/Validate_BST.java class validateBST (line 6) | class validateBST { class Node (line 7) | public static class Node { method Node (line 11) | public Node(int data) { method isBST (line 20) | static Boolean isBST(Node root) { method main (line 38) | public static void main(String[] args) { FILE: Trees/Binary Search Trees/Validate_BST.js class Node (line 37) | class Node { method constructor (line 38) | constructor(data) { function isBST (line 46) | function isBST(root) { FILE: Trees/Binary Search Trees/Validate_BST.py class Node (line 37) | class Node: method __init__ (line 38) | def __init__(self, data): function is_bst (line 45) | def is_bst(root): FILE: Trees/Binary Search Trees/bst.go type BSTNode (line 26) | type BSTNode struct function ConstructBST (line 33) | func ConstructBST(n, k int) *BSTNode { function Insert (line 42) | func Insert(root *BSTNode, data int) *BSTNode { function SearchElementRecursive (line 59) | func SearchElementRecursive(root *BSTNode, data int) *BSTNode { function SearchElementNonRecursive (line 76) | func SearchElementNonRecursive(root *BSTNode, data int) *BSTNode { function FindMinRecursive (line 96) | func FindMinRecursive(root *BSTNode) *BSTNode { function FindMinNonRecursive (line 110) | func FindMinNonRecursive(root *BSTNode) *BSTNode { function FindMaxRecursive (line 124) | func FindMaxRecursive(root *BSTNode) *BSTNode { function FindMaxNonRecursive (line 138) | func FindMaxNonRecursive(root *BSTNode) *BSTNode { function DeleteMin (line 147) | func DeleteMin(root *BSTNode) *BSTNode{ function DeleteFromBST (line 157) | func DeleteFromBST(root *BSTNode, data int) *BSTNode { function PreOrder (line 207) | func PreOrder(root *BSTNode) { function InOrder (line 216) | func InOrder(root *BSTNode) { function IsBST (line 226) | func IsBST(root *BSTNode) bool { function IsBSTOptimal (line 247) | func IsBSTOptimal(root *BSTNode, min, max int) bool { function IsBSTInorder (line 263) | func IsBSTInorder(root *BSTNode, prev *int) bool { function Helper (line 283) | func Helper(Arr []int, low int, high int) *BSTNode { function ConvertSortedArrayToBST (line 301) | func ConvertSortedArrayToBST(Arr []int) *BSTNode { function kthSmallest (line 309) | func kthSmallest(root *BSTNode, k int) *BSTNode { function helperKthSmallest (line 317) | func helperKthSmallest(root *BSTNode, k int, counter *int) *BSTNode { function FloorInBST (line 337) | func FloorInBST(root *BSTNode, key int) *BSTNode { function CeilInBST (line 359) | func CeilInBST(root *BSTNode, key int) *BSTNode { function RangePrintBST (line 379) | func RangePrintBST(root *BSTNode, start int, end int) { function RangePrintQueueBST (line 401) | func RangePrintQueueBST(root *BSTNode, start, end int) { function CountTrees (line 435) | func CountTrees(n int) int { function main (line 451) | func main() { FILE: Trees/Binary Search Trees/find_closest_value.cpp class BST (line 32) | class BST { method BST (line 38) | BST(int val) { method findClosestValue (line 44) | int findClosestValue(int target) { method findClosestValueHelper (line 50) | int findClosestValueHelper(int target, int closest) { function main (line 70) | int main() { FILE: Trees/Binary Search Trees/find_closest_value.go type BST (line 32) | type BST struct method FindClosestValue (line 39) | func (tree *BST) FindClosestValue(target int) int { method findClosestValue (line 44) | func (tree *BST) findClosestValue(target, closest int) int { function absDiff (line 58) | func absDiff(a, b int) int { FILE: Trees/Binary Search Trees/find_closest_value.js class BST (line 30) | class BST { method constructor (line 31) | constructor(value) { method findClosestValue (line 37) | findClosestValue(target) { method _findClosestValueHelper (line 42) | _findClosestValueHelper(target, closest) { FILE: Trees/Binary Search Trees/find_closest_value.py class BST (line 30) | class BST: method __init__ (line 31) | def __init__(self, value): method find_closest_value (line 36) | def find_closest_value(self, target): method _find_closest_value_helper (line 40) | def _find_closest_value_helper(self, target, closest): FILE: Trees/Binary Search Trees/insert_into_bst.cpp class Node (line 18) | class Node{ method Node (line 24) | Node(int x){ function bfs (line 30) | void bfs(Node* root){ function Node (line 56) | Node* insert_into_binary_search_tree(Node* root, int data){ method Node (line 24) | Node(int x){ function Node (line 68) | Node* build_binary_search_tree(){ method Node (line 24) | Node(int x){ function inorder (line 78) | void inorder(Node*root){ function pre_order (line 85) | void pre_order(Node*root){ function post_order (line 92) | void post_order(Node*root){ function main (line 99) | int main(){ FILE: Trees/Binary Search Trees/kth_largest.go type BST (line 6) | type BST struct function FindKthLargestValueInBst (line 13) | func FindKthLargestValueInBst(tree *BST, k int) int { function inOrderTraverse (line 19) | func inOrderTraverse(tree *BST, sortedValues *[]int) { type treeInfo (line 76) | type treeInfo struct function FindKthLargestValueInBst2 (line 82) | func FindKthLargestValueInBst2(tree *BST, k int) int { function reverseInOrderTraverse (line 90) | func reverseInOrderTraverse(tree *BST, k int, treeInfo *treeInfo) { FILE: Trees/Binary Search Trees/min_height_BST.cpp type TreeNode (line 87) | struct TreeNode { method TreeNode (line 92) | TreeNode(int x) : value(x), left(nullptr), right(nullptr) {} function TreeNode (line 95) | TreeNode* minHeightBST(std::vector& array) { method TreeNode (line 92) | TreeNode(int x) : value(x), left(nullptr), right(nullptr) {} function TreeNode (line 100) | TreeNode* constructMinHeightBST(std::vector& array, TreeNode* bst, ... method TreeNode (line 92) | TreeNode(int x) : value(x), left(nullptr), right(nullptr) {} class BST (line 120) | class BST { method BST (line 126) | BST(int x) : value(x), left(nullptr), right(nullptr) {} method insert (line 128) | void insert(int value) { function main (line 145) | int main() { function deleteTree (line 157) | void deleteTree(TreeNode* root) { FILE: Trees/Binary Search Trees/min_height_BST.go function MinHeightBST (line 86) | func MinHeightBST(array []int) *BST { function constructMinHeightBST (line 91) | func constructMinHeightBST(array []int, bst *BST, start int, end int) *B... type BST (line 109) | type BST struct method Insert (line 116) | func (tree *BST) Insert(value int) *BST { FILE: Trees/Binary Search Trees/min_height_BST.java class JuiceBottling (line 84) | public class JuiceBottling { method juiceBottling (line 86) | public static int[] juiceBottling(int[] prices) { method main (line 118) | public static void main(String[] args) { FILE: Trees/Binary Search Trees/min_height_BST.js class TreeNode (line 84) | class TreeNode { method constructor (line 85) | constructor(value) { function minHeightBST (line 93) | function minHeightBST(array) { function constructMinHeightBST (line 99) | function constructMinHeightBST(array, bst, start, end) { class BST (line 120) | class BST { method constructor (line 121) | constructor(value) { method insert (line 127) | insert(value) { FILE: Trees/Binary Search Trees/min_height_BST.py class TreeNode (line 82) | class TreeNode: method __init__ (line 83) | def __init__(self, value): function min_height_bst (line 88) | def min_height_bst(array): function construct_min_height_bst (line 92) | def construct_min_height_bst(array, bst, start, end): class BST (line 109) | class BST: method __init__ (line 110) | def __init__(self, value): method insert (line 115) | def insert(self, value): FILE: Trees/Binary Search Trees/reconstruct_bst.cpp type TreeNode (line 51) | struct TreeNode { method TreeNode (line 55) | TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} class TreeInfo (line 59) | class TreeInfo { method TreeInfo (line 62) | TreeInfo(int idx) : rootIdx(idx) {} function TreeNode (line 66) | TreeNode* reconstructBst(std::vector& preOrderTraversalValues) { method TreeNode (line 55) | TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} function TreeNode (line 75) | TreeNode* reconstructBstFromRange(int lowerBound, int upperBound, std::v... method TreeNode (line 55) | TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} function deleteBst (line 107) | void deleteBst(TreeNode* root) { function main (line 116) | int main() { FILE: Trees/Binary Search Trees/reconstruct_bst.go type BST (line 83) | type BST struct function ReconstructBst (line 91) | func ReconstructBst(preOrderTraversalValues []int) *BST { type treeInfo (line 122) | type treeInfo struct function ReconstructBst2 (line 127) | func ReconstructBst2(preOrderTraversalValues []int) *BST { function reconstructBSTFromRange (line 136) | func reconstructBSTFromRange(lowerBound, upperBound int, preOrderTravers... FILE: Trees/Binary Search Trees/reconstruct_bst.java class TreeNode (line 46) | class TreeNode { method TreeNode (line 51) | TreeNode(int x) { class TreeInfo (line 58) | class TreeInfo { method TreeInfo (line 61) | TreeInfo(int idx) { class ReconstructBST (line 66) | public class ReconstructBST { method reconstructBst (line 68) | public static TreeNode reconstructBst(int[] preOrderTraversalValues) { method reconstructBstFromRange (line 76) | private static TreeNode reconstructBstFromRange(int lowerBound, int up... method main (line 107) | public static void main(String[] args) { FILE: Trees/Binary Search Trees/reconstruct_bst.js class TreeNode (line 26) | class TreeNode { method constructor (line 31) | constructor(value) { function constructBST (line 43) | function constructBST(preorder) { function printInOrder (line 78) | function printInOrder(node) { FILE: Trees/Binary Search Trees/reconstruct_bst.py class TreeNode (line 46) | class TreeNode: method __init__ (line 47) | def __init__(self, val): class TreeInfo (line 52) | class TreeInfo: method __init__ (line 53) | def __init__(self, root_idx): function reconstruct_bst (line 56) | def reconstruct_bst(pre_order_traversal_values): function reconstruct_bst_from_range (line 63) | def reconstruct_bst_from_range(lower_bound, upper_bound, pre_order_trave... FILE: Trees/Binary Search Trees/search.cpp class Node (line 19) | class Node{ method Node (line 25) | Node(int x){ function bfs (line 31) | void bfs(Node* root){ function Node (line 57) | Node* insert_into_binary_search_tree(Node* root, int data){ method Node (line 25) | Node(int x){ function Node (line 69) | Node* build_binary_search_tree(){ method Node (line 25) | Node(int x){ function search_in_BST (line 79) | bool search_in_BST(Node* root, int value_to_be_searched){ function main (line 91) | int main(){ FILE: Trees/Binary Search Trees/validate_bst.go type BST (line 41) | type BST struct method ValidateBst (line 49) | func (tree *BST) ValidateBst() bool { method validateBST (line 56) | func (tree *BST) validateBST(min, max int) bool { FILE: Trees/Binary Trees/Trie.js class Trie (line 38) | class Trie { method constructor (line 39) | constructor() { method insert (line 43) | insert(word) { method search (line 47) | search(word) { method startsWith (line 51) | startsWith(prefix) { class Node (line 56) | class Node { method constructor (line 57) | constructor() { method insert (line 63) | insert(word, idx) { method search (line 75) | search(word, idx) { method startsWith (line 85) | startsWith(prefix, idx) { FILE: Trees/Binary Trees/bfs.cpp class Node (line 22) | class Node{ method Node (line 28) | Node(int x){ function Node (line 33) | Node* build_binary_tree(){ method Node (line 28) | Node(int x){ function bfs (line 43) | void bfs(Node* root){ function main (line 59) | int main(){ FILE: Trees/Binary Trees/bfs.go type Node (line 38) | type Node struct method BreadthFirstSearch (line 46) | func (n *Node) BreadthFirstSearch(array []string) []string { FILE: Trees/Binary Trees/binary_tree.go type BinaryTreeNode (line 29) | type BinaryTreeNode struct function NewBinaryTree (line 35) | func NewBinaryTree(n, k int) *BinaryTreeNode { function Insert (line 43) | func Insert(root *BinaryTreeNode, v int) *BinaryTreeNode { function PreOrder (line 67) | func PreOrder(root *BinaryTreeNode) { function InOrder (line 83) | func InOrder(root *BinaryTreeNode) { function PostOrder (line 97) | func PostOrder(root *BinaryTreeNode) { function main (line 108) | func main() { FILE: Trees/Binary Trees/branch_sum.go type BinaryTree (line 23) | type BinaryTree struct function BranchSums (line 29) | func BranchSums(root *BinaryTree) []int { function calculateBranchSums (line 43) | func calculateBranchSums(node *BinaryTree, runningSum int, sums *[]int) { FILE: Trees/Binary Trees/build_tree_preorder.cpp class Node (line 5) | class Node{ method Node (line 11) | Node(int x){ function Node (line 19) | Node* build_binary_tree(){ method Node (line 11) | Node(int x){ function print_binary_tree (line 30) | void print_binary_tree(Node* root){ function main (line 38) | int main(){ FILE: Trees/Binary Trees/calculate_size.go type BinaryTreeNode (line 4) | type BinaryTreeNode struct function Size (line 12) | func Size(root *BinaryTreeNode) int { function SizeWithoutUsingRecursion (line 22) | func SizeWithoutUsingRecursion(root *BinaryTreeNode) int { FILE: Trees/Binary Trees/count_nodes.cpp class Node (line 21) | class Node{ method Node (line 27) | Node(int d){ function Node (line 31) | Node* build_binary_tree(){ method Node (line 27) | Node(int d){ function count_number_of_nodes (line 42) | int count_number_of_nodes(Node* root){ function main (line 47) | int main(){ FILE: Trees/Binary Trees/delete.go type BinaryTreeNode (line 4) | type BinaryTreeNode struct function DeleteTree (line 13) | func DeleteTree(root *BinaryTreeNode) *BinaryTreeNode { FILE: Trees/Binary Trees/dfs.cpp type Node (line 32) | struct Node { function DFS (line 38) | void DFS(Node* node) { function dfsHelper (line 47) | void dfsHelper(Node* node, unordered_map& visited) { function main (line 63) | int main() { FILE: Trees/Binary Trees/dfs.go type Node (line 30) | type Node struct function DFS (line 36) | func DFS(node *Node) { function dfsHelper (line 45) | func dfsHelper(node *Node, visited map[*Node]bool) { function main (line 61) | func main() { FILE: Trees/Binary Trees/dfs.java class Node (line 31) | class Node { method Node (line 35) | public Node(int value) { class DepthFirstSearch (line 42) | class DepthFirstSearch { method DFS (line 43) | public static void DFS(Node node) { method dfsHelper (line 52) | private static void dfsHelper(Node node, Set visited) { class Main (line 69) | public class Main { method main (line 70) | public static void main(String[] args) { FILE: Trees/Binary Trees/dfs.js class Node (line 26) | class Node { method constructor (line 27) | constructor(value) { function DFS (line 34) | function DFS(node) { function dfsHelper (line 43) | function dfsHelper(node, visited) { FILE: Trees/Binary Trees/dfs.py class Node (line 27) | class Node: method __init__ (line 28) | def __init__(self, value): function DFS (line 33) | def DFS(node): function dfsHelper (line 41) | def dfsHelper(node, visited): FILE: Trees/Binary Trees/diameter.cpp type BinaryTree (line 54) | struct BinaryTree { type TreeInfo (line 60) | struct TreeInfo { function BinaryTreeDiameter (line 66) | int BinaryTreeDiameter(BinaryTree* tree) { function TreeInfo (line 71) | TreeInfo getTreeInfo(BinaryTree* tree) { function max (line 98) | int max(int a, int b) { function main (line 102) | int main() { FILE: Trees/Binary Trees/diameter.go type BinaryTree (line 55) | type BinaryTree struct type TreeInfo (line 62) | type TreeInfo struct function BinaryTreeDiameter (line 68) | func BinaryTreeDiameter(tree *BinaryTree) int { function getTreeInfo (line 73) | func getTreeInfo(tree *BinaryTree) TreeInfo { function max (line 100) | func max(a, b int) int { FILE: Trees/Binary Trees/diameter.java class BinaryTree (line 52) | public class BinaryTree { method BinaryTree (line 57) | public BinaryTree(int value) { class TreeInfo (line 64) | class TreeInfo { method TreeInfo (line 68) | public TreeInfo(int height, int diameter) { class Main (line 74) | public class Main { method binaryTreeDiameter (line 76) | public static int binaryTreeDiameter(BinaryTree tree) { method getTreeInfo (line 81) | private static TreeInfo getTreeInfo(BinaryTree tree) { method main (line 107) | public static void main(String[] args) { FILE: Trees/Binary Trees/diameter.js class BinaryTree (line 52) | class BinaryTree { method constructor (line 53) | constructor(value) { class TreeInfo (line 60) | class TreeInfo { method constructor (line 61) | constructor(height, diameter) { function binaryTreeDiameter (line 67) | function binaryTreeDiameter(tree) { function getTreeInfo (line 71) | function getTreeInfo(tree) { FILE: Trees/Binary Trees/diameter.py class BinaryTree (line 52) | class BinaryTree: method __init__ (line 53) | def __init__(self, value): class TreeInfo (line 58) | class TreeInfo: method __init__ (line 59) | def __init__(self, height, diameter): function binary_tree_diameter (line 63) | def binary_tree_diameter(tree): function get_tree_info (line 66) | def get_tree_info(tree): FILE: Trees/Binary Trees/find_branch_sum.go type BinaryTree (line 33) | type BinaryTree struct function BranchSums (line 39) | func BranchSums(root *BinaryTree) []int { function calculateBranchSums (line 45) | func calculateBranchSums(node *BinaryTree, runningSum int, sums *[]int) { FILE: Trees/Binary Trees/find_max.go type BinaryTreeNode (line 6) | type BinaryTreeNode struct function FindMax (line 16) | func FindMax(root *BinaryTreeNode) int { function FindMaxWithoutRecursion (line 36) | func FindMaxWithoutRecursion(root *BinaryTreeNode) int { FILE: Trees/Binary Trees/height.cpp class Node (line 20) | class Node{ method Node (line 26) | Node(int x){ function Node (line 30) | Node* build_binary_tree(){ method Node (line 26) | Node(int x){ function compute_height_of_binary_tree (line 40) | int compute_height_of_binary_tree(Node* root){ function main (line 48) | int main(){ FILE: Trees/Binary Trees/height.go type BinaryTreeNode (line 4) | type BinaryTreeNode struct function Height (line 13) | func Height(root *BinaryTreeNode) int { FILE: Trees/Binary Trees/height_balanced_binary_tree.cpp class BinaryTree (line 58) | class BinaryTree { method BinaryTree (line 64) | BinaryTree(int value) { class TreeInfo (line 72) | class TreeInfo { method TreeInfo (line 77) | TreeInfo(bool isBalanced, int height) { function heightBalancedBinaryTree (line 84) | bool heightBalancedBinaryTree(BinaryTree* tree) { function TreeInfo (line 93) | TreeInfo getTreeInfo(BinaryTree* tree) { method TreeInfo (line 77) | TreeInfo(bool isBalanced, int height) { function BinaryTree (line 115) | BinaryTree* createBinaryTree(int value) { method BinaryTree (line 64) | BinaryTree(int value) { function main (line 120) | int main() { FILE: Trees/Binary Trees/height_balanced_binary_tree.go type BinaryTree (line 59) | type BinaryTree struct type TreeeInfo (line 66) | type TreeeInfo struct function HeightBalancedBinaryTree (line 72) | func HeightBalancedBinaryTree(tree *BinaryTree) bool { function getTreeInfo (line 81) | func getTreeInfo(tree *BinaryTree) TreeeInfo { function max (line 106) | func max(a, b int) int { function abs (line 114) | func abs(a int) int { function main (line 121) | func main() { FILE: Trees/Binary Trees/height_balanced_binary_tree.java class BinaryTree (line 55) | class BinaryTree { method BinaryTree (line 60) | BinaryTree(int value) { class TreeInfo (line 68) | class TreeInfo { method TreeInfo (line 72) | TreeInfo(boolean isBalanced, int height) { class HeightBalancedBinaryTree (line 79) | class HeightBalancedBinaryTree { method heightBalancedBinaryTree (line 80) | public static boolean heightBalancedBinaryTree(BinaryTree tree) { method getTreeInfo (line 89) | private static TreeInfo getTreeInfo(BinaryTree tree) { method createBinaryTree (line 111) | private static BinaryTree createBinaryTree(int value) { method main (line 116) | public static void main(String[] args) { FILE: Trees/Binary Trees/height_balanced_binary_tree.js class BinaryTree (line 55) | class BinaryTree { method constructor (line 56) | constructor(value) { class TreeInfo (line 64) | class TreeInfo { method constructor (line 65) | constructor(isBalanced, height) { function heightBalancedBinaryTree (line 72) | function heightBalancedBinaryTree(tree) { function getTreeInfo (line 81) | function getTreeInfo(tree) { function createBinaryTree (line 105) | function createBinaryTree(value) { function main (line 110) | function main() { FILE: Trees/Binary Trees/height_balanced_binary_tree.py class BinaryTree (line 56) | class BinaryTree: method __init__ (line 57) | def __init__(self, value): class TreeInfo (line 62) | class TreeInfo: method __init__ (line 63) | def __init__(self, is_balanced, height): function height_balanced_binary_tree (line 68) | def height_balanced_binary_tree(tree): function get_tree_info (line 76) | def get_tree_info(tree): function max (line 96) | def max(a, b): function abs (line 100) | def abs(a): function main (line 104) | def main(): FILE: Trees/Binary Trees/inorder_traversal.cpp type TreeNode (line 21) | struct TreeNode { method TreeNode (line 25) | TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} class Solution (line 28) | class Solution { method inorderTraversal (line 30) | std::vector inorderTraversal(TreeNode* root) { function main (line 65) | int main() { FILE: Trees/Binary Trees/inorder_traversal.go type TreeNode (line 6) | type TreeNode struct function inorderTraversal (line 12) | func inorderTraversal(root *TreeNode) []int { function main (line 37) | func main() { FILE: Trees/Binary Trees/inorder_traversal.java class Solution (line 21) | class Solution { method inorderTraversal (line 22) | public List inorderTraversal(TreeNode root) { FILE: Trees/Binary Trees/inorder_traversal.js class TreeNode (line 1) | class TreeNode { method constructor (line 2) | constructor(val) { class Solution (line 8) | class Solution { method inorderTraversal (line 9) | inorderTraversal(root) { FILE: Trees/Binary Trees/inorder_traversal.py class TreeNode (line 1) | class TreeNode: method __init__ (line 2) | def __init__(self, val): class Solution (line 6) | class Solution: method inorderTraversal (line 7) | def inorderTraversal(self, root): FILE: Trees/Binary Trees/invert.cpp class BinaryTreeNode (line 4) | class BinaryTreeNode { method BinaryTreeNode (line 10) | BinaryTreeNode(int val) : data(val), left(nullptr), right(nullptr) {} function BinaryTreeNode (line 13) | BinaryTreeNode* invertTree(BinaryTreeNode* root) { method BinaryTreeNode (line 10) | BinaryTreeNode(int val) : data(val), left(nullptr), right(nullptr) {} function BinaryTreeNode (line 21) | BinaryTreeNode* invertTree2(BinaryTreeNode* root) { method BinaryTreeNode (line 10) | BinaryTreeNode(int val) : data(val), left(nullptr), right(nullptr) {} function main (line 34) | int main() { FILE: Trees/Binary Trees/invert.go type BinaryTreeNode (line 4) | type BinaryTreeNode struct function InvertTree (line 14) | func InvertTree(root *BinaryTreeNode) *BinaryTreeNode { function InvertTree2 (line 23) | func InvertTree2(root *BinaryTreeNode) *BinaryTreeNode { FILE: Trees/Binary Trees/invert.java class BinaryTreeNode (line 1) | class BinaryTreeNode { method BinaryTreeNode (line 5) | public BinaryTreeNode(int data) { class BinaryTreeInverter (line 11) | public class BinaryTreeInverter { method invertTree (line 17) | public BinaryTreeNode invertTree(BinaryTreeNode root) { method invertTree2 (line 27) | public BinaryTreeNode invertTree2(BinaryTreeNode root) { method main (line 42) | public static void main(String[] args) { FILE: Trees/Binary Trees/invert.js class BinaryTreeNode (line 1) | class BinaryTreeNode { method constructor (line 2) | constructor(data) { class BinaryTreeInverter (line 8) | class BinaryTreeInverter { method invertTree (line 14) | invertTree(root) { method invertTree2 (line 24) | invertTree2(root) { method main (line 40) | static main() { FILE: Trees/Binary Trees/invert.py class BinaryTreeNode (line 2) | class BinaryTreeNode: method __init__ (line 3) | def __init__(self, data): function invert_tree (line 8) | def invert_tree(root): function invert_tree2 (line 13) | def invert_tree2(root): FILE: Trees/Binary Trees/is_symmetric.cpp class BinaryTree (line 41) | class BinaryTree { function SymmetricalTreeRecursive (line 49) | bool SymmetricalTreeRecursive(BinaryTree* tree) { function treesAreMirrored (line 55) | bool treesAreMirrored(BinaryTree* left, BinaryTree* right) { type BinaryTree (line 84) | struct BinaryTree { function SymmetricalTreeIterative (line 90) | bool SymmetricalTreeIterative(BinaryTree* tree) { function main (line 122) | int main() { FILE: Trees/Binary Trees/is_symmetric.go type BinaryTree (line 8) | type BinaryTree struct function SymmetricalTreerecursive (line 62) | func SymmetricalTreerecursive(tree *BinaryTree) bool { function treesAreMirrored (line 68) | func treesAreMirrored(left, right *BinaryTree) bool { function SymmetricalTreeIterative (line 114) | func SymmetricalTreeIterative(tree *BinaryTree) bool { FILE: Trees/Binary Trees/is_symmetric.java class BinaryTree (line 7) | public class BinaryTree { method isSymmetricalTreeIterative (line 10) | public boolean isSymmetricalTreeIterative(BinaryTree tree) { FILE: Trees/Binary Trees/is_symmetric.js class BinaryTree (line 5) | class BinaryTree { method constructor (line 6) | constructor(value, left = null, right = null) { function isSymmetricalTreeIterative (line 13) | function isSymmetricalTreeIterative(tree) { FILE: Trees/Binary Trees/is_symmetric.py class BinaryTree (line 5) | class BinaryTree: method __init__ (line 6) | def __init__(self, value, left=None, right=None): function is_symmetrical_tree_iterative (line 11) | def is_symmetrical_tree_iterative(tree): FILE: Trees/Binary Trees/level_by_level.cpp class Node (line 25) | class Node{ method Node (line 31) | Node(int x){ function Node (line 35) | Node* build_binary_tree(){ method Node (line 31) | Node(int x){ function bfs (line 46) | void bfs(Node* root){ function main (line 72) | int main(){ FILE: Trees/Binary Trees/level_order_traversal.cpp class Node (line 24) | class Node{ method Node (line 30) | Node(int x){ function Node (line 34) | Node* build_binary_tree(){ method Node (line 30) | Node(int x){ function compute_height_of_binary_tree (line 45) | int compute_height_of_binary_tree(Node* root){ function print_kth_level (line 52) | void print_kth_level(Node* root, int k){ function level_order_traversal (line 63) | void level_order_traversal(Node* root){ function main (line 70) | int main(){ FILE: Trees/Binary Trees/level_order_traversal.go type BinaryTreeNode (line 3) | type BinaryTreeNode struct function LevelOrder (line 16) | func LevelOrder(root *BinaryTreeNode) [][]int { FILE: Trees/Binary Trees/node_depth.go type BinaryTree (line 31) | type BinaryTree struct function NodeDepths (line 36) | func NodeDepths(root *BinaryTree) int { function nodeDepthHelper (line 40) | func nodeDepthHelper(root *BinaryTree, depth int) int { FILE: Trees/Binary Trees/postorder_traversal.cpp class Node (line 19) | class Node{ method Node (line 25) | Node(int x){ function Node (line 32) | Node* build_binary_tree(){ method Node (line 25) | Node(int x){ function print_binary_tree (line 43) | void print_binary_tree(Node* root){ function main (line 50) | int main(){ FILE: Trees/Binary Trees/preorder_traversal.cpp class Node (line 18) | class Node{ method Node (line 24) | Node(int x){ function Node (line 32) | Node* build_binary_tree(){ method Node (line 24) | Node(int x){ function print_binary_tree (line 43) | void print_binary_tree(Node* root){ function main (line 51) | int main(){ FILE: Trees/Binary Trees/remove_leaf_nodes.go type BinaryTreeNode (line 4) | type BinaryTreeNode struct function RemoveLeafNodes (line 13) | func RemoveLeafNodes(root *BinaryTreeNode) *BinaryTreeNode { FILE: Trees/Binary Trees/search_an_element.go type BinaryTreeNode (line 4) | type BinaryTreeNode struct function SearchAnElement (line 12) | func SearchAnElement(root *BinaryTreeNode, data int) *BinaryTreeNode { function SearchAnElementWithoutRecursion (line 35) | func SearchAnElementWithoutRecursion(root *BinaryTreeNode, data int) *Bi... FILE: Trees/Binary Trees/sum_of_all_nodes.cpp class Node (line 21) | class Node{ method Node (line 27) | Node(int d){ function Node (line 31) | Node* build_binary_tree(){ method Node (line 27) | Node(int d){ function sum_of_all_nodes (line 43) | int sum_of_all_nodes(Node* root){ function main (line 49) | int main(){ FILE: Trees/Implement_Trie.cpp type TrieNode (line 39) | struct TrieNode { type TrieNode (line 40) | struct TrieNode method TrieNode (line 42) | TrieNode() { class Trie (line 50) | class Trie { method Trie (line 55) | Trie() { method insert (line 60) | void insert(string word) { method search (line 79) | bool search(string word) { method startsWith (line 98) | bool startsWith(string prefix) { FILE: Trees/Implement_Trie.py class TrieNode (line 31) | class TrieNode: method __init__ (line 32) | def __init__(self): class Trie (line 38) | class Trie: method __init__ (line 39) | def __init__(self): method insert (line 43) | def insert(self, word: str) -> None: method search (line 55) | def search(self, word: str) -> bool: method startsWith (line 67) | def startsWith(self, prefix: str) -> bool: FILE: Trees/MaxpathBinaryTree.cpp type TreeNode (line 7) | struct TreeNode { method TreeNode (line 11) | TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} class Solution (line 14) | class Solution { method maxPathSum (line 16) | int maxPathSum(TreeNode* root) { method findMaxPathSum (line 23) | int findMaxPathSum(TreeNode* node, int& maxSum) { function main (line 43) | int main() { FILE: Trees/tree.go type Node (line 24) | type Node struct method hasClass (line 72) | func (n *Node) hasClass(className string) bool { function FindByIDBFS (line 34) | func FindByIDBFS(root *Node, id string) *Node { function FindByIDDFS (line 56) | func FindByIDDFS(node *Node, id string) *Node { function findAllByClassName (line 86) | func findAllByClassName(root *Node, className string) []*Node { function main (line 110) | func main() { FILE: Trees/trie.cpp class TrieNode (line 45) | class TrieNode{ method TrieNode (line 47) | TrieNode() : vec(CHARS_IN_ALPHABET, nullptr), end_of_str(false) {} class Trie (line 54) | class Trie { method Trie (line 59) | Trie(const Trie& other) = delete; method Trie (line 60) | Trie& operator= (const Trie& other) = delete; type RecDeleteStatus (line 69) | enum RecDeleteStatus{NOT_FOUND = -1, DELETE = 0 , COMPLITE = 1} function TrieNode (line 206) | TrieNode* Trie::CreatNodes(TrieNode* node_runner, const char* string_ptr) method TrieNode (line 47) | TrieNode() : vec(CHARS_IN_ALPHABET, nullptr), end_of_str(false) {} function TrieNode (line 222) | TrieNode* Trie::FindLastChar(const char* string_ptr) method TrieNode (line 47) | TrieNode() : vec(CHARS_IN_ALPHABET, nullptr), end_of_str(false) {} FILE: Trees/trie.go type TrieNode (line 27) | type TrieNode struct type Trie (line 33) | type Trie struct method Insert (line 48) | func (t *Trie) Insert(word string) { method Search (line 67) | func (t *Trie) Search(word string) bool { method StartsWith (line 83) | func (t *Trie) StartsWith(prefix string) bool { function NewTrie (line 38) | func NewTrie() *Trie { function main (line 97) | func main() { FILE: Trees/trie.java class Trie (line 37) | class Trie { method Trie (line 40) | public Trie() { method insert (line 44) | public void insert(String word) { method search (line 48) | public boolean search(String word) { method startsWith (line 52) | public boolean startsWith(String prefix) { class Node (line 56) | class Node { method Node (line 60) | Node() { method insert (line 65) | private void insert(String word, int idx) { method search (line 77) | private boolean search(String word, int idx) { method startsWith (line 88) | private boolean startsWith(String prefix, int idx) { FILE: Tries/pattern_matching.cpp class TrieNode (line 63) | class TrieNode method TrieNode (line 70) | TrieNode(char data) class Trie (line 82) | class Trie method Trie (line 89) | Trie() method insertWord (line 95) | bool insertWord(TrieNode *root, string word) method insertWord (line 128) | void insertWord(string word) method search (line 136) | bool search(TrieNode *root, string word) method search (line 150) | bool search(string word) method patternMatching (line 155) | bool patternMatching(vector vect, string pattern) function main (line 169) | int main() FILE: Tries/search_in_tries.cpp class TrieNode (line 19) | class TrieNode method TrieNode (line 26) | TrieNode(char data) class Trie (line 38) | class Trie method Trie (line 43) | Trie() method insertWord (line 48) | void insertWord(TrieNode *root, string word) method insertWord (line 74) | void insertWord(string word) method search (line 79) | bool search(TrieNode *root, string word) method search (line 99) | bool search(string word) function main (line 105) | int main() FILE: Tries/trie_node_class.cpp class TrieNode (line 19) | class TrieNode method TrieNode (line 26) | TrieNode(char data) class Trie (line 38) | class Trie method Trie (line 43) | Trie() method insertWord (line 49) | void insertWord(TrieNode *root, string word) method search (line 73) | bool search(TrieNode *root, string word) method removeWord (line 92) | void removeWord(TrieNode *root, string word) method insertWord (line 128) | void insertWord(string word) method search (line 133) | bool search(string word) method removeWord (line 138) | void removeWord(string word) function main (line 144) | int main() FILE: sorting/Cyclic_Sort.java class Cyclic_Sort (line 16) | public class Cyclic_Sort { method main (line 17) | public static void main(String[] args) { method sort (line 24) | static void sort(int[] arr){ method swap (line 38) | static void swap(int[] arr,int one,int two){ FILE: sorting/bubble_sort.cpp function bubbleSort (line 27) | void bubbleSort(vector& arr) { function main (line 41) | int main() { FILE: sorting/bubble_sort.go function bubbleSort (line 27) | func bubbleSort(arr []int) { function main (line 47) | func main() { FILE: sorting/bubble_sort.java class bubble_sort (line 25) | public class bubble_sort { method bubbleSort (line 26) | public static void bubbleSort(int[] arr) { method main (line 42) | public static void main(String[] args) { FILE: sorting/bubble_sort.js function bubbleSort (line 23) | function bubbleSort(arr) { FILE: sorting/bubble_sort.py function bubbleSort (line 23) | def bubbleSort(arr): FILE: sorting/bucket-sort.js function bucketSort (line 1) | function bucketSort(arr, bucketSize = 5) { function insertionSort (line 41) | function insertionSort(arr) { FILE: sorting/bucket_sort.cpp function bucketSort (line 10) | void bucketSort(vector& arr) { function main (line 39) | int main() { FILE: sorting/bucket_sort.go function InsertionSort (line 33) | func InsertionSort(Array []int) { function BucketSort (line 44) | func BucketSort(Array []int, bucketSize int) []int { function main (line 76) | func main() { FILE: sorting/bucket_sort.java class BucketSort (line 33) | public class BucketSort { method bucketSort (line 35) | static void bucketSort(int[] arr, int noOfBuckets) { method hash (line 87) | private static int hash(int num, int hashValue, int numberOfBuckets) { FILE: sorting/bucket_sort.js function bucketSort (line 3) | function bucketSort(arr, numBuckets = 10) { FILE: sorting/count_sort.cpp function getMax (line 40) | int getMax(int a[], int n) function countSort (line 51) | void countSort(int a[], int n) // function to perform counting sort function printArr (line 84) | void printArr(int a[], int n) /* function to print the array */ function main (line 91) | int main() FILE: sorting/count_sort.java class CountingSort (line 37) | class CountingSort { method getMax (line 39) | int getMax(int[] a, int n) { method countSort (line 48) | void countSort(int[] a, int n) // function to perform counting sort method printArray (line 83) | void printArray(int a[], int n) method main (line 90) | public static void main(String args[]) FILE: sorting/count_sort.js function sort (line 37) | function sort(arr) FILE: sorting/count_sort.py function countSort (line 36) | def countSort(arr): FILE: sorting/dnf.cpp function DutchNationalFlag (line 36) | std::vector DutchNationalFlag(std::vector& array) { function main (line 64) | int main() { FILE: sorting/dnf.go function DutchNationalFlag (line 36) | func DutchNationalFlag(array []int64) []int64 { FILE: sorting/dnf.java class DutchNationalFlag (line 21) | public class DutchNationalFlag { method main (line 33) | public static void main(String[] args) { method dutchNationalFlagSort (line 42) | public static void dutchNationalFlagSort(int[] array, int pivot) { method swap (line 68) | private static void swap(int[] array, int i, int j) { FILE: sorting/dnf.js function dutchNationalFlagProblem (line 28) | function dutchNationalFlagProblem(arr) { FILE: sorting/dnf.py function dutch_national_flag_problem (line 27) | def dutch_national_flag_problem(arr): FILE: sorting/heap_sort.cpp function heapify (line 23) | void heapify(int arr[], int n, int i){ function heapSort (line 42) | void heapSort(int arr[], int n){ function display (line 54) | void display(int arr[], int n){ function main (line 60) | int main(){ FILE: sorting/heap_sort.java class heap_sort (line 13) | public class heap_sort { method sort (line 15) | public void sort(int arr[]) { method heapify (line 34) | void heapify(int arr[], int n, int i) { method printArray (line 57) | static void printArray(int arr[]) { method main (line 65) | public static void main(String args[]) { FILE: sorting/heap_sort.js function heapSort (line 11) | function heapSort(array) { function buildMaxHeap (line 32) | function buildMaxHeap(array) { function siftDown (line 47) | function siftDown(array, index, endIndex) { function swap (line 72) | function swap(array, i, j) { FILE: sorting/heap_sort.py function heap_sort (line 22) | def heap_sort(arr): function heapify (line 35) | def heapify(arr, n, i): FILE: sorting/insertion_sort.cpp function insertionSort (line 47) | void insertionSort(vector& arr) { function main (line 63) | int main() { FILE: sorting/insertion_sort.go function InsertionSort (line 45) | func InsertionSort(arr []int) []int { function main (line 67) | func main() { FILE: sorting/insertion_sort.java class InsertionSort (line 41) | public class InsertionSort { method insertionSort (line 42) | public static void insertionSort(int[] arr) { method main (line 58) | public static void main(String[] args) { FILE: sorting/insertion_sort.js function insertionSort (line 44) | function insertionSort(arr) { FILE: sorting/insertion_sort.py function insertion_sort (line 39) | def insertion_sort(arr): FILE: sorting/merge_sort.cpp function merge (line 19) | void merge(vector& arr, int start, int mid, int end) { function merge_sort (line 51) | void merge_sort(vector& arr, int start, int end) { function main (line 60) | int main() { FILE: sorting/merge_sort.go function MergeSort (line 24) | func MergeSort(arr []int) []int { function merge (line 48) | func merge(left, right []int) []int { function main (line 87) | func main() { FILE: sorting/merge_sort.java class MergeSort (line 18) | class MergeSort { method mergeSort (line 20) | void mergeSort(int ar[], int p,int r){ method merge (line 29) | void merge(int ar[],int p,int mid,int r){ method main (line 61) | public static void main(String args[]) { FILE: sorting/merge_sort.js function mergeSort (line 20) | function mergeSort(arr) { function merge (line 44) | function merge(leftArr, rightArr) { FILE: sorting/merge_sort.py function main (line 18) | def main(): function merge_sort (line 24) | def merge_sort(a_lst: list[int], start: int, n: int) -> None: function merge (line 32) | def merge(a_lst: list[int], start: int, mid: int, n: int): FILE: sorting/quick_sort.cpp function Hoare_partition (line 4) | int Hoare_partition(int arr[],int l,int h) function Quick_Sort (line 28) | void Quick_Sort(int arr[],int low,int high) function Display (line 40) | void Display(int arr[],int n) function main (line 46) | int main() FILE: sorting/quick_sort.go function quicksort (line 25) | func quicksort(arr []int, left, right int) { function main (line 62) | func main() { FILE: sorting/quick_sort.java class quick_sort (line 17) | public class quick_sort { method main (line 18) | public static void main(String[] args) { method sort (line 35) | private static void sort(int[] a, int start, int end){ method partition (line 50) | private static int partition(int[] a, int start, int end) { FILE: sorting/quick_sort.js function quickSort (line 22) | function quickSort(arr, low, high) { function partition (line 40) | function partition(arr, low, high) { FILE: sorting/quick_sort.py function quicksort (line 18) | def quicksort(arr): FILE: sorting/radix_sort.cpp function getMax (line 61) | int getMax(int arr[], int n) function countSort (line 72) | void countSort(int arr[], int n, int exp) function radixsort (line 100) | void radixsort(int arr[], int n) function print (line 113) | void print(int arr[], int n) function main (line 120) | int main() FILE: sorting/radix_sort.go function radixSortLSD (line 39) | func radixSortLSD(arr []int) []int { function main (line 86) | func main() { FILE: sorting/radix_sort.java class Radix (line 60) | class Radix { method getMax (line 63) | static int getMax(int arr[], int n) method countSort (line 74) | static void countSort(int arr[], int n, int exp) method radixsort (line 105) | static void radixsort(int arr[], int n) method print (line 118) | static void print(int arr[], int n) method main (line 125) | public static void main(String[] args) FILE: sorting/radix_sort.js function getMax (line 58) | function getMax(arr,n) function countSort (line 69) | function countSort(arr,n,exp) function radixsort (line 102) | function radixsort(arr,n) function print (line 115) | function print(arr,n) FILE: sorting/radix_sort.py function countingSort (line 56) | def countingSort(arr, exp1): function radixSort (line 91) | def radixSort(arr): FILE: sorting/selection_sort.cpp function selectionSort (line 32) | void selectionSort(vector& arr) { function main (line 51) | int main() { FILE: sorting/selection_sort.go function selectionSort (line 32) | func selectionSort(arr []int) { function main (line 50) | func main() { FILE: sorting/selection_sort.java method selectionSort (line 33) | public static int[] selectionSort(int[] arr) { FILE: sorting/selection_sort.js function selectionSort (line 32) | function selectionSort(array) { FILE: sorting/selection_sort.py function selection_sort (line 27) | def selection_sort(arr): FILE: sorting/tim_sort.cpp function insertionSort (line 16) | void insertionSort(vector&array,int l,int r) function merge (line 28) | void merge(vector&array,int l,int m,int r) { function timSort (line 57) | void timSort(vector&array, int n) { function main (line 79) | int main() FILE: sorting/tim_sort.go function main (line 21) | func main() { function timSort (line 32) | func timSort(arr []int, n int) { function insertionSort (line 49) | func insertionSort(arr []int, left int, right int) { function merge (line 59) | func merge(arr []int, left int, mid int, right int) { function printArray (line 104) | func printArray(arr []int, n int) { FILE: sorting/tim_sort.java class tim_sort (line 14) | class tim_sort method main (line 17) | public static void main(String[] args) method timSort (line 24) | public static void timSort(int[] arr,int n) method insertionSort (line 41) | public static void insertionSort(int[] arr,int left,int right) method merge (line 55) | public static void merge(int[] arr,int left,int mid,int right) FILE: sorting/tim_sort.py function find_minrun (line 19) | def find_minrun(n): function insertion_sort (line 30) | def insertion_sort(array, left, right): function merge (line 39) | def merge(array, l, m, r): function tim_sort (line 85) | def tim_sort(array): FILE: sorting/wave_sort.cpp function wavesort (line 13) | void wavesort(int arr[], int n) function main (line 28) | int main()