Functions — github.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet

hub / github.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet / functions

Functions558 in github.com/ashutosh11019/Strivers-A2Z-DSA-Course-Sheet

⨍ Functions 558◇ Types & classes 395

↓ 183 callersMethodadd

(int val)

Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Kth Largest Element in a Stream.java:18

↓ 95 callersMethodget

(int key)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LRU Cache.java:21

↓ 80 callersMethodpeek

()

Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Implement Queue using Stacks.java:25

↓ 74 callersMethodsize

()

Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Implement Queue using Stacks.java:40

↓ 72 callersMethodput

(int key, int value)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LRU Cache.java:32

↓ 50 callersMethodpush

(int value)

Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Min Stack.java:9

↓ 47 callersMethodpop

()

Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Min Stack.java:24

↓ 32 callersMethodremove

(Node node)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LRU Cache.java:42

↓ 29 callersMethodsort

(long arr[], long l, long r)

Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Count Inversions.java:43

↓ 17 callersMethodprint

(Node root)

Step 06 LinkedList/Step 6.1 1D Linked List/GeeksForGeeks/LinkedList.java:25

↓ 16 callersMethodempty

()

Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Implement Queue using Stacks.java:35

↓ 11 callersMethodtoString

(char[] a)

Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Generate_all_binary_strings.java:12

↓ 8 callersMethodpush

(Node head, int new_data)

Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Delete all occurrences of a key in DLL.java:43

↓ 8 callersMethodpush

(Node head, int new_data)

Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Remove duplicates from sorted DLL.java:43

↓ 6 callersMethodreverse

(ListNode begin, ListNode end)

Step 06 LinkedList/Step 6.5 Hard Problem of LL/LeetCode/Reverse Nodes in k-Group.java:33

↓ 5 callersMethodpop

()

Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Stack using two queues.java:14

↓ 5 callersMethodprintList

(Node n)

Step 06 LinkedList/Step 6.5 Hard Problem of LL/GeeksForGeeks/Rotate a Linked List.java:40

↓ 5 callersMethodsort

(Stack<Integer> s)

Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Sort a stack.java:2

↓ 4 callersMethodinsert

(int arr[],int i)

Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-I/Insertionsort.java:3

↓ 4 callersMethodisLeaf

(Node node)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Boundary Traversal of binary tree.java:3

↓ 4 callersMethodparent

(int i)

Step 11 Heaps/Step 11.1 Learning/GeeksForGeeks/Binary Heap Operations.java:14

↓ 3 callersMethodget

(int key)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LFU Cache.java:61

↓ 3 callersMethodremove

(Node node)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/LRU Cache.java:37

↓ 3 callersMethodreverse

(Node head)

Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Add two numbers represented by linked lists.java:130

↓ 3 callersMethodreverse

(int[] nums, int i, int j)

Step 03 Arrays/Step 3.1 Easy/LeetCode/Rotate Array.java:2

↓ 3 callersMethodswap

(int a,int b,int[] nums)

Step 03 Arrays/Step 3.2 Medium/LeetCode/Next Permutation.java:2

↓ 2 callersMethodaddNode

(DLLNode currNode)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LFU Cache.java:21

↓ 2 callersMethodcompare

(pair a,pair b)

Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/N meetings in one room.java:10

↓ 2 callersMethoddecreaseKey

(int i, int new_val)

Step 11 Heaps/Step 11.1 Learning/GeeksForGeeks/Binary Heap Operations.java:48

↓ 2 callersMethoddeleteNode

(Node head, Node del)

Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Remove duplicates from sorted DLL.java:53

↓ 2 callersMethodexpandAroundCenter

(String s, int left, int right)

Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Longest Palindromic Substring.java:17

↓ 2 callersMethodgenerate

(int k, char[] ch, int n)

Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Generate_all_binary_strings.java:17

↓ 2 callersMethodheight

(Node root)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Check for Balanced Tree.java:5

↓ 2 callersMethodhelp

(int[] nums, int k)

Step 10 Sliding Window & Two Pointer Combined Problems/Step 10.2 Hard Problems/LeetCode/Subarrays with K Different Integers.java:6

↓ 2 callersMethodhelper

(String S, int K)

Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Count number of substrings.java:8

↓ 2 callersMethodinsert

(Node node)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/LRU Cache.java:28

↓ 2 callersMethodinsert

(Node node)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LRU Cache.java:48

↓ 2 callersMethodnext

(int price)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/Online Stock Span.java:8

↓ 2 callersMethodprec

(char c)

Step 09 Stack and Queues/Step 9.2 Prefix, Infix, PostFix Conversion Problems/GeeksForGeeks/Infix to Postfix.java:2

↓ 2 callersMethodpush

(int x)

Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Implement Queue using Stacks.java:9

↓ 2 callersMethodpush

(int a)

Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Stack using two queues.java:7

↓ 2 callersMethodremoveNode

(DLLNode currNode)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LFU Cache.java:29

↓ 2 callersMethodreverse

(Node head)

Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Add 1 to a number represented as linked list.java:39

↓ 2 callersMethodswap

(int a, int b, int arr[])

Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Next Permutation.java:2

↓ 2 callersMethodswap

(int[] arr, int i, int j)

Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-II/Quicksort.java:4

↓ 2 callersMethodupdateNode

(DLLNode currNode)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/LeetCode/LFU Cache.java:96

↓ 1 callersMethodMinHeapify

(int i)

Step 11 Heaps/Step 11.1 Learning/GeeksForGeeks/Binary Heap Operations.java:62

↓ 1 callersMethodParenthesis

(List<String> l, int max, String s, int open, int close)

Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Generate Parentheses.java:11

↓ 1 callersMethodView

(Node curr, ArrayList<Integer> list, int level)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Left View of Binary Tree.java:28

↓ 1 callersMethodaddLeaves

(Node node, ArrayList<Integer> ans)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Boundary Traversal of binary tree.java:33

↓ 1 callersMethodaddLeftBoundary

(Node node, ArrayList<Integer> ans)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Boundary Traversal of binary tree.java:11

↓ 1 callersMethodaddRightBoundary

(Node node, ArrayList<Integer> ans)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Boundary Traversal of binary tree.java:20

↓ 1 callersMethodaddTwoLists

(Node first, Node second)

Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Add two numbers represented by linked lists.java:81

↓ 1 callersMethodallTraversal

(TreeNode root, List < Integer > pre, List < Integer > in , List < Integer > post)

Step 13 Binary Trees/Step 13.1 Traversals/GeeksForGeeks/Preorder Inorder Postorder Traversals in One Traversal.java:20

↓ 1 callersMethodbalanceHeaps

()

Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Find median in a stream.java:17

↓ 1 callersMethodcheck

(int[][] grid, int row, int col, int num)

Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Sudoku Solver.java:38

↓ 1 callersMethodcheck

(int[][] vis, int i, int j, int n)

Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/N-Queens.java:10

↓ 1 callersMethodcheck

(int[] bloomDay, int mid, int m, int k)

Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Minimum Number of Days to Make m Bouquets.java:2

↓ 1 callersMethodcombination

(List<List<Integer>> ans, List<Integer> comb, int k, int start, int n)

Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Combination Sum III.java:8

↓ 1 callersMethodcompare

(pair p1, pair p2)

Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Find all pairs with a given sum.java:34

↓ 1 callersMethodcompare

(ListNode l1, ListNode l2)

Step 11 Heaps/Step 11.2 Medium Problems/LeetCode/Merge k Sorted Lists.java:14

↓ 1 callersMethodconstruct

(char[][] board)

Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/N-Queens.java:36

↓ 1 callersMethodcount

(Node head)

Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Finding middle element in a linked list.java:22

↓ 1 callersMethodcount

(long power, long x)

Step 07 Recursion/Step 7.1 Get a Strong Hold/LeetCode/Count Good Numbers.java:8

↓ 1 callersMethoddeleteAllOccurOfX

(Node head, int x)

Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Delete all occurrences of a key in DLL.java:29

↓ 1 callersMethoddeleteAllOccurOfX

(Node head, int x)

Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Remove duplicates from sorted DLL.java:29

↓ 1 callersMethoddeleteNode

(Node head, Node del)

Step 06 LinkedList/Step 6.4 Medium Problem of DLL/GeeksForGeeks/Delete all occurrences of a key in DLL.java:53

↓ 1 callersMethodextractMin

()

Step 11 Heaps/Step 11.1 Learning/GeeksForGeeks/Binary Heap Operations.java:20

↓ 1 callersMethodfindAns

(char[][] b, int row, int col, int[][] visit, int i, String s)

Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Word Search.java:16

↓ 1 callersMethodfindCombinations

(int ind, int[] arr, int target, List < List < Integer >> ans, List < Integer > ds)

Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Combination Sum.java:8

↓ 1 callersMethodfindCombinations

(int ind, int[] arr, int target, List < List < Integer >> ans, List < Integer > ds)

Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Combination Sum II.java:9

↓ 1 callersMethodfindSubsets

(int ind, int[] nums, List<Integer> ds, List<List<Integer>> ansList)

Step 07 Recursion/Step 7.2 Subsequence Pattern/LeetCode/Subsets II.java:9

↓ 1 callersMethodfunc

(int ind, int sum, ArrayList < Integer > arr, int N, ArrayList < Integer > sumSubset)

Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Subset Sums.java:2

↓ 1 callersMethodgcd

(Long num1, Long num2)

Step 01 - Basics/Step 1.3 Basic Maths/LCM.java:2

↓ 1 callersMethodget

(int a,int b)

Step 08 Bit Manipulation/Step 8.1 Learn Bit Manipulation/GeeksForGeeks/Swap two numbers.java:2

↓ 1 callersMethodget

(int key)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/LRU Cache.java:43

↓ 1 callersMethodgetMid

(ListNode head)

Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Sort List.java:40

↓ 1 callersMethodgraphColoring

(boolean graph[][], int m, int n)

Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/M-Coloring Problem.java:37

↓ 1 callersMethodheight

(Node node, int[] d)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Diameter of a Binary Tree.java:10

↓ 1 callersMethodheight

(TreeNode root)

Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Diameter of Binary Tree.java:9

↓ 1 callersMethodhelp

(int[] a, int c, String str)

Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Possible Words From Phone Digits.java:14

↓ 1 callersMethodhelp

(List<String> ans, String path, String num, int target, int pos, long val, long cal)

Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Expression Add Operators.java:9

↓ 1 callersMethodhelp

(int[] nums,int mid)

Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Find the Smallest Divisor Given a Threshold.java:21

↓ 1 callersMethodhelper

(List<List<String>> result, String s, int index, List<String> current)

Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Palindromic Partitioning.java:9

↓ 1 callersMethodhelper

(Stack<Integer> s, int num, int n)

Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Reverse a Stack.java:9

↓ 1 callersMethodhelper

(Node node)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Maximum path sum from any node.java:11

↓ 1 callersMethodhelper

(TreeNode left, TreeNode right)

Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Symmetric Tree.java:6

↓ 1 callersMethodhelper

(int[] a, int n, int i)

Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Jump Game.java:11

↓ 1 callersMethodhoursTaken

(int[] piles,int h,int sph)

Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Koko Eating Bananas.java:15

↓ 1 callersMethodinsertionSort

(int arr[], int n)

Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-I/Insertionsort.java:11

↓ 1 callersMethodisPalin

(String s)

Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Longest Palindrome in a String.java:27

↓ 1 callersMethodisPalindrome

(String s)

Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Palindromic Partitioning.java:28

↓ 1 callersMethodisPalindromic

(String str, int i, int j, int[][] dp)

Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Palindromic Partitioning.java:10

↓ 1 callersMethodisPossible

(int node,ArrayList<ArrayList<Integer>> edge,int col[],int i)

Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/M-Coloring Problem.java:54

↓ 1 callersMethodisPossible

(int[] A, int pages, int students)

Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Allocate minimum number of pages.java:27

↓ 1 callersMethodisSymmetricHelp

(Node left, Node right)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Symmetric Tree.java:28

↓ 1 callersMethodisValid

(char[][] board, int row, int col, char c)

Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Sudoku Solver.java:29

↓ 1 callersMethodkSum

(int[] nums, long target, int start, int k)

Step 03 Arrays/Step 3.3 Hard/LeetCode/4Sum.java:7

↓ 1 callersMethodleft

(int i)

Step 11 Heaps/Step 11.1 Learning/GeeksForGeeks/Binary Heap Operations.java:15

↓ 1 callersMethodlongestPalin

(String S)

Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Longest Palindrome in a String.java:37

next →1–100 of 558, ranked by callers