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

↓ 1 callersMethodmString

(Set<String> setD,Queue<Character> q,List<String> res,String result)

Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Word Break - Part 2.java:20

↓ 1 callersMethodmaxDepth

(TreeNode root)

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

↓ 1 callersMethodmaxsum

(TreeNode root)

Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Binary Tree Maximum Path Sum.java:8

↓ 1 callersMethodmerge

(ListNode list1, ListNode list2)

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

↓ 1 callersMethodmerge

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

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

↓ 1 callersMethodmerge

(int arr[], int l, int m, int r)

Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-II/Mergesort.java:3

↓ 1 callersMethodmergeSort

(int[] nums, int left, int right)

Step 03 Arrays/Step 3.3 Hard/LeetCode/Reverse Pairs.java:3

↓ 1 callersMethodpartition

(int arr[], int low, int high)

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

↓ 1 callersMethodpop

()

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

↓ 1 callersMethodprintList

(Node n)

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

↓ 1 callersMethodput

(int key, int value)

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

↓ 1 callersMethodremoveTail

()

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

↓ 1 callersMethodrequired_no_of_chunks

(int mid, int m)

Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/LeetCode/Split Array Largest Sum.java:21

↓ 1 callersMethodreverse

(Node head)

Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Linked List that is Sorted Alternatingly.java:114

↓ 1 callersMethodreverse

(ListNode ptr)

Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Palindrome Linked List.java:35

↓ 1 callersMethodreverseWords

(String S)

Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Reverse words in a given string.java:27

↓ 1 callersMethodreverseWords

(String S)

Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Reverse words in a given string.java:27

↓ 1 callersMethodright

(int i)

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

↓ 1 callersMethodrightview

(TreeNode root, List<Integer> ans, int level)

Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Binary Tree Right Side View.java:9

↓ 1 callersMethodromanToDecimal

(String str)

Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Roman Number to Integer.java:27

↓ 1 callersMethodrotate

(Node head, int k)

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

↓ 1 callersMethodselect

(int arr[], int i)

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

↓ 1 callersMethodseparate

(Node head)

Step 06 LinkedList/Step 6.3 Medium Problem of LL/GeeksForGeeks/Linked List that is Sorted Alternatingly.java:47

↓ 1 callersMethodsolve

(int i, String s, String str, List<String> list)

Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Power Set.java:13

↓ 1 callersMethodsolve

(ArrayList<Integer> arr, int ind, int sum, ArrayList<Integer> sub)

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

↓ 1 callersMethodsolve

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

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

↓ 1 callersMethodsolve

(ArrayList<ArrayList<Integer>> ans, int[][] vis, int i, int n)

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

↓ 1 callersMethodsolve

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

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

↓ 1 callersMethodsolve

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

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

↓ 1 callersMethodsolve

(int i, int j, int a[][], int n, ArrayList < String > ans, String move, int vis[][])

Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Rat in a Maze Problem - I.java:2

↓ 1 callersMethodsolve

(char[][] board, String word, int ind, int i, int j, int[][] vis)

Step 07 Recursion/Step 7.3 Try Out All Combo/GeeksForGeeks/Word Search.java:14

↓ 1 callersMethodsolve

(char[][] board)

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

↓ 1 callersMethodsolve

(int col, char[][] board, List < List < String >> res, int leftRow[], int lowerDiagonal[], int upperDiagonal[]

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

↓ 1 callersMethodsolve

(int i, String s, String str, List<String> list)

Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Power Set.java:13

↓ 1 callersMethodtraverse

(Node root)

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

↓ 1 callersMethodtwoSum

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

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

↓ 1 callersMethodvisit

(String s, int p, List<String> wordDict, boolean[] visited)

Step 07 Recursion/Step 7.3 Try Out All Combo/LeetCode/Word Break.java:8

MethodAllParenthesis

(int n)

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

MethodAllPossibleStrings

(String s)

Step 07 Recursion/Step 7.2 Subsequence Pattern/GeeksForGeeks/Power Set.java:3

MethodAllPossibleStrings

(String s)

Step 08 Bit Manipulation/Step 8.2 Interview Problems/GeeksForGeeks/Power Set.java:3

MethodAllPrimeFactors

(int N)

Step 08 Bit Manipulation/Step 8.3 Advance Maths/GeeksForGeeks/Prime Factors.java:3

MethodArmstrongNumber

(int n)

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

MethodDLLNode

(int _key, int _value)

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

MethodDLList

()

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

MethodJobScheduling

(Job arr[], int n)

Step 12 Greedy Algorithms/Step 12.2 Medium-Hard Problems/GeeksForGeeks/Job Sequencing Problem.java:4

MethodKthLargest

(int k, int[] nums)

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

MethodKthMissingElement

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

Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/K-th missing element.java:2

MethodLFUCache

(int capacity)

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

MethodLRUCache

(int cap)

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

MethodLRUCache

(int _capacity)

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

MethodMakeZeros

(int[][] matrix)

Step 03 Arrays/Step 3.2 Medium/GeeksForGeeks/Make Zeroes.java:3

MethodMedianFinder

()

Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Find Median from Data Stream.java:5

MethodMinHeap

(int cap)

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

MethodMinStack

()

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

MethodMyQueue

()

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

MethodMyQueue

()

Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement Queue using array.java:9

MethodMyStack

()

Step 09 Stack and Queues/Step 9.1 Learning/Leetcode/Implement Stack using Queues.java:4

MethodMyStack

()

Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Implement stack using array.java:10

MethodNode

(int data)

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

MethodNode

(int data)

Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Doubly LinkedList Implementatin.java:5

MethodNode

(int data)

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

MethodNode

(int data)

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

MethodNode

(int d)

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

MethodNode

(int d)

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

MethodNode

(int a)

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

MethodNode

(int key)

Step 03 Arrays/Step 3.3 Hard/GeeksForGeeks/Pairwise swap elements of a linked list.java:5

MethodNode

(int key, int value)

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

MethodNode

(int _key, int _value)

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

MethodNthRoot

(int n, int m)

Step 04 Binary Search/Step 4.3 Find Answers by BS in Search Space/GeeksForGeeks/Find Nth root of M.java:3

MethodPair

(int hd, Node node)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Top View of Binary Tree.java:25

MethodPair

(int hd, Node node)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Bottom View of Binary Tree.java:7

MethodPair

(int hd,Node node)

Step 13 Binary Trees/Step 13.2 Medium Problems/GeeksForGeeks/Vertical Traversal of Binary Tree.java:7

MethodPair

(TreeNode _node, int _num)

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

MethodPair

(int first, int second)

Step 09 Stack and Queues/Step 9.1 Learning/GeeksForGeeks/Get minimum element from stack.java:9

MethodPair

(int first, int second)

Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Sorting Elements of an Array by Frequency.java:6

MethodPair

(int key, int value)

Step 11 Heaps/Step 11.3 Hard Problems/GeeksForGeeks/Top K Frequent Elements in Array.java:4

MethodSolveSudoku

(int grid[][])

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

MethodStockSpanner

()

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

MethodStockSpanner

()

Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Online Stock Span.java:4

MethodTreeNode

()

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

MethodTuple

(TreeNode node, int row, int col)

Step 13 Binary Trees/Step 13.2 Medium Problems/LeetCode/Vertical Order Traversal of a Binary Tree.java:4

MethodTwitter

()

Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Design Twitter.java:6

MethodaddNode

(Node head_ref, int pos, int data)

Step 06 LinkedList/Step 6.2 Doubly Linked List/GeeksForGeeks/Doubly linked list Insertion at given position.java:17

MethodaddNum

(int num)

Step 11 Heaps/Step 11.3 Hard Problems/LeetCode/Find Median from Data Stream.java:9

MethodaddOne

(Node head)

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

MethodaddOperators

(String num, int target)

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

MethodaddTwoNumbers

(ListNode l1, ListNode l2)

Step 06 LinkedList/Step 6.3 Medium Problem of LL/LeetCode/Add Two Numbers.java:12

MethodallPairs

( long A[], long B[], long N, long M, long X)

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

MethodareIsomorphic

(String str1,String str2)

Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Isomorphic Strings.java:4

MethodareRotations

(String s1, String s2 )

Step 05 strings/Step 5.1 Basic and Easy String Problems/GeeksForGeeks/Check if strings are rotations of each other or not.java:4

MethodarraySortedOrNot

(int[] arr, int n)

Step 03 Arrays/Step 3.1 Easy/GeeksForGeeks/Check if array is sorted.java:2

MethodasteroidCollision

(int[] asteroids)

Step 09 Stack and Queues/Step 9.3 Monotonic stack ans Queue Problems/Leetcode/Asteroid Collision.java:2

Methodatoi

(String str)

Step 07 Recursion/Step 7.1 Get a Strong Hold/GeeksForGeeks/Implement Atoi.java:3

Methodatoi

(String str)

Step 05 strings/Step 5.2 Medium String Problems/GeeksForGeeks/Implement Atoi.java:3

MethodbeautySum

(String s)

Step 05 strings/Step 5.2 Medium String Problems/LeetCode/Sum of Beauty of All Substrings.java:2

Methodbinarysearch

(int arr[], int n, int k)

Step 04 Binary Search/Step 4.1 Learning BS on 1D Array/GeeksForGeeks/Binary Search.java:2

MethodbottomView

(Node root)

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

Methodboundary

(Node node)

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

MethodbubbleSort

(int arr[], int n)

Step 02 Learn Important Sorting Techniques/Step 2.1 Sorting-I/Bubblesort.java:4

MethodcalculateSpan

(int price[], int n)

Step 09 Stack and Queues/Step 9.4 Implementation Problems/GeeksForGeeks/Stock span problem.java:4

← previous next →101–200 of 558, ranked by callers