Functions — github.com/Codensity30/Strivers-A2Z-DSA-Sheet

CodeHub MCPcopy Create free account

hub / github.com/Codensity30/Strivers-A2Z-DSA-Sheet / functions

Functions668 in github.com/Codensity30/Strivers-A2Z-DSA-Sheet

⨍ Functions 668◇ Types & classes 33

07.Stack and Queues/4. Implementation/04. LRU Cache.cpp:49

15. Tries/2. Problems/04. Bitwise basic operations.cpp:26

FunctiongetBottomView

11. Binary Trees/2. Medium Problems/10. Bottom View.cpp:18

FunctiongetCount

04.Linked List/1. Single Linked List/04.Count_the_number_of_nodes_linked_list.cpp:36

FunctiongetFloorAndCeil

02.Binary Search/1D Arrays/03.Implement_lower_upper_bound.cpp:61

07.Stack and Queues/1. Learning/07. Implement min stack.cpp:72

FunctiongetNewsFeed

09. Heaps/3. Hard Problems/01. Design Twitter.cpp:49

FunctiongetOddOccurrence

QUESTION: Given an array of N positive integers where all numbers occur an even number of times except one number which occurs an odd number of times.

06.Bit Manipulation/2. Interview Problems/02. Exceptionally odd.cpp:14

FunctiongetPathFromRootToNode

11. Binary Trees/3. Hard/01. All root to leaf paths.cpp:35

01.Arrays/3.Hard/01.Pascal_triangle.cpp:22

FunctiongetTopView

11. Binary Trees/2. Medium Problems/09. Top View.cpp:18

FunctiongetTreeTraversal

11. Binary Trees/1. Traversals/10. All in one traversal.cpp:35

15. Tries/2. Problems/04. Bitwise basic operations.cpp:22

FunctiongraphColoring

05.Recursion/3.Try Out All Combos/04.M coloring problem.cpp:49

FunctionhasCycle

04.Linked List/3.Medium Problems of LL/03.Detect_loop_in_LL.cpp:32

FunctionhasNext

12. Binary Search Trees/2. Practice Problems/09. BST Iterator.cpp:49

Function to heapify the heap.

09. Heaps/1. Learning/01. Implement min heap.cpp:30

FunctioninOrder

11. Binary Trees/3. Hard/12. Morris Inorder Traversal.cpp:27

FunctioninfixToPostfix

07.Stack and Queues/2. Infix, Postfix, and Prefix/02. Infix to prefix.cpp:27

FunctioninfixToPostfix

07.Stack and Queues/2. Infix, Postfix, and Prefix/01. Infix to postfix.cpp:27

FunctioninorderTraversal

11. Binary Trees/1. Traversals/04. Inorder Traversal.cpp:16

FunctioninorderTraversal

11. Binary Trees/1. Traversals/08. Iterative Inorder Traversal.cpp:25

10. Greedy Approach/2. Medium/07. Insert Interval.cpp:29

15. Tries/1. Theory/01. Implement Trie (Prefix Tree).cpp:40

15. Tries/2. Problems/01. Implement Trie 2.cpp:42

FunctioninsertAtBegining

04.Linked List/1. Single Linked List/02.Inserting_node_to_linked_list.cpp:50

FunctioninsertAtEnd

Function to insert a node at the end of the linked list.

04.Linked List/1. Single Linked List/02.Inserting_node_to_linked_list.cpp:60

FunctioninsertIntoBST

12. Binary Search Trees/2. Practice Problems/03. Insert into BST.cpp:28

FunctioninversionCount

01.Arrays/3.Hard/10.Count_inversions.cpp:64

FunctionisAnagram

03.Strings/1.Easy/07.Valid_anagram.cpp:29

FunctionisBalanced

11. Binary Trees/2. Medium Problems/02. Balanced Binary Tree.cpp:29

FunctionisBipartite

13. Graphs/2. Traversal Problems/11. Bipartite Graph.cpp:36

FunctionisCycle

13. Graphs/2. Traversal Problems/04. Detect Cycle in Undirected Graph.cpp:29

FunctionisCyclic

13. Graphs/2. Traversal Problems/12. Detect Cycle in Directed Graph.cpp:31

FunctionisCyclic

13. Graphs/3. Topo Sort Problems/02. Kahn's Algorithm.cpp:17

FunctionisIsomorphic

03.Strings/1.Easy/05.Isomorphic_string.cpp:19

FunctionisMatch

14. Dynamic Programming/5. DP on Strings/09. Wildcard Matching.cpp:52

FunctionisMaxHeap

09. Heaps/1. Learning/02. Check if array is heap.cpp:33

FunctionisPalindrome

04.Linked List/3.Medium Problems of LL/06.Check_for_palindrome_LL.cpp:36

FunctionisPossibleDivide

09. Heaps/2. Medium Problems/07. Divide array into sets of K consecutive number.cpp:31

FunctionisPowerOfTwo

06.Bit Manipulation/1. Learn Bit Manipulation/04.Check for the power of 2.cpp:27

FunctionisSameTree

11. Binary Trees/2. Medium Problems/05. Same Tree.cpp:19

FunctionisSubsetSum

14. Dynamic Programming/4. DP on Subsequences/01. Subset sum equal to k.cpp:96

FunctionisSumTree

11. Binary Trees/3. Hard/04. Check children sum property.cpp:47

FunctionisSymmetric

11. Binary Trees/2. Medium Problems/12. Symmetric Tree.cpp:43

FunctionisValid

07.Stack and Queues/1. Learning/06. Valid Parenthesis.cpp:25

FunctionisValidBST

12. Binary Search Trees/2. Practice Problems/06. Validate BST.cpp:36

FunctionisValidBST

12. Binary Search Trees/1. Concept/01. Intro to BST.cpp:22

10. Greedy Approach/2. Medium/03. Jump Game 2.cpp:32

FunctionkDistinctChars

08. Sliding Window/2. Hard Problems/01. Longest Substring with at most K unique characters.cpp:25

FunctionknapSack

14. Dynamic Programming/4. DP on Subsequences/10. Unbounded Knapsack.cpp:98

FunctionknapSack

14. Dynamic Programming/4. DP on Subsequences/06. 01 Knapsack.cpp:95

Functionkosaraju

13. Graphs/6. Other Algorithms/02. Strongly Connected Components.cpp:38

FunctionkthElement

02.Binary Search/In Search Space/14.Kth_element_of_two_sorted_arrays.cpp:34

FunctionkthSmallest

12. Binary Search Trees/2. Practice Problems/05. Kth smallest element in BST.cpp:50

FunctionladderLength

13. Graphs/2. Traversal Problems/08. Word Ladder.cpp:33

Functionlargest

01.Arrays/1.Easy/01.Largest_element_in_array.cpp:24

FunctionlargestBst

12. Binary Search Trees/2. Practice Problems/12. Largest BST in Binary Tree.cpp:31

FunctionlargestDivisibleSubset

14. Dynamic Programming/7. DP on LIS/03. Largest Divisible Subset.cpp:51

FunctionlargestIsland

13. Graphs/5. MST Problems/07. Making Large Island.cpp:59

FunctionlargestOddNumber

03.Strings/1.Easy/03.Largest_odd_number_in_string.cpp:21

FunctionlargestRectangleArea

07.Stack and Queues/3. Monotonic Stack and Queue/08. Largest Rectangle in Histogram.cpp:54

Functionleaders

01.Arrays/2.Medium/09.Leaders_in_array.cpp:29

FunctionleastInterval

09. Heaps/2. Medium Problems/06. Task Scheduler.cpp:23

FunctionleftRotate

01.Arrays/1.Easy/06.Rotate_array_left&right_by_k_places.cpp:48

FunctionleftSmaller

07.Stack and Queues/3. Monotonic Stack and Queue/03. Previous Smaller Element.cpp:19

FunctionlemonadeChange

10. Greedy Approach/1. Easy/03. Lemonade Exchange.cpp:35

FunctionlenOfLongSubarr

Question: Given an array containing N integers and an integer K, find the length of the longest subarray with the sum of the elements equal to K. Exa

01.Arrays/3.Hard/13.Longest_subarray_with_sum_k_containg_+ves_and_-ves.cpp:18

FunctionlengthOfLIS

14. Dynamic Programming/7. DP on LIS/01. Longest Increasing Subsequence.cpp:36

FunctionlengthOfLongestSubstring

08. Sliding Window/1. Medium Problems/01. Longest Substring Without Repeating Characters.cpp:21

FunctionletterCombinations

05.Recursion/2.Subsequences Pattern/10.Letter combinations of phone.cpp:44

FunctionlevelOrder

11. Binary Trees/1. Traversals/06. Level Order Traversal.cpp:19

FunctionlongestCommonPrefix

03.Strings/1.Easy/04.Longest_common_prefix.cpp:24

FunctionlongestCommonSubsequence

14. Dynamic Programming/5. DP on Strings/01. Longest Common Subsequence.cpp:73

FunctionlongestCommonSubstr

14. Dynamic Programming/5. DP on Strings/03. Longest Common Substring.cpp:49

FunctionlongestConsecutive

01.Arrays/2.Medium/10.Longest_consecutive_subsequence.cpp:31

FunctionlongestIncreasingSubsequence

14. Dynamic Programming/7. DP on LIS/02. Print LIS.cpp:48

FunctionlongestOnes

08. Sliding Window/1. Medium Problems/02. Max Consecutive 1's.cpp:21

FunctionlongestPalindrome

03.Strings/2.Medium/06.Longest_palindromic_substring.cpp:36

FunctionlongestPalindromeSubseq

14. Dynamic Programming/5. DP on Strings/04. Longest Palindromic Subsequence.cpp:62

FunctionlongestPrefix

16. Strings (Hard)/Hard/04. Longest Happy Prefix.cpp:41

FunctionlongestSubarrayWithSumK

01.Arrays/1.Easy/12.Longest_subarray_with_given_sum.cpp:21

FunctionlowestCommonAncestor

12. Binary Search Trees/2. Practice Problems/07. LCA in BST.cpp:29

FunctionlowestCommonAncestor

11. Binary Trees/3. Hard/02. Lowest Common Ancestor.cpp:27

14. Dynamic Programming/1. Intro to DP/01. Find the nth fibonacci number.cpp:39

FunctionmajorityElement

01.Arrays/3.Hard/02.Majority_element_2.cpp:31

FunctionmajorityElement

01.Arrays/2.Medium/03.Majority_element.cpp:29

FunctionmakeConnected

13. Graphs/5. MST Problems/04. Most stones removed.cpp:83

FunctionmakeConnected

13. Graphs/5. MST Problems/03. Number of Operations to make Network.cpp:63

FunctionmatrixMultiplication

14. Dynamic Programming/8. DP on Partition/01. MCM.cpp:46

FunctionmaxCoins

14. Dynamic Programming/8. DP on Partition/03. Burst Ballons.cpp:46

FunctionmaxCombinations

09. Heaps/3. Hard Problems/04. Maximum K sum combinations.cpp:38

FunctionmaxDepth

03.Strings/2.Medium/02.Max_nesting_depth_of_parenthesis.cpp:16

FunctionmaxDepth

11. Binary Trees/2. Medium Problems/01. Height of binary tree.cpp:17

FunctionmaxDistance

02.Binary Search/In Search Space/08.Aggresive_cows.cpp:42

01.Arrays/3.Hard/05.Largest_subarray_with_0sum.cpp:24

FunctionmaxMeetings

10. Greedy Approach/2. Medium/01. N Meetings in one room.cpp:32

FunctionmaxPathSum

11. Binary Trees/2. Medium Problems/04. Maximum Path Sum.cpp:37

FunctionmaxProduct

01.Arrays/3.Hard/12.Maximum_product_subarray.cpp:17

FunctionmaxProfit

01.Arrays/2.Medium/06.Stock_buy_sell.cpp:37

← previous next →401–500 of 668, ranked by callers