MCPcopy Create free account

hub / github.com/Vishruth-S/CompetitiveCode / functions

Functions692 in github.com/Vishruth-S/CompetitiveCode

MethodNode
GeeksForGeeks/Merge_Sort_for_Linked_List/Solution.cpp:21
MethodPredictTheWinner
(self, nums: List[int])
LeetCode_problems/Predict the winner/Solution.py:76
Method__init__
(self,vertices)
HackerEarth_problems/Edges on a path/solution.py:13
Method__init__
(self, val=0, next=None)
LeetCode_problems/merge two sorted linked list/Solution.py:9
Method__init__
(self, x)
LeetCode_problems/Add Two Numbers Linked List/solution.py:9
Method__init__
(self , dataval=None)
LeetCode_problems/Cycle Detection in Linked List/Solution.py:2
Method__init__
(self)
LeetCode_problems/Cycle Detection in Linked List/Solution.py:7
Method__init__
(self,val)
LeetCode_problems/Invert Binary Tree/invert_binary_Tree.py:5
Method__init__
(self, node_data)
Hackerrank_problems/Reverse Linked List/solution.py:10
Method__init__
(self)
Hackerrank_problems/Reverse Linked List/solution.py:15
Method__init__
(self, node_data)
Hackerrank_problems/Cycle Detection/solution.py:10
Method__init__
(self)
Hackerrank_problems/Cycle Detection/solution.py:15
Functionadd
Codeforces_problems/Two Platforms/solution.cpp:53
MethodaddBinary
(self, a, b)
LeetCode_problems/add-binary/Solution.py:17
MethodaddDigits
LeetCode_problems/add digits/solution.cpp:3
MethodaddOneRow
LeetCode_problems/add one row to tree/solution.cpp:14
MethodaddStrings
(self, num1: str, num2: str)
LeetCode_problems/Add Strings/Solution.py:16
MethodaddStrings
LeetCode_problems/Add Strings/solution.cpp:3
MethodaddTwoNumbers
(self, l1: ListNode, l2: ListNode)
LeetCode_problems/Add Two Numbers Linked List/solution.py:15
FunctionadjacentElementsProduct
(inputArray)
CodeSignal_problems/AdjacentElementsProduct/solution.js:7
Functionage
(planet, age)
Exercism_Problems/space_age/solution.js:2
Functionanagrams
(word, words)
Codewars_problems/Where my Anagrams At/solution.js:1
Methodarrange
The function is coded as follows:
InterviewBit_problems/EncodingBased problem/Solution.cpp:12
MethodarrayPairSum
(self, nums: List[int])
LeetCode_problems/Array Partition 1/solution(1).py:4
Methodbfs
HackerEarth_problems/New Friends/solution.cpp:67
MethodcalculateMinimumHP
LeetCode_problems/Dungeon Game/solution.cpp:23
MethodcanCompleteCircuit
LeetCode_problems/Gas Station/solution.cpp:28
Functioncheck_binary_search_tree_
Verify if the nodes are in ascending order. If the nodes are not in asceding order then the tree is not a binary search tree otherwise it
Hackerrank_problems/Is This a Binary Search Tree/solution.py:20
Functionchmax
Codeforces_problems/Bargain/solution.cpp:58
Functionchmin
Codeforces_problems/Bargain/solution.cpp:57
Functioncipher_word
(string)
Misc/Caesar_Cipher_Encryptor/solution2.py:26
MethodcloneGraph
LeetCode_problems/graph clone/solution.cpp:5
MethodcombinationSum
(self, candidates: List[int], target: int)
LeetCode_problems/Combination Sum/Solution.py:16
MethodcompareVersion
LeetCode_problems/Compare Version Number/solution2.cpp:25
MethodcompareVersion
LeetCode_problems/Compare Version Number/solution.cpp:17
MethodcountAndSay
LeetCode_problems/Count and Say/solution.cpp:1
MethodcountGoodTriplets
(self, arr: List[int], a: int, b: int, c: int)
LeetCode_problems/count-good-triplets/Solution.py:13
MethodcountOrders
LeetCode_problems/Count All Valid Pickup and Delivery Options/solution.cpp:25
MethodcountSquares
(int[][] matrix)
LeetCode_problems/Count Square Submatrices with All Ones/solution.java:2
FunctiondayOfProgrammer
(year)
Hackerrank_problems/Day_Of_The_Programmer/solution2.py:2
Functiondef_val
()
CodeChef_problems/CHFNSWPS/solution.py:21
Functiondef_value
()
CodeChef_problems/Bob and His Friends/Solution.py:45
MethoddefangIPaddr
(self, address: str)
LeetCode_problems/Defanging an IP Address/solution.py:2
MethoddeleteNode
(ListNode node)
LeetCode_problems/Delete Node/Solution.java:10
MethoddetectLoop
(Node head)
GeeksForGeeks/Detect Loop in Linked List/Solution.java:14
Methoddfs
HackerEarth_problems/New Friends/solution.cpp:83
Methoddfs
LeetCode_problems/Number of Islands/solution1.cpp:5
Methoddfs
LeetCode_problems/Unique Paths III/solution.cpp:8
Methoddigitsum
Calculates the sum of the digits*/
CodeChef_problems/MINDSUM/solution.cpp:29
FunctiondistinctSubseqII
LeetCode_problems/Distinct Subsequence II/solution.cpp:24
MethodfindDuplicates
(int[] nums)
LeetCode_problems/Find all duplicates in an array/Solution.java:13
MethodfindIslands
(ArrayList<ArrayList<Integer>> A, int N, int M)
GeeksForGeeks/Number of islands/Islands.java:5
MethodfindLeastNumOfUniqueInts
(self, arr: List[int], q: int)
LeetCode_problems/Least Number of Unique Integers after K Removals/solution.py:2
MethodfindMedianSortedArrays
LeetCode_problems/Median_of_two_sorted_array/solution.cpp:17
FunctionfindMergeNode
Go forward the lists every time till the end, and then jumps to the beginning of the opposite list, and so on. Advance each of the pointe
Hackerrank_problems/Find Merge Point of Two Lists/solution.py:8
FunctionfindPosBruteForce
(x1, v1, x2, v2)
Hackerrank_problems/kangaroo/solution1.py:25
MethodfindTheDifference
(self, s: str, t: str)
LeetCode_problems/Find_the_Difference/solution.py:3
MethodfirstBadVersion
:type n: int :rtype: int
LeetCode_problems/first-bad-version/Solution.py:12
FunctionfirstMissingPositive
(self, nums: List[int])
LeetCode_problems/First Missing Positive/solution.py:12
MethodfirstUniqChar
(self, s: str)
LeetCode_problems/First_Unique_Character_in_a_String/solution.py:3
Functionfo
Codeforces_problems/police recruits/solution.cpp:12
MethodfreqAlphabets
LeetCode_problems/DecryptStringFromAlphabetToInteger/solution.cpp:20
Functionfunc
(nums)
Hackerrank_problems/Maximize_It!/solution.py:16
MethodgenerateMatrix
(int n)
LeetCode_problems/Spiral Matrix II/solution.java:27
MethodgetAllElements
LeetCode_problems/all elements in two binary search trees/solution.cpp:23
MethodgetMedianFromOneArray
LeetCode_problems/Median_of_two_sorted_array/solution.cpp:6
MethodgetPermutation
LeetCode_problems/Permutation Sequence/Solution.cpp:25
MethodgetWinner
LeetCode_problems/Winner of an Array Game/solution.cpp:3
Methodget_price
Hackerrank_problems/Hotel Price/solution.cpp:25
MethodgroupAnagrams
(String[] strs)
LeetCode_problems/Anagrams/Solution.java:21
MethodhIndex
(self, citations: List[int])
LeetCode_problems/H_Index/solution.py:62
Methodhelper
(target,index,sub_list)
LeetCode_problems/Combination Sum/Solution.py:21
Methodinsert
(int[][] intervals, int[] newInterval)
LeetCode_problems/Insert Interval/InsertInterval.java:2
Methodinsert
LeetCode_problems/add one row to tree/solution.cpp:25
MethodinsertIntoBST
(self, root: TreeNode, val: int)
LeetCode_problems/insert-into-a-binary-search-tree/Add Strings/Solution.py:15
MethodisMatch
(self, s: str, p: str)
LeetCode_problems/Wildcard_Matching/solution.py:8
FunctionisMonotonic
(array)
Misc/Monotonic_Array/solution2.py:6
MethodisMonotonic
(self, A: List[int])
LeetCode_problems/Monotonic Array/solution_1.py:2
FunctionisMonotonicAlternative
(array)
Misc/Monotonic_Array/solution.py:7
MethodisPower
InterviewBit_problems/Math_Section/Solution.cpp:5
MethodisSameTree
(TreeNode p, TreeNode q)
LeetCode_problems/Same Tree/sameTree.java:27
MethodisSymmetric
InterviewBit_problems/CP_BinaryTree/Solution.cpp:24
FunctionisValid
(s)
Hackerrank_problems/Sherlock and valid strings/solution.py:12
Functionis_leap
(year)
Hackerrank_problems/Check_LeapYear/solution.py:3
MethodkClosest
(int[][] points, int K)
LeetCode_problems/K Closest Points to Origin/Solution.java:2
MethodkthFactor
(self, n: int, k: int)
LeetCode_problems/kth_factor_of_n/solution.py:3
MethodkthSmallest
(self, root: TreeNode, k: int)
LeetCode_problems/kth-smallest-element-in-a-bst/Solution.py:21
Methodlca
InterviewBit_problems/LeastCommonAncestor/solution.cpp:37
MethodlengthOfLastWord
LeetCode_problems/Length of Last Word/solution.cpp:23
MethodlengthOfLongestSubstring
LeetCode_problems/Longest Substring Without Repeating Characters/Solution.cpp:4
MethodlevelOrder
(TreeNode node)
LeetCode_problems/Binary_Tree_level_Order_Traversal/sol.java:18
Methodlistprint
(self)
LeetCode_problems/Cycle Detection in Linked List/Solution.py:11
Functionmain
It's a simple problem focusing on I/O. Continuously take input from user until it reads the number 42 and print the numbers. Problem Tag: #basic #tut
Spoj_problems/TEST/solution.cpp:7
Functionmain
Spoj_problems/CANDY/solution.cpp:5
Functionmain
This method calculates no. of different squares in a given grid of N*N squares. The end of input is indicated by a line containing only one zero. Th
Spoj_problems/SAMER08F/solution.cpp:12
Functionmain
Spoj_problems/ONP/solution.cpp:32
Functionmain
Spoj_problems/ADDREV/solution.cpp:19
Functionmain
In this problem, we need to find the next sequence of give AP or GP series. If a2-a1 == a3-a2, then its a AP series, otherwise its a GP series. */
Spoj_problems/ACPC10A/solution.cpp:9
Functionmain
Spoj_problems/NSTEPS/solution.cpp:24
Functionmain
Spoj_problems/FCTRL/solution.cpp:24
← previousnext →301–400 of 692, ranked by callers