MCPcopy Create free account

hub / github.com/codemistic/Data-Structures-and-Algorithms / functions

Functions2,714 in github.com/codemistic/Data-Structures-and-Algorithms

⨍ Functions 2,714◇ Types & classes 687
↓ 1 callersMethodkthElement
CPP/k_th_arrays.cpp:7
↓ 1 callersMethodkthSmallest
(int[][] matrix, int k)
Leetcode-solutions/Binary-search/kthSmallestInMatrix.java:12
↓ 1 callersFunctionlRot
Left Rotation Function
Arrays/31_Menu_for_Array.c:370
↓ 1 callersFunctionlShift
Left Shift Function
Arrays/31_Menu_for_Array.c:340
↓ 1 callersMethodlargestRowColumn
(int [] [] arr2)
Java/Array/LargestRowColumn.java:57
↓ 1 callersMethodlargestcolsum
(int [] [] arr2)
Java/Array/LargestRowSum.java:11
↓ 1 callersMethodlargestcolsum
(int [] [] arr2)
Java/Array/LargestColSum.java:7
↓ 1 callersFunctionlargestsubarray_sum
CPP/array-2d/brute_force.cpp:3
↓ 1 callersFunctionlastocc
CPP/searching/binary_search1.cpp:26
↓ 1 callersFunctionlcs
Dynamic Programming/longestCommonSubstring.cpp:14
↓ 1 callersFunctionlcsAlgo
CPP/Dynamic Programming/Longest_Common_Subsequence.cpp:4
↓ 1 callersFunctionleftPart
CPP/Problems/BitonicArray.cpp:27
↓ 1 callersMethodleftRotate
(int[] arr, int d)
Java/Array/LeftRotateArrayByD.java:17
↓ 1 callersFunctionleftView
left view of tree.cpp:41
↓ 1 callersFunctionleftView
A wrapper over leftViewUtil()
CPP/Trees/left_view_of_binary_tree.cpp:64
↓ 1 callersFunctionleftViewUtil
left view of a binary tree.
left view of tree.cpp:22
↓ 1 callersFunctionleftViewUtil
Recursive function to print left view of a binary tree.
CPP/Trees/left_view_of_binary_tree.cpp:43
↓ 1 callersFunctionlength
CPP/LINKED LIST/SINGLY LINKED LIST/leetcode25.cpp:29
↓ 1 callersFunctionlength
CPP/LINKED LIST/SINGLY LINKED LIST/linkedlisttpractice.cpp:47
↓ 1 callersFunctionlength
CPP/LINKED LIST/DOUBLY LINKED LIST/middleoflinkedlist.cpp:80
↓ 1 callersMethodlength1
(LinkedList.Node<Integer> head)
Java/LinkedList/LengthOfLinkedList.java:32
↓ 1 callersFunctionlengthOfLIS
CPP/questions/Longest Increasing Subsequence(LIS).cpp:66
↓ 1 callersMethodlengthOfLIS
(int[] nums)
Leetcode-solutions/Binary-search/LongestIncrSubSeq.java:9
↓ 1 callersFunctionlibrarySort
CPP/sorting/library_sort.cpp:4
↓ 1 callersFunctionlinear
CPP/searching/linear_search.cpp:3
↓ 1 callersMethodlinear
CPP/DS C++/Linear Sort Search on Given Array List.cpp:19
↓ 1 callersMethodlinearSearch
(int[] arr, int target)
Java/SearchingAlgorithms/LinearSearch.java:22
↓ 1 callersMethodlinearSearch
(int[] arr, int x)
Java/Array/LinearSearch.java:47
↓ 1 callersFunctionlinear_search
(l,key)
Python/Searching-Algorithms/linear-search.py:2
↓ 1 callersFunctionlis
(arr,i,n,dp)
Python/Dynamic_Programming/Longest_consecutive_subsequence.py:7
↓ 1 callersFunctionlis
(arr,n)
Python/Dynamic_Programming/Longest_subsequence_iterative.py:11
↓ 1 callersMethodlisten
Set focus on TurtleScreen (in order to collect key-events) No arguments. Dummy arguments are provided in order to be able to
Python/Turtle.py:1327
↓ 1 callersFunctionlookup
CPP/SPOJ_ADAFRIEN.cpp:7
↓ 1 callersMethodlowerCase
(String s)
Java/Leetcode/Leetcode709.java:9
↓ 1 callersMethodmajority
(int nums[])
Java/Majority_Element.java:22
↓ 1 callersFunctionmake_union
graph/code15.cpp:40
↓ 1 callersFunctionmaxLengthSpaceOpt
space optimization approach */
CPP/questions/Longest Increasing Subsequence(LIS).cpp:48
↓ 1 callersMethodmaxSubArray
(int[] nums)
Leetcode-solutions/Binary-search/MaxSubArraySum.java:7
↓ 1 callersFunctionmaxSubArraySum
This is the smallest code for kadanes algorithm
Dynamic Programming/Kadanes.cpp:5
↓ 1 callersFunctionmaxSubArraySum
Dynamic Programming/Largest Sum Contiguous Subarray.cpp:6
↓ 1 callersFunctionmax_arr
CPP/array-2d/max_array.cpp:22
↓ 1 callersFunctionmax_circular_subarray
Kadane's Algorithm variation for circular arrays.
circular_kadne.py:11
↓ 1 callersFunctionmaximum
CPP/LINKED LIST/SOME LEET CODE QUESTIONS/Weights.cpp:3
↓ 1 callersFunctionmaximumChocolates
Dynamic Programming/ninjaAndHisFriends.cpp:79
↓ 1 callersFunctionmaximumNonAdjacentSum
Dynamic Programming/maximumNonAdjacentSum.cpp:8
↓ 1 callersMethodmaximumWealth
(int[][] accounts)
Java/Leetcode/Leetcode1672.java:9
↓ 1 callersFunctionmaximum_sum_subarray
CPP/LINKED LIST/SINGLY LINKED LIST/Maths For DSA/Sliding Window Problem/subarraysum.cpp:6
↓ 1 callersFunctionmaxones
CPP/arrays/Max_Consecutive_Ones.cpp:4
↓ 1 callersFunctionmenu
main menu
Arrays/32_Operations_on_arrays.c:22
↓ 1 callersFunctionmenu1
Arrays/32_Operations_on_arrays.c:33
↓ 1 callersFunctionmerge
(customList, l, m, r)
Python/all sorting methods.py:75
↓ 1 callersMethodmerge
(self, a, b)
Python/Flattening of a linked list/solution.py:44
↓ 1 callersMethodmerge
(String w1,String w2)
Java/Leetcode/Leetcode1768.java:10
↓ 1 callersMethodmerge
(int[][] buildings, int lo, int hi)
Java/Leetcode/LeetcodeTheSkylineProblem.java:6
↓ 1 callersMethodmerge
(int arr[], int s, int e)
Java/SortingTechniques/MergeSortArray.java:34
↓ 1 callersMethodmergeArray
(int [] arr1, int [] arr2)
Java/Array/MergeTwoSortedArrays.java:79
↓ 1 callersMethodmerge_sky
(self, left_skyline, right_skyline)
Python/skyline.py:16
↓ 1 callersFunctionmergesort
CPP/sorting/merge_sort.cpp:51
↓ 1 callersMethodmergsort
(int arr[],int s, int e)
Java/SortingTechniques/MergeSortArray.java:18
↓ 1 callersMethodminCost
(String colors, int[] neededTime)
Java/MinimumTimeToColorRope.java:16
↓ 1 callersFunctionminCutFrom
CPP/Dynamic Programming/Palindrome Partitioning II.cpp:11
↓ 1 callersMethodminEatingSpeed
(int[] piles, int h)
Leetcode-solutions/Binary-search/KoKoEatingBanana.java:7
↓ 1 callersMethodminJumps
CPP/Problems/minimumNumberOfJump.cpp:52
↓ 1 callersMethodminPoints
CPP/Dynamic Programming/minimumPointsToReachDestination.cpp:63
↓ 1 callersFunctionminRange
(arr, n, k)
Hashtable/Smallest-subarray-with-k-distinct-numbers.py:6
↓ 1 callersMethodminSubArrLength
(int target, int[] nums)
Leetcode-solutions/Binary-search/MinSizeSubArrSum.java:8
↓ 1 callersMethodminTime
Trees/burningTree.cpp:150
↓ 1 callersFunctionminValueNode
Trees/avltree.c:119
↓ 1 callersFunctionminimumTotal
Dynamic Programming/minFallingPathSumTriangle.cpp:8
↓ 1 callersMethodmissing
(int[] arr)
Java/Leetcode/Leetcode268.java:11
↓ 1 callersFunctionmodPow
A Function to find pow (base, exponent) % MOD in log (exponent) time
Hashtable/Palindrome-Substring-Queries.cpp:29
↓ 1 callersFunctionmodulus
(num1, num2)
Python/Calculator.py:30
↓ 1 callersFunctionmove_snake
CPP/Problems/maze_game.c:101
↓ 1 callersFunctionmultiply
(num1, num2)
Python/Calculator.py:18
↓ 1 callersFunctionmyFun
()
Python/animation_of_colorful_spiral_pattern.py:4
↓ 1 callersFunctionnewNode
CPP/Trees/kthMinimumElement.cpp:12
↓ 1 callersMethodnextGreatestLetter2
(char[] letters, char target)
Leetcode-solutions/Binary-search/SmallestLetter.java:24
↓ 1 callersMethodnr_of_items
(self)
Python/Turtle.py:847
↓ 1 callersMethodnth_fibo
(int b, int c, int n)
Java/Recursion/Fibonacci.java:4
↓ 1 callersMethodnumJewelsInStones
(String jewels, String stones)
Java/Leetcode/Leetcode771.java:10
↓ 1 callersMethodnumOfStrings
(String[] patterns, String word)
Java/Leetcode/Leetcode1967.java:29
↓ 1 callersFunctionnumRollsToTarget
Table of n * target sum ; This is used to save the results in bottom up approach
CPP/Dynamic Programming/number_of_dice_rolls_with_target_sum.cpp:5
↓ 1 callersFunctionnumRollsToTarget
Table of n * target sum ; This is used to save the results in bottom up approach
Dynamic Programming/number_of_dice_rolls_with_target_sum.cpp:5
↓ 1 callersFunctionnumber_of_required_pairs
CPP/LINKED LIST/SOME LEET CODE QUESTIONS/Odd_Pairs.cpp:4
↓ 1 callersMethododerAgonosticBS
(int [] arr , int target)
Java/SearchingAlgorithms/OderAgonosticBinarySearch.java:13
↓ 1 callersMethodonclick
Bind fun to mouse-click event on canvas. Arguments: fun -- a function with two arguments, the coordinates of the click
Python/Turtle.py:1248
↓ 1 callersMethodondestroy
(self, destroy)
Python/Turtle.py:345
↓ 1 callersMethodonkey
Bind fun to key-release event of key. Arguments: fun -- a function with no arguments key -- a string: key (e.g. "a") or key-s
Python/Turtle.py:1265
↓ 1 callersMethodpairSum
(int[] arr, int x)
Java/Array/PairSum.java:52
↓ 1 callersFunctionpair_sum_binarytree
CPP/binarytreeuse.cpp:526
↓ 1 callersMethodpalidrom
(String name )
Java/String/Str.java:5
↓ 1 callersMethodpalin
(String s)
Java/Leetcode/Leetcode125.java:9
↓ 1 callersMethodpalin
(String s, int l, int i)
Java/Recursion/Checking_the_palindrome.java:5
↓ 1 callersFunctionpalindrome
CPP/char array/string.cpp:3
↓ 1 callersMethodpalindrome
(StringBuilder s)
Java/Leetcode/Leetcode680.java:9
↓ 1 callersMethodparanthesis
(String s)
Java/Leetcode/Leetcode20.java:9
↓ 1 callersFunctionpartition
It searches for x in arr[], and partitions the array around x
CPP/arrays/KthSmallest.cpp:8
↓ 1 callersFunctionpartition
Function to partition the array using Lomuto partition scheme
CPP/sorting/intro_sort.cpp:33
↓ 1 callersFunctionpartition
This function places all smaller to left of pivot and all greater elements to right of pivot
CPP/sorting/randomised_quicksort.cpp:10
↓ 1 callersFunctionpartition
(customList,low,high)
Python/all sorting methods.py:125
← previousnext →901–1,000 of 2,714, ranked by callers