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

MethodfindDuplicate

CPP/Problems/findTheDuplicateNumber.cpp:38

Java/Array/FindGreatestCommonDivisorOfArray.java:11

MethodfindKthLargest

CPP/Problems/kth-largest-element-in-an-array.cpp:6

MethodfindLadders

121 Leetcode/word-ladder-ii.cpp:50

MethodfindLengthOfLCIS

CPP/Problems/Longest-Continuous-Increasing-Subsequence-Easy.cpp:3

MethodfindLonely

CPP/Leetcode/2150-find-all-lonely-numbers-in-the-array/2150-find-all-lonely-numbers-in-the-array.cpp:3

MethodfindMaxConsecutiveOnes

CPP/Leetcode/485-max-consecutive-ones/485-max-consecutive-ones.cpp:3

FunctionfindMaxSubsequentCount

CPP/array-2d/subsegment_partition.cpp:4

MethodfindMedianSortedArrays

(int[] nums1, int[] nums2)

Leetcode-solutions/Binary-search/MedianOfTwoSortedArrays.java:6

MethodfindMedianSortedArrays

Arrays/4.MedianofTwoSortedArray.cpp:6

MethodfindMedianSortedArrays

CPP/Problems/Median of Two Sorted Arrays.cpp:3

MethodfindMedianSortedArrays

(int[] nums1, int[] nums2)

Java/Leetcode-Median-of-2-sorted-arrays.java:4

LeetCode Solutions/154_Find__Minimum_in_Rotated_Sorted_Array_II.cpp:4

CPP/questions/Find Minimum in Rotated Sorted Array II.cpp:5

MethodfindNumbers

Java/Array/FindNoWithEvenNoOfDigits.java:29

MethodfindOriginalArray

CPP/Leetcode/2007-find-original-array-from-doubled-array/2007-find-original-array-from-doubled-array.cpp:3

Leetcode-solutions/Binary-search/ValidPerfectSquare.cpp:7

MethodfindSubarrays

CPP/Leetcode/2395-find-subarrays-with-equal-sum/2395-find-subarrays-with-equal-sum.cpp:3

MethodfindSubstring

CPP/arrays/leetcode-problems/Substring with Concatenation of All Words.cpp:4

MethodfindTheDifference

CPP/Leetcode/389-find-the-difference/389-find-the-difference.cpp:3

Functionfindanode

CPP/binarytreeuse.cpp:253

MethodfirstBadVersion

Leetcode-solutions/Binary-search/FirstbadVersion.java:7

MethodfirstMissingPositive

CPP/Problems/Leetcode-First Missing Positive.cpp:3

MethodfirstMissingPositive

:type nums: List[int] :rtype: int

Python/FirstMissingPositive.py:6

121 Leetcode/114-flatten-binary-tree-to-linked-list.cpp:3

Trees/flatten-binary-tree-to-linked-list.cpp:35

MethodfloodFill

CPP/Problems/Leetcode-733-FloodFill.cpp:26

FunctionfloydWarshall

CPP/graph_tree/Floyd Warshall.cpp:3

Functionfloyd_warshall

Floyd-Warshall algorithm for finding shortest paths in a graph.

Python/floyd_warshall.py:1

FunctionfoldableCheck

CPP/Trees/tree_foldable.cpp:20

CPP/Problems/Leetcode-198-HouseRobber.cpp:4

CPP/recursion/recursion 1.cpp:11

Python/hashtables/firstRecurringnum.py:2

MethodfurthestBuilding

(int[] heights, int bricks, int ladders)

1642-furthest-building-you-can-reach/1642-furthest-building-you-can-reach.java:2

CPP/Leetcode/118-pascals-triangle/118-pascals-triangle.cpp:22

MethodgenerateCombinations

CPP/Problems/Leetcode-77-Combinations.cpp:10

getting all parent nodes for which we want to append nodes

Trees/Leetcode-623. Add One Row to Tree.cpp:16

MethodgetDecimalValue

CPP/Leetcode/1290-convert-binary-number-in-a-linked-list-to-integer/1290-convert-binary-number-in-a-linked-list-to-integer.cpp:13

FunctiongetIthBit

CPP/bitmasking/bit-functions.cpp:8

MethodgetIthBit

Java/FiveBitManipulation/BitOperations.java:3

CPP/Tries/implementTrie.cpp:18

MethodgetSkyline

CPP/questions/The Skyline Problem.cpp:3

MethodgetSkyline

CPP/Problems/Leetcode-The-Skyline-Problem.cpp:3

MethodgetSkyline

(self, buildings)

Python/The-Skyline-Problem.py:2

MethodgetSkyline

(self, A: List[List[int]])

Python/skyline.py:2

MethodgetSkyline

(int[][] buildings)

Java/Leetcode/LeetcodeTheSkylineProblem.java:2

MethodgetXORSum

CPP/Maths/xor_sum_of_all_pairs_and_1835.cpp:3

Functionget_height

Trees/Binary_tree_Array.c:85

Functionget_int

Python/CP_Templates.py:143

Functionget_list

Python/CP_Templates.py:151

Functionget_parent

funtion to get parent

Trees/Binary_tree_Array.c:9

Return the lastly recorded polygon. No argument. Example (for a Turtle instance named turtle): >>> p = turtle.get_poly()

Python/Turtle.py:3364

Methodget_shapepoly

Return the current shape polygon as tuple of coordinate pairs. No argument. Examples (for a Turtle instance named turtle): >

Python/Turtle.py:2863

Functionget_tuple

Python/CP_Templates.py:147

Methodgetcanvas

Return the Canvas of this TurtleScreen. No argument. Example (for a Screen instance named screen): >>> cv = screen.getcanvas

Python/Turtle.py:1225

Methodgetscreen

Return the TurtleScreen object, the turtle is drawing on. No argument. Return the TurtleScreen object, the turtle is drawing on.

Python/Turtle.py:3377

Methodgetturtle

Return the Turtleobject itself. No argument. Only reasonable use: as a function to return the 'anonymous turtle': Example:

Python/Turtle.py:3393

MethodgoodNodes

CPP/Leetcode/1448-count-good-nodes-in-binary-tree/1448-count-good-nodes-in-binary-tree.cpp:30

MethodhammingWeight

CPP/Leetcode/191-number-of-1-bits/191-number-of-1-bits.cpp:3

CPP/Problems/Leetcode-141-linked-list-cycle.cpp:11

(ListNode head)

Java/LinkedList/LinkedListCycle.java:23

MethodhasPathSum

(self, root: Optional[TreeNode], targetSum: int)

CPP/Leetcode/112-path-sum/112-path-sum.py:8

MethodhasPathSum

CPP/Trees/TargetSum.cpp:17

CPP/binarytreeuse.cpp:195

Functionheightdiameter

CPP/binarytreeuse.cpp:203

Move turtle to the origin - coordinates (0,0). No arguments. Move turtle to the origin - coordinates (0,0) and set its headi

Python/Turtle.py:1677

Functioninitial

CPP/array-2d/kadane_algo.cpp:16

CPP/binarytreeuse.cpp:141

Functioninorder

Trees/Binary_tree_Array.c:58

MethodinorderTraversal

CPP/Leetcode/94-binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.cpp:23

MethodinorderTraversal

(self, root: Optional[TreeNode])

CPP/Trees/Inorder_Traversal.py:9

CPP/LINKED LIST/Linked_list.cpp:68

Java/SearchingAlgorithms/BFS/BST.java:21

Methodinsert_when_empty

CPP/LinkedList/all_singly_linkedlist.py:77

Functioninsertatposition

CPP/LINKED LIST/ALGORITHMIC PROBLEMS RELATED TO LINKEDLIST/floydscycle.cpp:42

Functioninsertatposition

CPP/LINKED LIST/ALGORITHMIC PROBLEMS RELATED TO LINKEDLIST/test.cpp:43

Functioninsertatposition

CPP/LINKED LIST/ALGORITHMIC PROBLEMS RELATED TO LINKEDLIST/floydscycle_practice.cpp:67

Functioninsertatposition

CPP/LINKED LIST/ALGORITHMIC PROBLEMS RELATED TO LINKEDLIST/detectloop.cpp:42

Functioninsertatposition

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

Functioninsertatposition

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

Functioninsertatposition

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

FunctioninsertionSort

Python/Sorting-Techniques/InsertionSort.py:1

MethodintToRoman

CPP/Problems/Integer to Roman.cpp:3

MethodintToRoman

:type num: int :rtype: str

Python/IntegerToRoman.py:6

Methodintersection

(int[] nums1, int[] nums2)

Leetcode-solutions/Binary-search/IntersectionOfTwoArrays.java:9

FunctioninvertTree

Trees/Leetcode-226. Invert Binary Tree.cpp:1

MethodisAnagram

CPP/Leetcode/242-valid-anagram/242-valid-anagram.cpp:3

MethodisBalanced

CPP/Trees/BalancedBinarytrees.cpp:24

CPP/sliding-window/Find the K-Beauty of a Number.cpp:3

MethodisBipartite

CPP/graph_tree/Bipartite Graph.cpp:32

(int N, ArrayList<ArrayList<Integer>> adjlist, int n)

graph/cycleDetectionInDirectedGraph.java:19

MethodisCyclicHelper

CPP/graph_tree/Detect a cycle in a graph.cpp:10

CPP/Problems/String to Integer (atoi).cpp:57

CPP/vector-concepts/vector.h:31

Stack/stack_implementation_using_array.c:58

MethodisPalindrome

CPP/Leetcode/125-valid-palindrome/125-valid-palindrome.cpp:3

MethodisPalindrome

CPP/Problems/Palindrome Number.cpp:3

MethodisPalindrome

(ListNode head)

Java/LinkedList/PalindromeLinkedList.java:13

MethodisPerfectSquare

Leetcode-solutions/Binary-search/ValidPerfectSquare.cpp:28

MethodisPowerOfFour

CPP/PowerOfFour.cpp:11

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