Functions — github.com/Prince-1501/Hello_world-Competiitve-Programming

CodeHub MCPcopy Create free account

hub / github.com/Prince-1501/Hello_world-Competiitve-Programming / functions

Functions340 in github.com/Prince-1501/Hello_world-Competiitve-Programming

⨍ Functions 340◇ Types & classes 123

↓ 106 callersMethodsize

Leetcode/Rotate List.cpp:17

↓ 57 callersMethodpush

Leetcode/stack/Min Stack.cpp:11

↓ 34 callersMethodempty

Leetcode/stack/Implement Queue using Stacks.cpp:34

↓ 34 callersMethodpop

Leetcode/stack/Min Stack.cpp:19

↓ 30 callersMethodtop

Leetcode/stack/Min Stack.cpp:28

↓ 8 callersFunctioninorder

Tree/Insertion in BST.cpp:26

↓ 7 callersFunctioninsert

Tree/Insertion in BST.cpp:34

↓ 7 callersFunctioninsert

Tree/Code of Deletion of Node in BST.cpp:34

↓ 5 callersFunctionnewNode

Tree/code of preorer and Postorder traversal.cpp:18

↓ 5 callersFunctionnewNode

Tree/Code of Inorder Traversal.cpp:18

↓ 5 callersFunctionpush

Data Structures/Delete a node of a linked list.cpp:33

↓ 4 callersFunctioninorderUtil

Leetcode/Tree/Vertical Width of a Binary Tree .cpp:21

↓ 4 callersFunctionnewNode

Tree/Binary_tree.cpp:17

↓ 3 callersFunctiondeleteNode

Given a binary search tree and a key, this function deletes the key and returns the new root */

Tree/Code of Deletion of Node in BST.cpp:68

↓ 3 callersFunctioninorder

Tree/Code of Deletion of Node in BST.cpp:26

↓ 3 callersFunctionpush

Data Structures/Doubly Linked list.cpp:35

↓ 3 callersFunctionpush

Data Structures/Insert Node at the End of Doubly Linked List.cpp:35

↓ 3 callersFunctionpush

Data Structures/Add a node at the front of linked list.cpp:40

↓ 3 callersFunctionpush

Data Structures/Add a node at the Middle of linked list.cpp:34

↓ 3 callersFunctionpush

Data Structures/Insert Node in Middle of Doubly Linkedlist.cpp:35

↓ 3 callersFunctionpush

Data Structures/Add a node at the end of linked list.cpp:34

↓ 2 callersMethodempty

Leetcode/stack/Implement Stack using Queues.cpp:36

↓ 2 callersMethodpop

Leetcode/stack/Implement Stack using Queues.cpp:25

↓ 2 callersFunctionprintList

------- Print the Linked List -------*/

Data Structures/Delete a node of a linked list.cpp:21

↓ 2 callersFunctionshow

STL/List_in_STL.cpp:15

↓ 2 callersFunctionshow

STL/Vectors_Functions_in_STL.cpp:15

↓ 2 callersFunctionshow

STL/Queue_in_STL.cpp:15

↓ 2 callersFunctionshow

STL/Binary search in STL.cpp:13

↓ 2 callersFunctionshowArray

STL/sort_in_STL.cpp:14

↓ 2 callersFunctionshowDeque

STL/deque_in_STL.cpp:15

↓ 2 callersFunctionshowPriorityQueue

STL/priority Queue in STL.cpp:15

↓ 2 callersMethodstudentDetails

Data Structures/structure_in_c++.cpp:17

↓ 1 callersFunctionappend

Data Structures/Insert Node at the End of Doubly Linked List.cpp:72

↓ 1 callersFunctionappend

Data Structures/Add a node at the end of linked list.cpp:53

↓ 1 callersMethodcount

Leetcode/Graph/Number of Enclaves.cpp:6

↓ 1 callersFunctioncountOnes

Function to count number of Ones arr: input array N: size of input array

Leetcode/count 1's in binary array.cpp:11

↓ 1 callersFunctiondeleteNode

Data Structures/Delete a node of a linked list.cpp:43

↓ 1 callersFunctionfindSum

Leetcode/sum of numbers in string.cpp:6

↓ 1 callersFunctionfloorSqrt

Function to find square root x: element to find square root

Leetcode/Square root.cpp:13

↓ 1 callersFunctiongcd

56_codechef_Chef_and_Interesting_Subsequences.cpp:16

↓ 1 callersFunctiongcd

Lecture - 25.cpp:12

↓ 1 callersFunctioninsert

Tree/code of Hashing in C++.cpp:34

↓ 1 callersFunctioninsertAfter

Data Structures/Insert Node at the End of Doubly Linked List.cpp:51

↓ 1 callersFunctioninsertAfter

Data Structures/Add a node at the Middle of linked list.cpp:43

↓ 1 callersFunctioninsertAfter

Data Structures/Insert Node in Middle of Doubly Linkedlist.cpp:51

↓ 1 callersFunctioninsertAfter

Data Structures/Add a node at the end of linked list.cpp:43

↓ 1 callersFunctionmajorityElement

Function to find majority element in the array

Leetcode/Majority Element Geeksforgeeks leetcode Moore's Voting Algorithm.cpp:8

↓ 1 callersFunctionminValueNode

Tree/Code of Deletion of Node in BST.cpp:55

↓ 1 callersFunctionmodifyQueue

Function to reverse first k elements of a queue.

Leetcode/stack/Reverse First K elements of Queue.cpp:35

↓ 1 callersFunctionnCr

56_codechef_Chef_and_Interesting_Subsequences.cpp:23

↓ 1 callersFunctionnewNode

Tree/Insertion in BST.cpp:17

↓ 1 callersFunctionnewNode

Tree/Code of Deletion of Node in BST.cpp:17

↓ 1 callersMethodpop

Leetcode/stack/Implement Queue using Stacks.cpp:17

↓ 1 callersFunctionprintCircularList

Data Structures/Circular Linked List data_structure.cpp:31

↓ 1 callersFunctionprintElementOfStack

STL/stack in STL data structure.cpp:15

↓ 1 callersFunctionprintInorder

Tree/code of preorer and Postorder traversal.cpp:27

↓ 1 callersFunctionprintInorder

Tree/Code of Inorder Traversal.cpp:27

↓ 1 callersFunctionprintList

------- Print the Douubly Linked List ------- */

Data Structures/Doubly Linked list.cpp:23

↓ 1 callersFunctionprintList

------- Print the Doubly Linked List ------- */

Data Structures/Insert Node at the End of Doubly Linked List.cpp:23

↓ 1 callersFunctionprintList

------- Print the Linked List -------*/

Data Structures/Add a node at the front of linked list.cpp:22

↓ 1 callersFunctionprintList

------- Print the Linked List -------*/

Data Structures/Add a node at the Middle of linked list.cpp:22

↓ 1 callersFunctionprintList

------- Print the Doubly Linked List ------- */

Data Structures/Insert Node in Middle of Doubly Linkedlist.cpp:23

↓ 1 callersFunctionprintList

------- Print the Linked List -------*/

Data Structures/Add a node at the end of linked list.cpp:22

↓ 1 callersFunctionprintList

Data Structures/LinkedList_Code_Practice.cpp:21

↓ 1 callersFunctionprintMiddleElement

Data Structures/Find the middle of a given linked list.cpp:32

↓ 1 callersFunctionprintNode

Tree/Binary_tree.cpp:34

↓ 1 callersFunctionprintPostorder

Tree/code of preorer and Postorder traversal.cpp:58

↓ 1 callersFunctionprintPreorder

Tree/code of preorer and Postorder traversal.cpp:41

↓ 1 callersMethodpush

Leetcode/stack/Implement Queue using Stacks.cpp:13

↓ 1 callersFunctionrearrange

Leetcode/Rearrange Array Alternately Geeksforgeeks.cpp:6

↓ 1 callersFunctionsearch

Tree/code of Hashing in C++.cpp:17

↓ 1 callersFunctionseive

Lecture - 24.cpp:13

↓ 1 callersFunctiontrappingWater

function to find the trapped water in between buildings arr: input array n: size of array

Leetcode/Trapping Rain Water.cpp:7

Leetcode/Graph/Topological sort using dfs.cpp:12

Leetcode/Graph/Find Eventual Safe States.cpp:6

Leetcode/Graph/Course Schedule.cpp:6

Leetcode/Hashing/LFU Cache.cpp:32

Templates_in_c++.cpp:14

Leetcode/linkedlist/Sort List.cpp:16

Leetcode/stack/Min Stack.cpp:7

Leetcode/stack/Implement Queue using Stacks.cpp:9

Leetcode/stack/Implement Stack using Queues.cpp:8

FunctionNumberofElementsInIntersection

Leetcode/Hashing/Intersection of two arrays.cpp:3

MethodPosNegPair

Leetcode/Hashing/Pairs with Positive Negative values.cpp:6

MethodStockSpanner

Leetcode/stack/Online Stock Span.cpp:6

MethodTOHHelper

Leetcode/Recursion/Tower Of Hanoi.cpp:9

MethodaddDigits

Leetcode/Add Digits.cpp:17

MethodaddDigitsHelper

Leetcode/Add Digits.cpp:7

MethodaddTwoNumbers

Leetcode/Add Two Numbers Leetcode Solutions in Linkedlist.cpp:16

MethodallPathsSourceTarget

Leetcode/Graph/All Paths From Source to Target.cpp:22

FunctionbooleanMatrix

Leetcode/Boolean Matrix.cpp:3

MethodbuildTree

Leetcode/Tree/Construct Binary Tree from Preorder and Inorder Traversal.cpp:42

MethodbuildTreeUtil

Leetcode/Tree/Construct Binary Tree from Preorder and Inorder Traversal.cpp:19

MethodcanFinish

Leetcode/Graph/Course Schedule.cpp:26

MethodcanPartition

Leetcode/Recursion/Partition Equal Subset Sum.cpp:18

MethodcanVisitAllRooms

Leetcode/Graph/Keys and Rooms.cpp:5

Function to check if two arrays are equal or not.

Leetcode/Hashing/Check if two arrays are equal or not.cpp:7

MethodclimbStairs

Leetcode/Recursion/Climbing Stairs.cpp:6

MethodclosedIsland

Leetcode/Graph/Number of closed Islands.cpp:30

Leetcode/Tree/Populating Next Right Pointers in Each Node.cpp:23

next →1–100 of 340, ranked by callers