MCPcopy Create free account

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

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

↓ 1 callersMethod_iscolorstring
Check if the string color is a legal Tkinter color string.
Python/Turtle.py:465
↓ 1 callersMethod_listen
Set focus on canvas (in order to collect key-events)
Python/Turtle.py:604
↓ 1 callersMethod_newLine
dummy method - to be overwritten by child class
Python/Turtle.py:2362
↓ 1 callersMethod_onclick
Bind fun to mouse-click event on turtle. fun must be a function with two arguments, the coordinates of the clicked point on the canvas
Python/Turtle.py:502
↓ 1 callersMethod_ondrag
Bind fun to mouse-move-event (with pressed mouse button) on turtle. fun must be a function with two arguments, the coordinates of the
Python/Turtle.py:536
↓ 1 callersMethod_onkeypress
If key is given, bind fun to key-press event of key. Otherwise bind fun to any key-press. Canvas must have focus. See method listen.
Python/Turtle.py:586
↓ 1 callersMethod_onkeyrelease
Bind fun to key-release event of key. Canvas must have focus. See method listen
Python/Turtle.py:575
↓ 1 callersMethod_onrelease
Bind fun to mouse-button-release event on turtle. fun must be a function with two arguments, the coordinates of the point on the canva
Python/Turtle.py:517
↓ 1 callersMethod_onscreenclick
Bind fun to mouse-click event on canvas. fun must be a function with two arguments, the coordinates of the clicked point on the canvas
Python/Turtle.py:557
↓ 1 callersMethod_ontimer
Install a timer, which calls fun after t milliseconds.
Python/Turtle.py:609
↓ 1 callersMethod_pointlist
returns list of coordinate-pairs of points of item Example (for insiders): >>> from turtle import * >>> getscreen()._pointlist
Python/Turtle.py:644
↓ 1 callersMethod_rescale
(self, xscalefactor, yscalefactor)
Python/Turtle.py:659
↓ 1 callersMethod_resize
Resize the canvas the turtles are drawing on. Does not alter the drawing window.
Python/Turtle.py:671
↓ 1 callersMethod_rotate
Turns pen clockwise by angle.
Python/Turtle.py:3161
↓ 1 callersMethod_setbgpic
Configure image item as to draw image object at center of canvas. Set item to the first item in the displaylist, so it will be drawn b
Python/Turtle.py:630
↓ 1 callersMethod_type
Return 'line' or 'polygon' or 'image' depending on type of item.
Python/Turtle.py:638
↓ 1 callersMethod_undogoto
Reverse a _goto. Used for undo()
Python/Turtle.py:3096
↓ 1 callersMethod_update
Redraw graphics items on canvas
Python/Turtle.py:456
↓ 1 callersMethod_write
Performs the writing for write()
Python/Turtle.py:3298
↓ 1 callersFunctionadd
(num1, num2)
Python/Calculator.py:6
↓ 1 callersMethodadd
PolynomialAddition.cpp:69
↓ 1 callersMethodaddAtFront
(Node node)
Java/Linked List/LinkedList.java:24
↓ 1 callersMethodallPairs
CPP/findSum.cpp:6
↓ 1 callersFunctionall_pair
CPP/array-2d/all_pairs.cpp:3
↓ 1 callersFunctionanagramSeach
CPP/String/angramSearch.cpp:16
↓ 1 callersMethodapply_union
(self, parent, rank, x, y)
Python/Kruskal's_Algorithm.py:19
↓ 1 callersFunctionapproach2
hare and tortoise
CPP/LINKED LIST/DOUBLY LINKED LIST/middleoflinkedlist.cpp:95
↓ 1 callersFunctionarePermutation
CPP/char array/arepermut.cpp:8
↓ 1 callersFunctionareRotated
CPP/String/areRotation.cpp:4
↓ 1 callersMethodarrangeCoins2
(int n)
Leetcode-solutions/Binary-search/ArrangingCoins.java:24
↓ 1 callersMethodarrangeNumbers
(int[] arr, int x)
Java/Array/ArrangeNumberInArray.java:48
↓ 1 callersMethodarrayIntersection
(int[] arr1, int[] arr2)
Java/Array/ArrayIntersection.java:84
↓ 1 callersMethodarraySum
(int[] arr)
Java/Array/ArraySum.java:38
↓ 1 callersFunctionarti_point
graph/code19.cpp:72
↓ 1 callersFunctionatIndex
Arrays/32_Operations_on_arrays.c:77
↓ 1 callersMethodbS
(int[] arr, int target)
Leetcode-solutions/Binary-search/IntersectionOfTwoArrays.java:33
↓ 1 callersMethodbacktrace
(List<List<String>> result, List<String> list, int level, int n, boolean[] used)
Java/LeetCodeN-Queens.java:20
↓ 1 callersMethodbalancedStringSplit
(String s)
Java/Leetcode/Leetcode1221.java:10
↓ 1 callersFunctionbalanced_parentheses
Use a stack to check if a string of parentheses is balanced. >>> balanced_parentheses("([]{})") True >>> balanced_parentheses("[()]{}{[()(
Python/balanced_parentheses.py:4
↓ 1 callersFunctionbalancedhelper
CPP/binarytreeuse.cpp:264
↓ 1 callersMethodbbox
'forward' method, which canvas itself has inherited...
Python/Turtle.py:297
↓ 1 callersFunctionbellman_ford
graph/code17.cpp:21
↓ 1 callersFunctionbellman_ford_algorithm
Bellman-Ford algorithm for finding the shortest path from a source node to all other nodes in a graph. :param graph: the graph :param sou
Python/bellman_ford.py:2
↓ 1 callersFunctionbfs
CPP/BFS_AND_DFS.cpp:19
↓ 1 callersFunctionbfs_find
graph/code7.cpp:16
↓ 1 callersFunctionbfs_rec
graph/code7.cpp:43
↓ 1 callersFunctionbfs_recursive
graph/code4.cpp:37
↓ 1 callersFunctionbiggest_odd
(num_list)
Python/biggest-odd.py:8
↓ 1 callersFunctionbinExpRec
CPP/recursion/Binary_Exponentiation.cpp:4
↓ 1 callersFunctionbinary
CPP/Decimal_to_Binary.cpp:4
↓ 1 callersFunctionbinarySearch
A recursive binary search function. It returns location of x in given array arr[l..r] is present, otherwise -1
CPP/searching/exponential_search.cpp:39
↓ 1 callersMethodbinarySearch
(int arr[], int l, int r, int x)
Java/SearchingAlgorithms/BinarySearch.java:6
↓ 1 callersMethodbinarySearch
(int [] arr, int x)
Java/Array/BinarySearch.java:48
↓ 1 callersMethodbinarySearch2
(int[] arr, int target)
Leetcode-solutions/Binary-search/SearchInsertPosition.java:25
↓ 1 callersMethodbinary_search
CPP/DS C++/Binary Search on Given Array List.cpp:20
↓ 1 callersMethodbinarysearch
(int[] arr, int target)
Java/SearchingAlgorithms/BinarySearch.java:75
↓ 1 callersMethodbitsArray
(int n)
Java/Leetcode/Leetcode338.java:14
↓ 1 callersFunctionbottomView
Trees/BottomView.cpp:31
↓ 1 callersFunctionbridges
graph/code20.cpp:66
↓ 1 callersMethodbubble
(int[] arr)
Java/SortingTechniques/BubbleSort.java:77
↓ 1 callersFunctionbubbleSort
(arr)
Python/Sorting-Techniques/bubble-sort.py:1
↓ 1 callersMethodbubbleSort
(int [] arr)
Java/Array/BubbleSort.java:55
↓ 1 callersMethodbubble_search
CPP/DS C++/Binary & Selection sort search on given array list.cpp:23
↓ 1 callersFunctionbubble_sort
CPP/sorting/bubblesort.cpp:3
↓ 1 callersMethodbubble_sort
(int my_arr[], int len_arr)
Java/SortingTechniques/Recursivebubblesort.java:3
↓ 1 callersFunctionbucketSort
CPP/sorting/bucketsort.cpp:4
↓ 1 callersFunctionbucketSort
(array)
Python/Sorting-Techniques/bucket_sort.py:5
↓ 1 callersFunctionbuild
CPP/Segment Tree/lazy_queries_segment_tree.cpp:31
↓ 1 callersMethodbuildFailureLinks
()
AhoCorasick.java:24
↓ 1 callersFunctionbuildTree
CPP/Segment Tree/basic.cpp:4
↓ 1 callersFunctionbuildTree
Trees/burningTree.cpp:19
↓ 1 callersMethodbuildTree
builds a Binary Tree taking (int) value as an argument and returns the root to the tree built.
Trees/delete_nodes_BST.cpp:31
↓ 1 callersFunctionbuild_segtree
------------------------Do not write above this line--------------------------------------------------------------------------------------------------
CPP/Segment Tree/Sum query.cpp:100
↓ 1 callersFunctionbuild_segtree
------------------------Do not write above this line--------------------------------------------------------------------------------------------------
CPP/Segment Tree/Maximum element query.cpp:100
↓ 1 callersMethodbye
Shut the turtlegraphics window. Example (for a TurtleScreen instance named screen): >>> screen.bye()
Python/Turtle.py:3659
↓ 1 callersMethodcalculate
CPP/DS C++/Sparse Matrix Using Array Representation.cpp:26
↓ 1 callersFunctioncanBePlaced
Function for checking valid squares.
CPP/recursion/N_Queens/N_Queens.cpp:25
↓ 1 callersMethodcanEatAllWithSpeed
(int[] piles, int allowedBananas, int h)
Leetcode-solutions/Binary-search/KoKoEatingBanana.java:26
↓ 1 callersMethodcanShipWithMinWeight
(int[] weights, int allowedWeight, int days)
Leetcode-solutions/Binary-search/ShipCapacity.java:29
↓ 1 callersMethodceiling
(int[] arr, int target)
Java/ceiling.java:11
↓ 1 callersMethodceiling
(char[] arr, char target)
Java/Leetcode/Leetcode744.java:17
↓ 1 callersMethodcheck
(String str)
Java/String/CheckPalindrome.java:8
↓ 1 callersMethodcheckBalanced
(String str)
Java/Stack/Balanced_Brackets.java:8
↓ 1 callersMethodcheckCycle
(int node, ArrayList<ArrayList<Integer>> adj, int[] visited, int dfsVisited[])
graph/cycleDetectionInDirectedGraph.java:6
↓ 1 callersMethodcheckForCycle
(ArrayList<ArrayList<Integer>> adj, int s, boolean visited[])
graph/cycledetectionInUndirectedGraph.java:21
↓ 1 callersMethodcheckPermutation
(String str1 , String str2)
Java/String/CheckPermutation.java:7
↓ 1 callersFunctioncheck_sort
CPP/sorting/bubble_que.cpp:8
↓ 1 callersFunctioncheck_status
CPP/Problems/maze_game.c:94
↓ 1 callersFunctionchecker
CPP/LINKED LIST/SOME LEET CODE QUESTIONS/Weights.cpp:10
↓ 1 callersMethodcipherInit
()
DSA android fingerprint/android fingerprint dsa algorithm.java:126
↓ 1 callersFunctioncircularcheck
CPP/LINKED LIST/CIRCULAR LOOP CONCEPTS/checkcircular.cpp:83
↓ 1 callersMethodclear
Delete all drawings and all turtles from the TurtleScreen. No argument. Reset empty TurtleScreen to its initial state: white backgro
Python/Turtle.py:903
↓ 1 callersFunctionclearBitInRange
CPP/bitmasking/bit-functions.cpp:29
↓ 1 callersFunctionclearIthBit
CPP/bitmasking/bit-functions.cpp:16
↓ 1 callersMethodclearIthBit
(int n, int i)
Java/FiveBitManipulation/BitOperations.java:15
↓ 1 callersMethodclearstamp
Delete stamp with given stampid Argument: stampid - an integer, must be return value of previous stamp() call. Example (for
Python/Turtle.py:3000
↓ 1 callersMethodclearstamps
Delete all or first/last n of turtle's stamps. Optional argument: n -- an integer If n is None, delete all of pen's stamps,
Python/Turtle.py:3015
↓ 1 callersFunctioncloneTree
This function makes the clone of given tree. It mainly uses copyLeftRightNode() and copyRandom()
Hashtable/Clone-a-Binary-Tree-with-Random-Pointers.cpp:73
↓ 1 callersFunctioncollatz
CPP/collatz.cpp:16
↓ 1 callersFunctioncombinationSum
CPP/recursion/sum_of_subset.cpp:41
← previousnext →501–600 of 2,714, ranked by callers