Functions — github.com/codemistic/Data-Structures-and-Algorithms

CodeHub 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 callersMethodcompare

(Interval a, Interval b)

LeetCode Solutions/merge interval.java:37

↓ 1 callersMethodcompliment

Java/Leetcode/Leetcode476.java:10

↓ 1 callersMethodcompressq

Java/String/Compress.java:3

↓ 1 callersFunctioncompute

CPP/Trees/Expression_tree/BST.c:151

↓ 1 callersFunctioncomputePowers

A Dynamic Programming Based Approach to compute the powers of 101

Hashtable/Palindrome-Substring-Queries.cpp:139

↓ 1 callersFunctioncomputePrefixHash

A Function to calculate the prefix hash

Hashtable/Palindrome-Substring-Queries.cpp:55

↓ 1 callersFunctioncomputeSuffixHash

A Function to calculate the suffix hash Suffix hash is nothing but the prefix hash of the reversed string

Hashtable/Palindrome-Substring-Queries.cpp:76

↓ 1 callersFunctionconstructBITree

CPP/Fenwick Tree/fenwickTree.cpp:26

↓ 1 callersMethodcontains

Hashtable/design-hashset.java:15

↓ 1 callersFunctionconvertToPostFix

CPP/Trees/Expression_tree/BST.c:58

↓ 1 callersMethodconvertToTitle

(int columnNumber)

Java/Leetcode/Leetcode168.java:10

↓ 1 callersFunctioncopyLeftRightNode

This function creates clone by copying key and left and right pointers. This function also stores mapping from given tree node to clone. */

Hashtable/Clone-a-Binary-Tree-with-Random-Pointers.cpp:49

↓ 1 callersFunctioncopyRandom

This function copies random node by using the hashmap built by copyLeftRightNode()

Hashtable/Clone-a-Binary-Tree-with-Random-Pointers.cpp:62

↓ 1 callersFunctioncostneedstopay

CPP/LINKED LIST/SOME LEET CODE QUESTIONS/Car_Trip.cpp:3

↓ 1 callersMethodcountAndSay

Java/Leetcode/Leetcode38.java:9

↓ 1 callersFunctioncountBit

CPP/bitmasking/count_bits.cpp:8

↓ 1 callersFunctioncountBit_fast

CPP/bitmasking/count_bits.cpp:17

↓ 1 callersFunctioncountDigits

CPP/Maths/CountDigit.cpp:4

↓ 1 callersFunctioncountMinStepsToOne

Python/Dynamic_Programming/CountMinSteps.py:13

↓ 1 callersFunctioncountMinStepsToOne

Python/Dynamic_Programming/CountMinSteps_Iterative.py:15

↓ 1 callersFunctioncountSetBits

Function to count the total number of set bits in `n`

CPP/Brian_Kernighan’s_algorithm.cpp:15

↓ 1 callersMethodcountSetBits

Java/FiveBitManipulation/BitOperations.java:55

↓ 1 callersMethodcountSort

(int arr[], int n, int exp)

Java/RadixSort.java:20

↓ 1 callersMethodcountSort

(int[] arr, int n, int exp)

Java/SortingTechniques/RadixSort.java:12

↓ 1 callersMethodcountSort

Java/SortingTechniques/CountSort.java:33

↓ 1 callersMethodcountStrings

(String st1, String st2)

Java/String/NumOfStringsOutOfString.java:32

↓ 1 callersFunctioncountTrailingZeroes

CPP/Maths/trailingZeroInFactorial.cpp:4

↓ 1 callersMethodcountWords

Java/String/CountWords.java:8

↓ 1 callersFunctioncountZero

CPP/questions/trailZeros.cpp:6

↓ 1 callersFunctioncount_till_rep

CPP/LINKED LIST/SOME LEET CODE QUESTIONS/leetcode_82.cpp:60

↓ 1 callersFunctioncountingSort

Using counting sort to sort the elements in the basis of significant places

CPP/sorting/radix_sort.cpp:16

↓ 1 callersFunctioncountingSortForRadix

(inputArray, placeValue)

Python/radix_sort.py:1

↓ 1 callersFunctioncounting_sort

CPP/sorting/countingsort.cpp:11

↓ 1 callersFunctioncreate

Stack/stack_implementation_using_array.c:9

↓ 1 callersMethodcreateLinkedList

Java/LinkedList/LengthOfLinkedList.java:16

↓ 1 callersMethodcreateQueen

(int n, int index)

Java/LeetCodeN-Queens.java:52

↓ 1 callersFunctioncreate_maze

(height, width)

Python/dijkstra.py:104

↓ 1 callersFunctioncreate_parent_grid

(height, width)

Python/dijkstra.py:39

↓ 1 callersFunctioncreate_unavailable_grid

(height, width)

Python/dijkstra.py:34

↓ 1 callersFunctioncreatenode

CPP/BST/InsertionInABST.cpp:11

↓ 1 callersFunctionct_d

CPP/LINKED LIST/CIRCULAR LINKED LIST/test4.cpp:25

↓ 1 callersFunctioncutRod

CPP/Dynamic Programming/Rod-Cutting.cpp:25

↓ 1 callersFunctioncycleDFS

CPP/graphseries.cpp:32

↓ 1 callersMethodcycleSort

Java/SortingTechniques/CyclicSort.java:11

↓ 1 callersFunctiondec2bin

Python/des.py:75

↓ 1 callersMethoddecode

Decodes a shortened URL to its original URL.

CPP/Leetcode/535-encode-and-decode-tinyurl/535-encode-and-decode-tinyurl.cpp:12

↓ 1 callersMethoddecrypt

(String strToDecrypt)

Java/AES.java:51

↓ 1 callersMethoddefang

Java/Leetcode/Leetcode1108.java:10

↓ 1 callersMethoddegrees

Set angle measurement units to degrees. Optional argument: fullcircle - a number Set angle measurement units, i. e. set nu

Python/Turtle.py:1463

↓ 1 callersMethoddelay

Return or set the drawing delay in milliseconds. Optional argument: delay -- positive integer Example (for a TurtleScreen i

Python/Turtle.py:1172

↓ 1 callersFunctiondeleteNode

CPP/LINKED LIST/CIRCULAR LINKED LIST/circularlinkedliist.cpp:73

↓ 1 callersFunctiondeleteNode

Trees/delete_nodes_BST.cpp:67

↓ 1 callersFunctiondeleteNode

Trees/avltree.c:130

↓ 1 callersFunctiondelete_back

CPP/LINKED LIST/SINGLY LINKED LIST/linkedlisttpractice.cpp:56

↓ 1 callersFunctiondelete_unsorted

CPP/LINKED LIST/SOME LEET CODE QUESTIONS/delete_unsorted.cpp:80

↓ 1 callersFunctiondeletebyposition

CPP/LINKED LIST/DOUBLY LINKED LIST/doublylinkedlist.cpp:85

↓ 1 callersFunctiondeleteduplicate

CPP/LINKED LIST/SINGLY LINKED LIST/leetcode83.cpp:36

↓ 1 callersFunctiondeletenode

CPP/LINKED LIST/SINGLY LINKED LIST/linkedlistF.cpp:44

↓ 1 callersFunctiondeletenode

CPP/LINKED LIST/CIRCULAR LINKED LIST/circularlinked2.cpp:22

↓ 1 callersFunctiondeletenode_back

CPP/LINKED LIST/SINGLY LINKED LIST/dummy_node.cpp:131

↓ 1 callersFunctiondeletion

Arrays/32_Operations_on_arrays.c:164

↓ 1 callersFunctiondemo1

Demo of old turtle.py - module

Python/Turtle.py:3884

↓ 1 callersFunctiondemo2

Demo of some new features.

Python/Turtle.py:3937

↓ 1 callersMethoddequeue

CPP/QUEUE/QueueUsingStack.cpp:13

↓ 1 callersFunctiondetectcycle

CPP/LINKED LIST/ALGORITHMIC PROBLEMS RELATED TO LINKEDLIST/find_begeningof_circle.cpp:117

↓ 1 callersFunctiondfs

CSES/Intro/CheesboardAndQueens.cc:29

↓ 1 callersFunctiondfs

CSES/Intro/GridPaths.cc:11

↓ 1 callersFunctiondfs

CPP/BFS_AND_DFS.cpp:50

↓ 1 callersFunctiondfs

Similar to topological sort function (dfs)

CPP/graph_tree/Kosaraju Algorithm.cpp:4

↓ 1 callersFunctiondfs

Python/minimum_path_sum.py:8

↓ 1 callersFunctiondfs

(visited, graph, node)

Python/Searching-Algorithms/Depth_first_search.py:13

↓ 1 callersFunctiondfs

graph/code18.cpp:57

↓ 1 callersFunctiondfs

graph/code8.cpp:17

↓ 1 callersFunctiondfs

graph/code10.cpp:15

↓ 1 callersFunctiondfs

graph/code5.cpp:13

↓ 1 callersMethoddfsOfGraph

CPP/graph_tree/dfs.cpp:14

↓ 1 callersFunctiondfsRec

CPP/graph_tree/Kosaraju Algorithm.cpp:19

↓ 1 callersFunctiondfs_func

graph/code20.cpp:35

↓ 1 callersFunctiondfs_rec

graph/code8.cpp:38

↓ 1 callersFunctiondfs_rec

graph/code10.cpp:38

↓ 1 callersFunctiondfs_rec

graph/code5.cpp:27

↓ 1 callersFunctiondiameter

Computes the diameter of binary tree with given root. */

CPP/Trees/Diameter_of_tree.cpp:30

↓ 1 callersFunctiondigit_sum

CPP/recursion/recursion2.cpp:15

↓ 1 callersFunctiondijkstras_two_stack_algorithm

DocTests >>> dijkstras_two_stack_algorithm("(5 + 3)") 8 >>> dijkstras_two_stack_algorithm("((9 - (2 + 9)) + (8 - 1))") 5 >>>

Python/dijkstras_two_stack_algorithm.py:6

↓ 1 callersFunctiondijstra1

without priority queue

graph/code16.cpp:22

↓ 1 callersFunctiondijstra2

with priority queue

graph/code16.cpp:68

↓ 1 callersMethoddisappear

Java/Leetcode/Leetcode448.java:14

↓ 1 callersMethoddisappear

Java/Leetcode/Leetcode645.java:15

↓ 1 callersMethoddisplay

CPP/DS C++/Insertion and Quick sort on Arraylist.cpp:42

↓ 1 callersMethoddisplay

CPP/DS C++/Sparse Matrix Using Array Representation.cpp:44

↓ 1 callersMethoddisplay

Stack/stack_implementation_using_array.cpp:18

↓ 1 callersMethoddisplay_p

CPP/questions/SingleInheritance.cpp:17

↓ 1 callersMethoddisplay_s

CPP/questions/SingleInheritance.cpp:36

↓ 1 callersFunctiondist_minm

note: line 48 will execute recursively then at the end line 60 will update it then line 50 will make further updations

graph/code19.cpp:32

↓ 1 callersMethoddistance

Return the distance from the turtle to (x,y) in turtle step units. Arguments: x -- a number or a pair/vector of numbers or a t

Python/Turtle.py:1727

↓ 1 callersFunctiondivide

Python/Calculator.py:24

↓ 1 callersFunctiondp

(i, isPrefix, isBigger)

↓ 1 callersMethodduplicate

Java/Leetcode/Leetcode442.java:13

↓ 1 callersMethodduplicateElement

Java/Array/FindDuplicate.java:44

↓ 1 callersMethodencrypt

(String strToEncrypt)

Java/AES.java:24

← previous next →601–700 of 2,714, ranked by callers