SYMBOL INDEX (3946 symbols across 1369 files) FILE: 0012-integer-to-roman/0012-integer-to-roman.java class Solution (line 1) | class Solution { method intToRoman (line 4) | public String intToRoman(int num) { FILE: 0012-integer-to-roman/0012-integer-to-roman.py class Solution (line 1) | class Solution: method intToRoman (line 2) | def intToRoman(self, num: int) -> str: FILE: 0026-remove-duplicates-from-sorted-array/0026-remove-duplicates-from-sorted-array.java class Solution (line 1) | class Solution { method removeDuplicates (line 2) | public int removeDuplicates(int[] nums) { FILE: 0026-remove-duplicates-from-sorted-array/0026-remove-duplicates-from-sorted-array.py class Solution (line 1) | class Solution(object): method removeDuplicates (line 2) | def removeDuplicates(self, nums): FILE: 0036-valid-sudoku/0036-valid-sudoku.java class Solution (line 1) | class Solution { method isCorrect (line 2) | public static boolean isCorrect(char[][] board,int x,int y){ method isValidSudoku (line 17) | public boolean isValidSudoku(char[][] board) { FILE: 0036-valid-sudoku/0036-valid-sudoku.py class Solution (line 1) | class Solution: method isValidSudoku (line 2) | def isValidSudoku(self, board) -> bool: FILE: 0037-sudoku-solver/0037-sudoku-solver.java class Solution (line 1) | class Solution { method solveSudoku (line 2) | public void solveSudoku(char[][] board) { method dfs (line 5) | boolean dfs(int i,int j,char[][]board){ method notInRow (line 31) | boolean notInRow(char arr[][], int row) method notInCol (line 43) | boolean notInCol(char arr[][], int col) method notInBox (line 54) | boolean notInBox(char arr[][], int startRow, int startCol) method safe (line 70) | boolean safe(char arr[][], int row, FILE: 0038-count-and-say/0038-count-and-say.java class Solution (line 1) | class Solution { method countAndSay (line 2) | public String countAndSay(int n) { method getNextState (line 10) | private StringBuilder getNextState(StringBuilder curSb) { FILE: 0038-count-and-say/0038-count-and-say.py class Solution (line 2) | class Solution: method countAndSay (line 3) | def countAndSay(self, n: int) -> str: FILE: 0049-group-anagrams/0049-group-anagrams.java class Solution (line 1) | class Solution { method groupAnagrams (line 2) | public List> groupAnagrams(String[] strs) { FILE: 0049-group-anagrams/0049-group-anagrams.py class Solution (line 3) | class Solution: method groupAnagrams (line 4) | def groupAnagrams(self, strs): FILE: 0055-jump-game/0055-jump-game.java class Solution (line 1) | class Solution { method canJump (line 2) | public boolean canJump(int[] nums) { FILE: 0055-jump-game/0055-jump-game.py class Solution (line 1) | class Solution: method canJump (line 2) | def canJump(self, nums: List[int]) -> bool: FILE: 0057-insert-interval/0057-insert-interval.java class Solution (line 1) | class Solution { method insert (line 2) | public int[][] insert(int[][] intervals, int[] newInterval) { FILE: 0057-insert-interval/0057-insert-interval.py class Solution (line 1) | class Solution: method insert (line 2) | def insert(self, intervals, newInterval): FILE: 0070-climbing-stairs/0070-climbing-stairs.java class Solution (line 1) | class Solution { method climbStairs (line 2) | public int climbStairs(int n) { FILE: 0076-minimum-window-substring/0076-minimum-window-substring.java class Solution (line 1) | class Solution { method minWindow (line 2) | public String minWindow(String s, String t) { FILE: 0079-word-search/0079-word-search.java class Solution (line 1) | class Solution { method exist (line 4) | public boolean exist(char[][] board, String word) { method dfs (line 39) | private boolean dfs(char[][] board, String word, int i, int j, int ci) { FILE: 0093-restore-ip-addresses/0093-restore-ip-addresses.java class Solution (line 1) | class Solution { method valid (line 2) | private boolean valid(String s, int start, int length) { method helper (line 9) | private void helper(String s, int startIndex, List dots, List... method restoreIpAddresses (line 42) | public List restoreIpAddresses(String s) { FILE: 0100-same-tree/0100-same-tree.java class Solution (line 1) | class Solution { method isSameTree (line 2) | public boolean isSameTree(TreeNode p, TreeNode q) { method inOrderTraversal (line 8) | public boolean inOrderTraversal(TreeNode node1, TreeNode node2) { FILE: 0124-binary-tree-maximum-path-sum/0124-binary-tree-maximum-path-sum.java class Solution (line 2) | class Solution { method maxPathSum (line 3) | public int maxPathSum(TreeNode root) { method gainFromSubtree (line 12) | private int gainFromSubtree(TreeNode root) { FILE: 0125-valid-palindrome/0125-valid-palindrome.java class Solution (line 1) | class Solution { method isPalindrome (line 2) | public boolean isPalindrome(String s) { FILE: 0131-palindrome-partitioning/0131-palindrome-partitioning.java class Solution (line 1) | class Solution { method partition (line 2) | public List> partition(String s) { method palPart (line 10) | public void palPart(List> Al1, List Al2,String s,... method isPalindrome (line 29) | public boolean isPalindrome(int start, int i, String s) FILE: 0134-gas-station/0134-gas-station.java class Solution (line 1) | class Solution { method canCompleteCircuit (line 2) | public int canCompleteCircuit(int[] gas, int[] cost) { FILE: 0144-binary-tree-preorder-traversal/0144-binary-tree-preorder-traversal.java class Solution (line 16) | class Solution { method preorderTraversal (line 17) | public List preorderTraversal(TreeNode root) { method preOrder (line 22) | void preOrder(TreeNode root, List list){ FILE: 0149-max-points-on-a-line/0149-max-points-on-a-line.java class Solution (line 1) | class Solution { method maxPoints (line 2) | public int maxPoints(int[][] points) { FILE: 0150-evaluate-reverse-polish-notation/0150-evaluate-reverse-polish-notation.java class Solution (line 1) | class Solution { method evalRPN (line 2) | public int evalRPN(String[] tokens) { method eval (line 8) | private int eval(String[] tokens, int pos, int[] nxtPos) { FILE: 0151-reverse-words-in-a-string/0151-reverse-words-in-a-string.java class Solution (line 1) | class Solution { method reverseWords (line 2) | public String reverseWords(String s) { FILE: 0198-house-robber/0198-house-robber.java class Solution (line 1) | class Solution { method rob (line 2) | public int rob(int[] nums) { FILE: 0212-word-search-ii/0212-word-search-ii.java class Solution (line 1) | class Solution { method findWords (line 5) | public List findWords(char[][] board, String[] words) { method searchWord (line 23) | private List searchWord(char[][] board) { method checkWord (line 35) | private void checkWord(List res, int y, int x, char[][] board,... class Tree (line 69) | class Tree { method isEmpty (line 75) | public boolean isEmpty() { FILE: 0219-contains-duplicate-ii/0219-contains-duplicate-ii.java class Solution (line 1) | class Solution { method containsNearbyDuplicate (line 2) | public boolean containsNearbyDuplicate(int[] nums, int k) { FILE: 0222-count-complete-tree-nodes/0222-count-complete-tree-nodes.java class Solution (line 1) | class Solution { method countNodes (line 2) | public int countNodes(TreeNode root) { FILE: 0223-rectangle-area/0223-rectangle-area.java class Solution (line 1) | class Solution { method computeArea (line 2) | public int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, in... FILE: 0224-basic-calculator/0224-basic-calculator.java class Solution (line 1) | class Solution { method calculate (line 3) | public int calculate(String s) { method calc (line 8) | private int calc(String s) { FILE: 0232-implement-queue-using-stacks/0232-implement-queue-using-stacks.java class MyQueue (line 1) | class MyQueue { method MyQueue (line 6) | public MyQueue() { method push (line 11) | public void push(int x) { method pop (line 16) | public int pop() { method peek (line 25) | public int peek() { method empty (line 34) | public boolean empty() { FILE: 0236-lowest-common-ancestor-of-a-binary-tree/0236-lowest-common-ancestor-of-a-binary-tree.java class Solution (line 1) | class Solution { method lowestCommonAncestor (line 2) | public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNo... FILE: 0237-delete-node-in-a-linked-list/0237-delete-node-in-a-linked-list.java class Solution (line 1) | class Solution { method deleteNode (line 2) | public void deleteNode(ListNode node) { FILE: 0242-valid-anagram/0242-valid-anagram.cpp class Solution (line 1) | class Solution { method isAnagram (line 3) | bool isAnagram(string s, string t) { FILE: 0242-valid-anagram/0242-valid-anagram.java class Solution (line 1) | class Solution { method isAnagram (line 2) | public boolean isAnagram(String a, String b) { FILE: 0263-ugly-number/0263-ugly-number.java class Solution (line 1) | class Solution { method isUgly (line 2) | public boolean isUgly(int n) { FILE: 0279-perfect-squares/0279-perfect-squares.java class Solution (line 1) | class Solution { method numSquares (line 2) | public int numSquares(int n) { FILE: 0290-word-pattern/0290-word-pattern.java class Solution (line 1) | class Solution { method wordPattern (line 2) | public boolean wordPattern(String pattern, String s) { FILE: 0295-find-median-from-data-stream/0295-find-median-from-data-stream.java class MedianFinder (line 1) | class MedianFinder { method MedianFinder (line 5) | public MedianFinder() { method addNum (line 9) | public void addNum(int num) { method findMedian (line 22) | public double findMedian() { FILE: 0309-best-time-to-buy-and-sell-stock-with-cooldown/0309-best-time-to-buy-and-sell-stock-with-cooldown.java class Solution (line 1) | class Solution { method maxProfit (line 2) | public int maxProfit(int[] prices) { FILE: 0328-odd-even-linked-list/0328-odd-even-linked-list.java class Solution (line 11) | class Solution { method oddEvenList (line 12) | public ListNode oddEvenList(ListNode head) { FILE: 0334-increasing-triplet-subsequence/0334-increasing-triplet-subsequence.java class Solution (line 1) | class Solution { method increasingTriplet (line 2) | public boolean increasingTriplet(int[] nums) { FILE: 0345-reverse-vowels-of-a-string/0345-reverse-vowels-of-a-string.java class Solution (line 1) | class Solution { method reverseVowels (line 2) | public String reverseVowels(String s) { method vowel (line 18) | boolean vowel(char c){ FILE: 0374-guess-number-higher-or-lower/0374-guess-number-higher-or-lower.java class Solution (line 6) | public class Solution extends GuessGame { method guessNumber (line 7) | public int guessNumber(int n) { FILE: 0380-insert-delete-getrandom-o1/0380-insert-delete-getrandom-o1.java class RandomizedSet (line 1) | class RandomizedSet { method RandomizedSet (line 5) | public RandomizedSet() { method insert (line 10) | public boolean insert(int val) { method remove (line 21) | public boolean remove(int val) { method swap (line 33) | private void swap(int index) { method getRandom (line 43) | public int getRandom() { FILE: 0409-longest-palindrome/0409-longest-palindrome.java class Solution (line 1) | class Solution { method longestPalindrome (line 2) | public int longestPalindrome(String s) { FILE: 0446-arithmetic-slices-ii-subsequence/0446-arithmetic-slices-ii-subsequence.java class Solution (line 2) | class Solution { method numberOfArithmeticSlices (line 3) | public int numberOfArithmeticSlices(int[] A) { FILE: 0451-sort-characters-by-frequency/0451-sort-characters-by-frequency.java class Solution (line 1) | class Solution { method frequencySort (line 2) | public String frequencySort(String s) { FILE: 0452-minimum-number-of-arrows-to-burst-balloons/0452-minimum-number-of-arrows-to-burst-balloons.java class Solution (line 1) | class Solution { method findMinArrowShots (line 2) | public int findMinArrowShots(int[][] points) { FILE: 0491-non-decreasing-subsequences/0491-non-decreasing-subsequences.java class Solution (line 1) | class Solution { method backtrack (line 2) | private void backtrack(int[] nums, int index, List sequence, method findSubsequences (line 25) | public List> findSubsequences(int[] nums) { FILE: 0520-detect-capital/0520-detect-capital.java class Solution (line 1) | class Solution { method detectCapitalUse (line 2) | public boolean detectCapitalUse(String word) { FILE: 0523-continuous-subarray-sum/0523-continuous-subarray-sum.java class Solution (line 1) | class Solution method checkSubarraySum (line 3) | public boolean checkSubarraySum(int[] nums, int k) FILE: 0587-erect-the-fence/0587-erect-the-fence.java class Solution (line 1) | public class Solution { method orientation (line 2) | public int orientation(int[] p, int[] q, int[] r) { method outerTrees (line 5) | public int[][] outerTrees(int[][] points) { FILE: 0645-set-mismatch/0645-set-mismatch.java class Solution (line 1) | class Solution { method findErrorNums (line 2) | public int[] findErrorNums(int[] nums) { FILE: 0692-top-k-frequent-words/0692-top-k-frequent-words.java class Solution (line 1) | class Solution { method topKFrequent (line 2) | public List topKFrequent(String[] words, int k) { FILE: 0739-daily-temperatures/0739-daily-temperatures.java class Solution (line 1) | class Solution { method dailyTemperatures (line 2) | public int[] dailyTemperatures(int[] a) { FILE: 0766-toeplitz-matrix/0766-toeplitz-matrix.java class Solution (line 1) | class Solution { method isToeplitzMatrix (line 2) | public boolean isToeplitzMatrix(int[][] matrix) { FILE: 0787-cheapest-flights-within-k-stops/0787-cheapest-flights-within-k-stops.java class Solution (line 1) | class Solution { method findCheapestPrice (line 2) | public int findCheapestPrice(int n, int[][] flights, int src, int dst,... FILE: 0790-domino-and-tromino-tiling/0790-domino-and-tromino-tiling.java class Solution (line 1) | class Solution { method numTilings (line 2) | public int numTilings(int n) { FILE: 0797-all-paths-from-source-to-target/0797-all-paths-from-source-to-target.java class Solution (line 1) | class Solution { method allPathsSourceTarget (line 2) | public List> allPathsSourceTarget(int[][] graph) { method dfs (line 11) | public void dfs(int[][] graph, List> ans, List ... FILE: 0834-sum-of-distances-in-tree/0834-sum-of-distances-in-tree.java class Solution (line 1) | class Solution { method sumOfDistancesInTree (line 2) | public int[] sumOfDistancesInTree(int n, int[][] edges) { method buildParents (line 44) | static int[] buildParents(int n, int[][] edges) { method buildNext (line 63) | static int[][] buildNext(final int n, final int[][] edges) { FILE: 0835-image-overlap/0835-image-overlap.java class Solution (line 1) | class Solution { method convolute (line 3) | protected int convolute(int[][] A, int[][] kernel, int xShift, int ySh... method largestOverlap (line 11) | public int largestOverlap(int[][] A, int[][] B) { FILE: 0841-keys-and-rooms/0841-keys-and-rooms.java class Solution (line 1) | class Solution { method canVisitAllRooms (line 2) | public boolean canVisitAllRooms(List> rooms) { method dfs (line 9) | public int dfs(List> rooms, int currRoom, boolean[] visi... FILE: 0872-leaf-similar-trees/0872-leaf-similar-trees.java class Solution (line 16) | class Solution { method leafSimilar (line 17) | public boolean leafSimilar(TreeNode root1, TreeNode root2) { method getLeafValues (line 25) | List getLeafValues(TreeNode node, List values) { FILE: 0876-middle-of-the-linked-list/0876-middle-of-the-linked-list.java class Solution (line 1) | class Solution { method middleNode (line 2) | public ListNode middleNode(ListNode head) { FILE: 0886-possible-bipartition/0886-possible-bipartition.java class Solution (line 1) | class Solution { method possibleBipartition (line 2) | public boolean possibleBipartition(int n, int[][] dislikes) { FILE: 0899-orderly-queue/0899-orderly-queue.java class Solution (line 1) | class Solution { method orderlyQueue (line 2) | public String orderlyQueue(String s, int k) { FILE: 0901-online-stock-span/0901-online-stock-span.java class StockSpanner (line 1) | class StockSpanner { method next (line 4) | public int next(int price) { FILE: 0907-sum-of-subarray-minimums/0907-sum-of-subarray-minimums.java class Solution (line 2) | class Solution { method sumSubarrayMins (line 3) | public int sumSubarrayMins(int[] arr) { FILE: 0909-snakes-and-ladders/0909-snakes-and-ladders.java class Solution (line 1) | class Solution { method snakesAndLadders (line 2) | public int snakesAndLadders(int[][] board) { FILE: 0918-maximum-sum-circular-subarray/0918-maximum-sum-circular-subarray.java class Solution (line 1) | class Solution { method maxSubarraySumCircular (line 2) | public int maxSubarraySumCircular(int[] nums) { FILE: 0926-flip-string-to-monotone-increasing/0926-flip-string-to-monotone-increasing.java class Solution (line 1) | class Solution { method minFlipsMonoIncr (line 2) | public int minFlipsMonoIncr(String s) { FILE: 0938-range-sum-of-bst/0938-range-sum-of-bst.java class Solution (line 16) | class Solution { method rangeSumBST (line 17) | public int rangeSumBST(TreeNode root, int low, int high) { FILE: 0944-delete-columns-to-make-sorted/0944-delete-columns-to-make-sorted.java class Solution (line 1) | class Solution { method minDeletionSize (line 2) | public int minDeletionSize(String[] strs) { FILE: 0947-most-stones-removed-with-same-row-or-column/0947-most-stones-removed-with-same-row-or-column.java class Solution (line 1) | class Solution { method removeStones (line 2) | public int removeStones(int[][] stones) { class UnionFind (line 17) | class UnionFind { method UnionFind (line 21) | public UnionFind() { method find (line 26) | public int find(int x) { method union (line 39) | public void union(int x, int y) { FILE: 0974-subarray-sums-divisible-by-k/0974-subarray-sums-divisible-by-k.java class Solution (line 1) | class Solution { method subarraysDivByK (line 2) | public int subarraysDivByK(int[] nums, int k) { FILE: 0976-largest-perimeter-triangle/0976-largest-perimeter-triangle.java class Solution (line 1) | class Solution { method largestPerimeter (line 2) | public int largestPerimeter(int[] nums) { FILE: 0980-unique-paths-iii/0980-unique-paths-iii.java class Solution (line 1) | class Solution { method uniquePathsIII (line 2) | public int uniquePathsIII(int[][] grid) { method dfs (line 18) | public int dfs(int grid[][], int x, int y, int zero){ FILE: 0997-find-the-town-judge/0997-find-the-town-judge.java class Solution (line 1) | class Solution { method findJudge (line 2) | public int findJudge(int n, int[][] trust) { FILE: 1007-minimum-domino-rotations-for-equal-row/1007-minimum-domino-rotations-for-equal-row.java class Solution (line 1) | class Solution { method minDominoRotations (line 2) | public int minDominoRotations(int[] tops, int[] bottoms) { method helper (line 13) | private int helper(int target,int[] a,int[] b){ FILE: 102-binary-tree-level-order-traversal/102-binary-tree-level-order-traversal.java class Solution (line 16) | class Solution { method levelOrder (line 17) | public List> levelOrder(TreeNode root) { FILE: 102-binary-tree-level-order-traversal/102-binary-tree-level-order-traversal.py class Solution (line 7) | class Solution: method levelOrder (line 8) | def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]: FILE: 1020-number-of-enclaves/1020-number-of-enclaves.cpp class Solution (line 1) | class Solution { method bfs (line 3) | pair bfs(vector>& gr, vector>& vis,... method numEnclaves (line 36) | int numEnclaves(vector>& grid) { FILE: 1020. Number of Enclaves.java class Solution (line 1) | class Solution { method numEnclaves (line 2) | public int numEnclaves(int[][] grid) { method dfs (line 33) | public void dfs(int[][] a,int[][] vis,int i,int j){ FILE: 1026-maximum-difference-between-node-and-ancestor/1026-maximum-difference-between-node-and-ancestor.java class Solution (line 1) | class Solution { method maxAncestorDiff (line 3) | public int maxAncestorDiff(TreeNode root) { method dfs (line 10) | void dfs(TreeNode root, int max, int min){ FILE: 1029-two-city-scheduling/1029-two-city-scheduling.java class Solution (line 1) | class Solution { method twoCitySchedCost (line 2) | public int twoCitySchedCost(int[][] costs) { FILE: 1046-last-stone-weight/1046-last-stone-weight.java class Solution (line 1) | class Solution { method lastStoneWeight (line 2) | public int lastStoneWeight(int[] stones) { FILE: 1047-remove-all-adjacent-duplicates-in-string/1047-remove-all-adjacent-duplicates-in-string.java class Solution (line 1) | class Solution { method removeDuplicates (line 2) | public String removeDuplicates(String s) { FILE: 1048-longest-string-chain/1048-longest-string-chain.java class Solution (line 1) | class Solution { method longestStrChain (line 2) | public int longestStrChain(String[] words) { FILE: 105-construct-binary-tree-from-preorder-and-inorder-traversal/105-construct-binary-tree-from-preorder-and-inorder-traversal.java class Solution (line 1) | class Solution { method buildTree (line 4) | public TreeNode buildTree(int[] preorder, int[] inorder) { method arrayToTree (line 15) | private TreeNode arrayToTree(int[] preorder, int left, int right) { FILE: 1061-lexicographically-smallest-equivalent-string/1061-lexicographically-smallest-equivalent-string.java class Solution (line 1) | class Solution { method find (line 5) | int find(int x) { method performUnion (line 14) | void performUnion(int x, int y) { method smallestEquivalentString (line 30) | public String smallestEquivalentString(String s1, String s2, String ba... FILE: 1074-number-of-submatrices-that-sum-to-target/1074-number-of-submatrices-that-sum-to-target.java class Solution (line 1) | class Solution { method numSubmatrixSumTarget (line 2) | public int numSubmatrixSumTarget(int[][] matrix, int target) { FILE: 108-convert-sorted-array-to-binary-search-tree/108-convert-sorted-array-to-binary-search-tree.java class Solution (line 16) | class Solution { method sortedArrayToBST (line 17) | public TreeNode sortedArrayToBST(int[] nums) { method create (line 20) | TreeNode create(int[]nums,int i,int j){ FILE: 1081-smallest-subsequence-of-distinct-characters/1081-smallest-subsequence-of-distinct-characters.java class Solution (line 1) | class Solution { method smallestSubsequence (line 2) | public String smallestSubsequence(String s) { FILE: 1091-shortest-path-in-binary-matrix/1091-shortest-path-in-binary-matrix.java class Solution (line 1) | class Solution { method shortestPathBinaryMatrix (line 2) | public int shortestPathBinaryMatrix(int[][] grid) { method check (line 14) | public void check(int[][] grid,List pos){ FILE: 11-container-with-most-water/11-container-with-most-water.java class Solution (line 1) | class Solution { method maxArea (line 2) | public int maxArea(int[] height) { FILE: 11-container-with-most-water/Container_With_Most_Water.cpp class Solution (line 1) | class Solution { method maxArea (line 3) | int maxArea(vector& h) { FILE: 112-path-sum/112-path-sum.java class Solution (line 1) | class Solution{ method hasPathSum (line 2) | public boolean hasPathSum(TreeNode root, int targetSum) { FILE: 113 Path Sum II med s24.cpp class Solution (line 4) | class Solution { method dfs (line 7) | void dfs(TreeNode* node, vector& path, int remainingSum) { method pathSum (line 16) | vector> pathSum(TreeNode* root, int targetSum) { FILE: 113-Path-Sum-II.cpp class Solution (line 1) | class Solution { method dfs (line 4) | void dfs(vector&curr,TreeNode* root,int target) method pathSum (line 16) | vector> pathSum(TreeNode* root, int targetSum) FILE: 113-path-sum-ii/113-path-sum-ii.java class Solution (line 1) | class Solution { method check (line 2) | public void check(TreeNode root,int T,List curr,List> pathSum(TreeNode root, int targetSum) { FILE: 113-path-sum-ii/113. Path Sum II.cpp class Solution (line 1) | class Solution { method dfs (line 4) | void dfs(TreeNode* root, int targetSum, vector &t){ method pathSum (line 18) | vector> pathSum(TreeNode* root, int targetSum) { FILE: 114-flatten-binary-tree-to-linked-list/114-flatten-binary-tree-to-linked-list.java class Solution (line 16) | class Solution { method flatten (line 17) | public void flatten(TreeNode root) { FILE: 114-flatten-binary-tree-to-linked-list/SolutionCode.cpp class Solution (line 1) | class Solution method Node (line 4) | Node* helper(Node* root){ method flatten (line 24) | void flatten(Node *root) FILE: 1143-longest-common-subsequence/1143-longest-common-subsequence.java class Solution (line 1) | class Solution { method longestCommonSubsequence (line 2) | public int longestCommonSubsequence(String s1, String s2) { FILE: 1155-number-of-dice-rolls-with-target-sum/1155-number-of-dice-rolls-with-target-sum.java class Solution (line 1) | class Solution { method helper (line 3) | int helper(int n,int t,int k,int dp[][]){ method numRollsToTarget (line 13) | public int numRollsToTarget(int n, int k, int target) { FILE: 117-populating-next-right-pointers-in-each-node-ii/117-populating-next-right-pointers-in-each-node-ii.java class Solution (line 1) | class Solution { method connect (line 2) | public Node connect(Node root) { FILE: 118-pascals-triangle/118-pascals-triangle.java class Solution (line 1) | class Solution { method generate (line 2) | public List> generate(int numRows) { FILE: 1192-critical-connections-in-a-network/1192-critical-connections-in-a-network.java class Solution (line 1) | class Solution { method criticalConnections (line 6) | public List> criticalConnections(int n, List> list) { FILE: 1207-unique-number-of-occurrences/1207-unique-number-of-occurrences.java class Solution (line 1) | class Solution { method uniqueOccurrences (line 2) | public boolean uniqueOccurrences(int[] arr) { FILE: 1209-remove-all-adjacent-duplicates-in-string-ii/1209-remove-all-adjacent-duplicates-in-string-ii.java class Solution (line 1) | class Solution { method removeDuplicates (line 2) | public String removeDuplicates(String s, int k) { FILE: 1220-count-vowels-permutation/1220-count-vowels-permutation.java class Solution (line 1) | class Solution { method countVowelPermutation (line 2) | public int countVowelPermutation(int n) { FILE: 1235-maximum-profit-in-job-scheduling/1235-maximum-profit-in-job-scheduling.java class Solution (line 1) | class Solution { class Job (line 2) | class Job implements Comparable{ method Job (line 6) | Job(int start, int end, int profit) { method compareTo (line 11) | public int compareTo(Job otherJob) { method jobScheduling (line 15) | public int jobScheduling(int[] startTime, int[] endTime, int[] profit) { FILE: 1239-maximum-length-of-a-concatenated-string-with-unique-characters/1239-maximum-length-of-a-concatenated-string-with-unique-characters.java class Solution (line 1) | class Solution { method solve (line 2) | public int solve(String strs[], int no, int a[], int index, int c) { method maxLength (line 11) | public int maxLength(List arr) { FILE: 126-word-ladder-ii/126-word-ladder-ii.java class Solution (line 1) | class Solution { method findLadders (line 2) | public List> findLadders(String beginWord, String endWord... method minTrans (line 18) | private void minTrans() { method makeTrans (line 57) | private void makeTrans(Map> paths, int maxLen) { method makeTransInternal (line 68) | void makeTransInternal(String start, int depth, String[] path) { method sanityCheck (line 84) | private boolean sanityCheck(List wordList) { method prepare (line 93) | private void prepare(List wordList) { method getPatterns (line 113) | private String[] getPatterns(String word) { FILE: 1260-shift-2d-grid/1260-shift-2d-grid.java class Solution (line 1) | class Solution { method shiftGrid (line 2) | public List> shiftGrid(int[][] grid, int k) { FILE: 1268-search-suggestions-system/1268-search-suggestions-system.java class Solution (line 1) | class Solution { method suggestedProducts (line 2) | public List> suggestedProducts(String[] products, String ... FILE: 128-longest-consecutive-sequence/128-longest-consecutive-sequence.java class Solution (line 1) | class Solution { method longestConsecutive (line 2) | public int longestConsecutive(int[] nums) { FILE: 1293-shortest-path-in-a-grid-with-obstacles-elimination/1293-shortest-path-in-a-grid-with-obstacles-elimination.java class Solution (line 1) | class Solution { class Node (line 2) | class Node { method Node (line 7) | Node(int row, int col, int obstacles){ method shortestPath (line 16) | public int shortestPath(int[][] grid, int k) { FILE: 13-roman-to-integer/13-roman-to-integer.cpp class Solution (line 1) | class Solution { method romanToInt (line 3) | int romanToInt(string s) { FILE: 13-roman-to-integer/13-roman-to-integer.java class Solution (line 1) | public class Solution { method romanToInt (line 2) | public int romanToInt(String A) { method getValue (line 21) | int getValue(char ch){ FILE: 1302-deepest-leaves-sum/1302-deepest-leaves-sum.java class Solution (line 1) | class Solution { method deepestLeavesSum (line 5) | public int deepestLeavesSum(TreeNode root) { method deepestLeavesSum (line 10) | public void deepestLeavesSum(TreeNode root,int level) { FILE: 1323-maximum-69-number/1323-maximum-69-number.java class Solution (line 1) | class Solution { method maximum69Number (line 2) | public int maximum69Number (int num) { FILE: 1328-break-a-palindrome/1328-break-a-palindrome.java class Solution (line 1) | class Solution { method breakPalindrome (line 2) | public String breakPalindrome(String palindrome) { FILE: 1329-sort-the-matrix-diagonally/1329-sort-the-matrix-diagonally.cpp class Solution (line 1) | class Solution { method diagonalSort (line 3) | vector> diagonalSort(vector>& mat) { FILE: 1329-sort-the-matrix-diagonally/1329-sort-the-matrix-diagonally.java class Solution (line 1) | class Solution { method diagonalSort (line 2) | public int[][] diagonalSort(int[][] mat) { method sort (line 14) | public static void sort(int[][] mat,int row,int col,int m,int n){ FILE: 1329-sort-the-matrix-diagonally/SolutionCode.cpp class Solution (line 1) | class Solution { method sortIt (line 3) | void sortIt(int r,int c,int m,int n,vector> &v){ method diagonalSort (line 19) | vector> diagonalSort(vector>& mat) { FILE: 1332-remove-palindromic-subsequences/1332-remove-palindromic-subsequences.java class Solution (line 1) | class Solution { method removePalindromeSub (line 2) | public int removePalindromeSub(String s) { method isPal (line 8) | public boolean isPal(String s){ FILE: 1335-minimum-difficulty-of-a-job-schedule/1335-minimum-difficulty-of-a-job-schedule.java class Solution (line 1) | class Solution { method Helper (line 6) | public int Helper(int idx, int[] arr, int d){ method minDifficulty (line 25) | public int minDifficulty(int[] jobDifficulty, int d) { FILE: 1337-the-k-weakest-rows-in-a-matrix/1337-the-k-weakest-rows-in-a-matrix.java class Solution (line 1) | class Solution { method kWeakestRows (line 2) | public int[] kWeakestRows(int[][] mat, int k) { method count (line 14) | public int count(int[][]mat,int i){ FILE: 1338-reduce-array-size-to-the-half/1338-reduce-array-size-to-the-half.cpp function minSetSize (line 1) | int minSetSize(vector& arr) { FILE: 1338-reduce-array-size-to-the-half/1338-reduce-array-size-to-the-half.java class Pair (line 1) | class Pair{ method Pair (line 4) | Pair(int i,int j){ class Solution (line 9) | class Solution { method minSetSize (line 10) | public int minSetSize(int[] arr) { FILE: 1339-maximum-product-of-splitted-binary-tree/1339-maximum-product-of-splitted-binary-tree.java class Solution (line 1) | class Solution { method maxProduct (line 5) | public int maxProduct(TreeNode root) { method dfs (line 11) | private int dfs(TreeNode root) method traverse (line 18) | private void traverse(TreeNode root) FILE: 1342-number-of-steps-to-reduce-a-number-to-zero/1342-number-of-steps-to-reduce-a-number-to-zero.java class Solution (line 1) | class Solution { method numberOfSteps (line 2) | public int numberOfSteps(int num) { FILE: 135-candy/135-candy.java class Solution (line 1) | public class Solution { method candy (line 2) | public int candy(int[] ratings) { FILE: 1354-construct-target-array-with-multiple-sums/1354-construct-target-array-with-multiple-sums.java class Solution (line 1) | class Solution { method isPossible (line 2) | public boolean isPossible(int[] target) { FILE: 1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.java class Solution (line 11) | class Solution { method getTargetCopy (line 14) | public final TreeNode getTargetCopy(final TreeNode original, final Tre... method dfs (line 19) | public void dfs(TreeNode a,TreeNode b){ FILE: 1381. Design a Stack With Increment Operation/1381-Design-a-Stack-With-Increment-Operation.cpp class CustomStack (line 1) | class CustomStack { method CustomStack (line 69) | CustomStack(int maxSize) { method push (line 73) | void push(int x) { method pop (line 80) | int pop() { method increment (line 92) | void increment(int k, int val) { FILE: 1383 Maximum Performance of a Team lc hard.cpp class Solution (line 4) | class Solution { method maxPerformance (line 9) | int maxPerformance(int n, vector& speed, vector& efficiency,... FILE: 1383-maximum-performance-of-a-team/1383-maximum-performance-of-a-team.java class Solution (line 1) | class Solution { method maxPerformance (line 2) | public int maxPerformance(int n, int[] speed, int[] efficiency, int k) { FILE: 1396-design-underground-system/1396-design-underground-system.java class UndergroundSystem (line 1) | class UndergroundSystem { class Pair (line 2) | class Pair{ method Pair (line 5) | Pair(String p,int t){ method UndergroundSystem (line 12) | public UndergroundSystem() { method checkIn (line 17) | public void checkIn(int id, String p, int t) { method checkOut (line 21) | public void checkOut(int id, String stationName, int t) { method getAverageTime (line 38) | public double getAverageTime(String start, String end) { FILE: 14. Longest Common Prefix.py function longestCommonPrefix (line 1) | def longestCommonPrefix(self, strs: List[str]) -> str: FILE: 1423-maximum-points-you-can-obtain-from-cards/1423-maximum-points-you-can-obtain-from-cards.java class Solution (line 1) | class Solution { method maxScore (line 2) | public int maxScore(int[] cardPoints, int k) { FILE: 143-Reorder List.java class Solution (line 3) | class Solution { method reorderList (line 4) | public void reorderList(ListNode head) { FILE: 1443-minimum-time-to-collect-all-apples-in-a-tree/1443-minimum-time-to-collect-all-apples-in-a-tree.java class Solution (line 1) | class Solution { method dfs (line 2) | public int dfs(int node, int parent, Map> adj, method minTime (line 21) | public int minTime(int n, int[][] edges, List hasApple) { FILE: 1448-count-good-nodes-in-binary-tree/1448-count-good-nodes-in-binary-tree.java class Solution (line 16) | class Solution { method goodNodes (line 19) | public int goodNodes(TreeNode root) { method helper (line 33) | public void helper(TreeNode root,int curr){ FILE: 1457 Pseudo-Palindromic Paths in a Binary Tree lc.cpp class Solution (line 1) | class Solution { method checkPalin (line 5) | bool checkPalin(){ method solve (line 15) | void solve(TreeNode *root){ method pseudoPalindromicPaths (line 29) | int pseudoPalindromicPaths (TreeNode* root) { FILE: 1457-pseudo-palindromic-paths-in-a-binary-tree/1457-pseudo-palindromic-paths-in-a-binary-tree.java class Solution (line 16) | class Solution { method pseudoPalindromicPaths (line 18) | public int pseudoPalindromicPaths (TreeNode root) { method dfs (line 24) | void dfs(TreeNode root,int[]freq){ FILE: 1461-check-if-a-string-contains-all-binary-codes-of-size-k/1461-check-if-a-string-contains-all-binary-codes-of-size-k.java class Solution (line 1) | class Solution { method hasAllCodes (line 2) | public static boolean hasAllCodes(String s, int k) { FILE: 1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.java class Solution (line 1) | class Solution { method maxArea (line 2) | public int maxArea(int h, int w, int[] hc, int[] vc) { method getMax (line 5) | public long getMax(int len,int[] cuts){ FILE: 1473-paint-house-iii/1473-paint-house-iii.java class Solution (line 1) | class Solution { method minCost (line 5) | public int minCost(int[] houses, int[][] cost, int m, int n, int targe... method min (line 89) | private int min(int[][] minCost, int j, int remaining) { FILE: 1480-running-sum-of-1d-array/1480-running-sum-of-1d-array.java class Solution (line 1) | class Solution { method runningSum (line 2) | public int[] runningSum(int[] nums) { FILE: 15. 3Sum/SolutionCode.cpp class Solution (line 1) | class Solution { method threeSum (line 3) | vector> threeSum(vector& nums) { method threeSum (line 45) | vector> threeSum(vector& nums) { class Solution (line 43) | class Solution { method threeSum (line 3) | vector> threeSum(vector& nums) { method threeSum (line 45) | vector> threeSum(vector& nums) { FILE: 151. Reverse Words in a String.java class Solution (line 2) | class Solution { method reverseWords (line 3) | public String reverseWords(String s) { FILE: 1519-number-of-nodes-in-the-sub-tree-with-the-same-label/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.java class Solution (line 1) | class Solution { method dfs (line 2) | public int[] dfs(int node, int parent, Map> adj, method countSubTrees (line 25) | public int[] countSubTrees(int n, int[][] edges, String labels) { FILE: 1531-string-compression-ii/1531-string-compression-ii.java class Solution (line 10) | class Solution { method getLengthOfOptimalCompression (line 11) | public int getLengthOfOptimalCompression(String s, int k) { method length (line 69) | private int length(int count) { FILE: 1544-make-the-string-great/1544-make-the-string-great.java class Solution (line 1) | class Solution { method makeGood (line 2) | public String makeGood(String s) { FILE: 1578-minimum-time-to-make-rope-colorful/1578-minimum-time-to-make-rope-colorful.java class Solution (line 1) | class Solution { method minCost (line 2) | public int minCost(String colors, int[] neededTime) { FILE: 1584-min-cost-to-connect-all-points/1584-min-cost-to-connect-all-points.java class Solution (line 1) | class Solution { method minCostConnectPoints (line 2) | public int minCostConnectPoints(int[][] points) { FILE: 16-3sum-closest/16-3sum-closest.java class Solution (line 1) | class Solution { method threeSumClosest (line 2) | public int threeSumClosest(int[] nums, int target) { FILE: 16. 3Sum Closest - leetcode/SolutionCode.cpp class Solution (line 1) | class Solution { method threeSumClosest (line 3) | int threeSumClosest(vector& nums, int target) { FILE: 160-intersection-of-two-linked-lists/160-intersection-of-two-linked-lists.java class Solution (line 1) | public class Solution { method getIntersectionNode (line 2) | public ListNode getIntersectionNode(ListNode headA, ListNode headB) { FILE: 1631-path-with-minimum-effort/1631-path-with-minimum-effort.java class Solution (line 1) | class Solution { method minimumEffortPath (line 2) | public int minimumEffortPath(int[][] heights) { FILE: 1641-count-sorted-vowel-strings/1641-count-sorted-vowel-strings.java class Solution (line 1) | class Solution { method countVowelStrings (line 2) | public int countVowelStrings(int n) { method sum (line 14) | private int sum(int[] arr) { FILE: 1642-furthest-building-you-can-reach/1642-furthest-building-you-can-reach.java class Solution (line 1) | class Solution { method furthestBuilding (line 2) | public int furthestBuilding(int[] h, int bricks, int l) { FILE: 1647-minimum-deletions-to-make-character-frequencies-unique/1647-minimum-deletions-to-make-character-frequencies-unique.java class Solution (line 1) | class Solution { method minDeletions (line 2) | public int minDeletions(String s) { FILE: 1657-determine-if-two-strings-are-close/1657-determine-if-two-strings-are-close.java class Solution (line 1) | class Solution { method closeStrings (line 2) | public boolean closeStrings(String s1, String s2) { FILE: 1658-minimum-operations-to-reduce-x-to-zero/1658-minimum-operations-to-reduce-x-to-zero.java class Solution (line 1) | class Solution { method minOperations (line 2) | public int minOperations(int[] nums, int x) { FILE: 1662-check-if-two-string-arrays-are-equivalent/1662-check-if-two-string-arrays-are-equivalent.java class Solution (line 1) | class Solution { method arrayStringsAreEqual (line 2) | public boolean arrayStringsAreEqual(String[] word1, String[] word2) { FILE: 1663-smallest-string-with-a-given-numeric-value/1663-smallest-string-with-a-given-numeric-value.java class Solution (line 1) | class Solution { method getSmallestString (line 2) | public String getSmallestString(int n, int k) { FILE: 167-two-sum-ii-input-array-is-sorted/167-two-sum-ii-input-array-is-sorted.java class Solution (line 1) | class Solution { method twoSum (line 2) | public int[] twoSum(int[] numbers, int target) { FILE: 1679-max-number-of-k-sum-pairs/1679-max-number-of-k-sum-pairs.java class Solution (line 1) | class Solution { method maxOperations (line 2) | public int maxOperations(int[] nums, int k) { FILE: 1680 Concatenation of Consecutive Binary Numbers med s23.cpp class Solution (line 4) | class Solution { method concatenatedBinary (line 7) | int concatenatedBinary(int n) { FILE: 1680-concatenation-of-consecutive-binary-numbers/1680-concatenation-of-consecutive-binary-numbers.java class Solution (line 1) | class Solution { method build (line 6) | public void build() { method getVal (line 14) | public int getVal(int n) { method concatenatedBinary (line 26) | public int concatenatedBinary(int n) { FILE: 1689-partitioning-into-minimum-number-of-deci-binary-numbers/1689-partitioning-into-minimum-number-of-deci-binary-numbers.java class Solution (line 1) | class Solution { method minPartitions (line 2) | public int minPartitions(String n) { FILE: 1695-maximum-erasure-value/1695-maximum-erasure-value.java class Solution (line 1) | class Solution { method maximumUniqueSubarray (line 2) | public int maximumUniqueSubarray(int[] arr) { FILE: 1696-jump-game-vi/1696-jump-game-vi.java class Solution (line 1) | class Solution { method maxResult (line 2) | public int maxResult(int[] nums, int k) { FILE: 17-letter-combinations-of-a-phone-number/17-letter-combinations-of-a-phone-number.java class Solution (line 1) | class Solution { method letterCombinations (line 3) | public List letterCombinations(String digits) { method dfs (line 12) | public void dfs(String digits, int index, StringBuilder sb, List& nums, vector& mult, vector>& dp,... method maximumScore (line 19) | int maximumScore(vector& nums, vector& multipliers) { FILE: 1770-maximum-score-from-performing-multiplication-operations/1770-maximum-score-from-performing-multiplication-operations.java class Solution (line 1) | class Solution { method maximumScore (line 2) | public int maximumScore(int[] nums, int[] multipliers) { FILE: 179-Largest Number.java class Solution (line 7) | class Solution { method largestNumber (line 8) | public String largestNumber(int[] nums) { FILE: 1791. Find Center of Star Graph.java class Solution (line 1) | class Solution { method findCenter (line 2) | public int findCenter(int[][] edges) { FILE: 1832-check-if-the-sentence-is-pangram/1832-check-if-the-sentence-is-pangram.java class Solution (line 1) | class Solution { method checkIfPangram (line 2) | public boolean checkIfPangram(String sentence) { FILE: 1833-maximum-ice-cream-bars/1833-maximum-ice-cream-bars.java class Solution (line 1) | class Solution { method maxIceCream (line 2) | public int maxIceCream(int[] costs, int coins) { FILE: 1834-single-threaded-cpu/1834-single-threaded-cpu.java class Solution (line 1) | class Solution { method getOrder (line 2) | public int[] getOrder(int[][] tasks) { FILE: 188-best-time-to-buy-and-sell-stock-iv/188-best-time-to-buy-and-sell-stock-iv.java class Solution (line 1) | class Solution { method maxProfit (line 4) | public int maxProfit(int k, int[] prices) { method DP (line 8) | private int DP(int[] prices, int k) { FILE: 188. Best Time to Buy and Sell Stock IV.cpp class Solution (line 1) | class Solution { method maxProfit (line 3) | int maxProfit(int k, vector& prices) { FILE: 19-remove-nth-node-from-end-of-list/19-remove-nth-node-from-end-of-list.java class Solution (line 11) | class Solution { method removeNthFromEnd (line 12) | public ListNode removeNthFromEnd(ListNode head, int n) { FILE: 191-number-of-1-bits/191-number-of-1-bits.java class Solution (line 1) | public class Solution { method hammingWeight (line 2) | public int hammingWeight(int n) { FILE: 1926-nearest-exit-from-entrance-in-maze/1926-nearest-exit-from-entrance-in-maze.java class Solution (line 1) | class Solution { method nearestExit (line 2) | public int nearestExit(char[][] maze, int[] entrance) { FILE: 1962-remove-stones-to-minimize-the-total/1962-remove-stones-to-minimize-the-total.java class Solution (line 1) | public class Solution { method minStoneSum (line 2) | public int minStoneSum(int[] piles, int k) { FILE: 1971-find-if-path-exists-in-graph/1971-find-if-path-exists-in-graph.java class Solution (line 1) | class Solution { method validPath (line 2) | public boolean validPath(int n, int[][] edges, int start, int end) { FILE: 199-binary-tree-right-side-view/199-binary-tree-right-side-view.java class Solution (line 16) | class Solution { method rightSideView (line 17) | public List rightSideView(TreeNode root) { method rightView (line 23) | void rightView(TreeNode root,List list,int level){ FILE: 1991-find-the-middle-index-in-array/1991-find-the-middle-index-in-array.java class Solution (line 1) | class Solution { method findMiddleIndex (line 2) | public int findMiddleIndex(int[] nums) { FILE: 1996-the-number-of-weak-characters-in-the-game/1996-the-number-of-weak-characters-in-the-game.cpp class Solution (line 4) | class Solution{ method numberOfWeakCharacters (line 13) | int numberOfWeakCharacters(vector>& properties){ FILE: 1996-the-number-of-weak-characters-in-the-game/1996-the-number-of-weak-characters-in-the-game.java class Solution (line 1) | class Solution { method numberOfWeakCharacters (line 2) | public int numberOfWeakCharacters(int[][] prop) { method numberOfWeakCharacters (line 39) | public int numberOfWeakCharacters(int[][] properties) { class Solution (line 38) | class Solution { method numberOfWeakCharacters (line 2) | public int numberOfWeakCharacters(int[][] prop) { method numberOfWeakCharacters (line 39) | public int numberOfWeakCharacters(int[][] properties) { FILE: 200-number-of-islands/200-number-of-islands.java class Solution (line 1) | class Solution { method numIslands (line 2) | public int numIslands(char[][] grid) { method dfs (line 16) | public void dfs(char[][]grid,int i,int j){ FILE: 2007 Find Original Array From Doubled Array lc.cpp class Solution (line 1) | class Solution { method findOriginalArray (line 3) | vector findOriginalArray(vector& changed) { FILE: 2007-find-original-array-from-doubled-array/2007-find-original-array-from-doubled-array.java class Solution (line 15) | class Solution { method findOriginalArray (line 16) | public int[] findOriginalArray(int[] c) { method findOriginalArray (line 45) | public int[] findOriginalArray(int[] changed) { method findOriginalArray (line 68) | public int[] findOriginalArray(int[] changed) { class Solution (line 44) | class Solution { method findOriginalArray (line 16) | public int[] findOriginalArray(int[] c) { method findOriginalArray (line 45) | public int[] findOriginalArray(int[] changed) { method findOriginalArray (line 68) | public int[] findOriginalArray(int[] changed) { class Solution (line 67) | class Solution { method findOriginalArray (line 16) | public int[] findOriginalArray(int[] c) { method findOriginalArray (line 45) | public int[] findOriginalArray(int[] changed) { method findOriginalArray (line 68) | public int[] findOriginalArray(int[] changed) { FILE: 2095-delete-the-middle-node-of-a-linked-list/2095-delete-the-middle-node-of-a-linked-list.java class Solution (line 11) | class Solution { method deleteMiddle (line 12) | public ListNode deleteMiddle(ListNode head) { FILE: 2131-longest-palindrome-by-concatenating-two-letter-words/2131-longest-palindrome-by-concatenating-two-letter-words.java class Solution (line 1) | class Solution { method longestPalindrome (line 2) | public int longestPalindrome(String[] words) { FILE: 2136-earliest-possible-day-of-full-bloom/2136-earliest-possible-day-of-full-bloom.java class Solution (line 1) | class Solution { class Pair (line 2) | class Pair{ method Pair (line 5) | Pair(int a,int b){ method earliestFullBloom (line 10) | public int earliestFullBloom(int[] plantTime, int[] growTime) { FILE: 215-kth-largest-element-in-an-array/215-kth-largest-element-in-an-array.java class Solution (line 1) | class Solution { method findKthLargest (line 2) | public int findKthLargest(int[] nums, int k) { FILE: 216-combination-sum-iii/216-combination-sum-iii.java class Solution (line 1) | class Solution { method combinationSum3 (line 2) | public List> combinationSum3(int k, int n) { method back (line 8) | void back(List> res,List out,int currSize,int n... FILE: 218-the-skyline-problem/218-the-skyline-problem.java class Solution (line 1) | class Solution { class KeyPoint (line 2) | class KeyPoint { method KeyPoint (line 7) | public KeyPoint(int key, int height) { method getSkyline (line 13) | public List> getSkyline(int[][] buildings) { FILE: 2225-find-players-with-zero-or-one-losses/2225-find-players-with-zero-or-one-losses.java class Solution (line 1) | class Solution { method findWinners (line 2) | public List> findWinners(int[][] matches) { FILE: 2244-minimum-rounds-to-complete-all-tasks/2244-minimum-rounds-to-complete-all-tasks.java class Solution (line 1) | class Solution { method minimumRounds (line 2) | public int minimumRounds(int[] tasks) { FILE: 2246-longest-path-with-different-adjacent-characters/2246-longest-path-with-different-adjacent-characters.java class Solution (line 1) | class Solution { method dfs (line 4) | public int dfs(int currentNode, Map> children, ... method longestPath (line 36) | public int longestPath(int[] parent, String s) { FILE: 225-implement-stack-using-queues/225-implement-stack-using-queues.java class MyStack (line 1) | class MyStack { method MyStack (line 4) | public MyStack() { method push (line 10) | public void push(int x) { method pop (line 18) | public int pop() { method top (line 36) | public int top() { method empty (line 56) | public boolean empty() { FILE: 2256-minimum-average-difference/2256-minimum-average-difference.java class Solution (line 1) | class Solution { method minimumAverageDifference (line 2) | public int minimumAverageDifference(int[] nums) { FILE: 2279-maximum-bags-with-full-capacity-of-rocks/2279-maximum-bags-with-full-capacity-of-rocks.java class Solution (line 1) | class Solution { method maximumBags (line 2) | public int maximumBags(int[] capacity, int[] rocks, int x) { FILE: 23-Merge-k-Sorted-Lists/23-Merge-k-Sorted-Lists.cpp class Solution (line 1) | class Solution { method ListNode (line 3) | ListNode* mergeKLists(vector& lists) { FILE: 230-kth-smallest-element-in-a-bst/230-kth-smallest-element-in-a-bst.java class Solution (line 16) | class Solution { method kthSmallest (line 19) | public int kthSmallest(TreeNode root, int k) { method dfs (line 23) | public void dfs(TreeNode root,int k){ FILE: 234-palindrome-linked-list/234-palindrome-linked-list.java class Solution (line 11) | class Solution { method isPalindrome (line 12) | public boolean isPalindrome(ListNode head) { FILE: 234-palindrome-linked-list/234-palindrome-linked-list.py class Solution (line 6) | class Solution: method isPalindrome (line 7) | def isPalindrome(self, head: Optional[ListNode]) -> bool: FILE: 234-palindrome-linked-list/palindrome-linked-list.cpp class Solution (line 1) | class Solution { method isPalindrome (line 3) | bool isPalindrome(ListNode* head) { FILE: 234. Palindrome Linked List/SolutionCode.cpp class Solution (line 8) | class Solution { method ListNode (line 10) | ListNode* reverseNode(ListNode* head){ method isPalindrome (line 23) | bool isPalindrome(ListNode* head) { FILE: 235-lowest-common-ancestor-of-a-binary-search-tree/235-lowest-common-ancestor-of-a-binary-search-tree.java class Solution (line 1) | class Solution { method lowestCommonAncestor (line 2) | public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNo... FILE: 235-lowest-common-ancestor-of-a-binary-search-tree/235-lowest-common-ancestor-of-a-binary-search-tree.py class Solution (line 8) | class Solution: method lowestCommonAncestor (line 9) | def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'Tr... FILE: 236-lowest-common-ancestor-of-a-binary-tree/236-lowest-common-ancestor-of-a-binary-tree.java class Solution (line 1) | class Solution { method lowestCommonAncestor (line 2) | public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNo... FILE: 237-delete-node-in-a-linked-list/237-delete-node-in-a-linked-list.java class Solution (line 9) | class Solution { method deleteNode (line 10) | public void deleteNode(ListNode node) { FILE: 2389-longest-subsequence-with-limited-sum/2389-longest-subsequence-with-limited-sum.java class Solution (line 1) | class Solution { method answerQueries (line 2) | public int[] answerQueries(int[] nums, int[] queries) { FILE: 2389_longest_subsequence_with_limited_sum.cpp class Solution (line 1) | class Solution { method answerQueries (line 3) | vector answerQueries(vector& n, vector& q) { FILE: 2390_removing_stars_from_a_string.cpp class Solution (line 1) | class Solution { method string (line 3) | string removeStars(string s) { FILE: 2395_Find_Subarrays_With_Equal_Sum.cpp class Solution (line 1) | class Solution { method findSubarrays (line 3) | bool findSubarrays(vector& nums) { FILE: 240-search-a-2d-matrix-ii/240-search-a-2d-matrix-ii.java class Solution (line 1) | class Solution { method searchMatrix (line 2) | public boolean searchMatrix(int[][] matrix, int target) { FILE: 242-valid-anagram/242-valid-anagram.java class Solution (line 1) | class Solution { method isAnagram (line 2) | public boolean isAnagram(String s, String t) { FILE: 2421-number-of-good-paths/2421-number-of-good-paths.java class UnionFind (line 1) | class UnionFind { method UnionFind (line 5) | public UnionFind(int size) { method find (line 12) | public int find(int x) { method union_set (line 18) | public void union_set(int x, int y) { class Solution (line 33) | class Solution { method numberOfGoodPaths (line 34) | public int numberOfGoodPaths(int[] vals, int[][] edges) { FILE: 2429-minimize-xor/2429-minimize-xor.cpp class Solution (line 1) | class Solution method minimizeXor (line 4) | int minimizeXor(int num1, int num2) FILE: 2453-destroy-sequential-targets/2453-destroy-sequential-targets.java class Solution (line 1) | class Solution { method destroyTargets (line 2) | public int destroyTargets(int[] nums, int space) { FILE: 268-missing-number/268-missing-number.java class Solution (line 1) | class Solution { method missingNumber (line 2) | public int missingNumber(int[] nums) { FILE: 284-peeking-iterator/284-peeking-iterator.java class PeekingIterator (line 4) | class PeekingIterator implements Iterator { method PeekingIterator (line 7) | public PeekingIterator(Iterator iterator) { method peek (line 17) | public Integer peek() { method next (line 23) | @Override method hasNext (line 30) | @Override FILE: 287-find-the-duplicate-number/287-find-the-duplicate-number.java class Solution (line 1) | class Solution { method findDuplicate (line 2) | public int findDuplicate(int[] nums) { FILE: 289-game-of-life/289-game-of-life.java class Solution (line 1) | class Solution { method gameOfLife (line 2) | public void gameOfLife(int[][] board) { method getNebs (line 27) | public int getNebs(int[][]mat,int i,int j){ FILE: 29-divide-two-integers/29-divide-two-integers.java class Solution (line 1) | class Solution { method divide (line 2) | public int divide(int dividend, int divisor) { method count (line 25) | private int count(int a, int b) { FILE: 3-longest-substring-without-repeating-characters/3-longest-substring-without-repeating-characters.java class Solution (line 1) | class Solution { method lengthOfLongestSubstring (line 2) | public int lengthOfLongestSubstring(String s) { FILE: 30-substring-with-concatenation-of-all-words/30-substring-with-concatenation-of-all-words.java class Solution (line 1) | class Solution { method findSubstring (line 2) | public List findSubstring(String str, String[] words) { FILE: 30-substring-with-concatenation-of-all-words/30-substring-with-concatenation-of-all-words.py class Solution (line 1) | class Solution: method findSubstring (line 2) | def findSubstring(self, s: str, words: List[str]) -> List[int]: FILE: 300-longest-increasing-subsequence/300-longest-increasing-subsequence.java class Solution (line 1) | class Solution { method lengthOfLIS (line 2) | public int lengthOfLIS(int[] nums) { FILE: 304-range-sum-query-2d-immutable/304-range-sum-query-2d-immutable.java class NumMatrix (line 1) | class NumMatrix { method NumMatrix (line 4) | public NumMatrix(int[][] matrix) { method sumRegion (line 20) | public int sumRegion(int row1, int col1, int row2, int col2) { FILE: 307-range-sum-query-mutable/307-range-sum-query-mutable.java class NumArray (line 1) | class NumArray { class SegmentTreeNode (line 2) | class SegmentTreeNode { method SegmentTreeNode (line 7) | public SegmentTreeNode(int start, int end) { method NumArray (line 18) | public NumArray(int[] nums) { method buildTree (line 22) | private SegmentTreeNode buildTree(int[] nums, int start, int end) { method update (line 39) | void update(int i, int val) { method update (line 43) | void update(SegmentTreeNode root, int pos, int val) { method sumRange (line 57) | public int sumRange(int i, int j) { method sumRange (line 61) | public int sumRange(SegmentTreeNode root, int start, int end) { FILE: 31-next-permutation/31-next-permutation.java class Solution (line 1) | class Solution { method nextPermutation (line 2) | public void nextPermutation(int[] a) { method reverse (line 25) | public void reverse(int[]a,int i,int j){ FILE: 31-next-permutation/nextPurmutation.cpp class Solution (line 18) | class Solution { method findIfMidExists (line 20) | int findIfMidExists(vector& nums, int t){ method nextPermutation (line 29) | void nextPermutation(vector& nums) { FILE: 315-count-of-smaller-numbers-after-self/315-count-of-smaller-numbers-after-self.java class Solution (line 1) | class Solution { method countSmaller (line 2) | public List countSmaller(int[] nums) { method dfs (line 17) | int dfs(List arr,int ele){ FILE: 316-remove-duplicate-letters/316-remove-duplicate-letters.java class Solution (line 1) | class Solution { method removeDuplicateLetters (line 2) | public String removeDuplicateLetters(String s) { FILE: 318-maximum-product-of-word-lengths/318-maximum-product-of-word-lengths.java class Solution (line 1) | class Solution { method maxProduct (line 2) | public int maxProduct(String[] words) { FILE: 32-longest-valid-parentheses/32-longest-valid-parentheses.java class Solution (line 1) | public class Solution { method longestValidParentheses (line 2) | public int longestValidParentheses(String s) { FILE: 322-coin-change/322-coin-change.java class Solution (line 1) | class Solution { method coinChange (line 2) | public int coinChange(int[] coins, int amount) { FILE: 326-power-of-three/326-power-of-three.java class Solution (line 1) | public class Solution { method isPowerOfThree (line 2) | public boolean isPowerOfThree(int n) { FILE: 326-power-of-three/326_Power_of_three.cpp class Solution (line 1) | class Solution { method isPowerOfThree (line 3) | bool isPowerOfThree(int n) { FILE: 329-longest-increasing-path-in-a-matrix/329-longest-increasing-path-in-a-matrix.java class Solution (line 1) | class Solution { method longestIncreasingPath (line 4) | public int longestIncreasingPath(int[][] matrix) { method dfs (line 16) | private int dfs(int x, int y) { FILE: 33-search-in-rotated-sorted-array/33-search-in-rotated-sorted-array.java class Solution (line 1) | class Solution { method search (line 2) | public int search(int[] nums, int target) { FILE: 336-palindrome-pairs/336-palindrome-pairs.java class Solution (line 1) | class Solution { method palindromePairs (line 2) | public List> palindromePairs(String[] words) { method isPal (line 32) | boolean isPal(String s){ FILE: 34-find-first-and-last-position-of-element-in-sorted-array/34-find-first-and-last-position-of-element-in-sorted-array.java class Solution (line 1) | class Solution { method searchRange (line 2) | public int[] searchRange(int[] nums, int target) { method dfs (line 13) | void dfs(int[]nums,int target,int[]ans,int l,int h){ FILE: 341-flatten-nested-list-iterator/341-flatten-nested-list-iterator.java class NestedIterator (line 1) | public class NestedIterator implements Iterator { method NestedIterator (line 6) | public NestedIterator(List nestedList) { method worker (line 11) | void worker(List node) { method next (line 24) | @Override method hasNext (line 31) | @Override FILE: 342-power-of-four/342-power-of-four.java class Solution (line 1) | class Solution { method isPowerOfFour (line 2) | public boolean isPowerOfFour(int n) { FILE: 342-power-of-four/power of four.cpp function isPowerOfFour (line 1) | bool isPowerOfFour(int n) { FILE: 344-reverse-string/344-reverse-string.java class Solution (line 1) | class Solution { method reverseString (line 2) | public void reverseString(char[] s) { FILE: 347-top-k-frequent-elements/347-top-k-frequent-elements.cpp class Solution (line 1) | class Solution { method topKFrequent (line 3) | vector topKFrequent(vector& nums, int k) { FILE: 347-top-k-frequent-elements/347-top-k-frequent-elements.java class Solution (line 1) | class Solution { method topKFrequent (line 2) | public int[] topKFrequent(int[] nums, int k) { FILE: 354-russian-doll-envelopes/354-russian-doll-envelopes.java class Solution (line 1) | public class Solution { method maxEnvelopes (line 2) | public int maxEnvelopes(int[][] envelopes) { class EnvelopeComparator (line 25) | class EnvelopeComparator implements Comparator { method compare (line 26) | public int compare(int[] e1, int[] e2) { FILE: 363-max-sum-of-rectangle-no-larger-than-k/363-max-sum-of-rectangle-no-larger-than-k.cpp class Solution (line 2) | class Solution { method maxSumSubmatrix (line 4) | int maxSumSubmatrix(vector>& mat, int k) { FILE: 363-max-sum-of-rectangle-no-larger-than-k/363-max-sum-of-rectangle-no-larger-than-k.java class Solution (line 1) | class Solution { method maxSumSubmatrix (line 2) | public int maxSumSubmatrix(int[][] mat, int k) { FILE: 37-Sudoku-solver/37-Sudoku-solver.js function isValid (line 3) | function isValid(grid, row, col, k) { function solve (line 15) | function solve(grid) { FILE: 371-sum-of-two-integers/371-sum-of-two-integers.java class Solution (line 1) | class Solution { method getSum (line 2) | public int getSum(int a, int b) { FILE: 376-wiggle-subsequence/376-wiggle-subsequence.java class Solution (line 1) | public class Solution { method wiggleMaxLength (line 2) | public int wiggleMaxLength(int[] nums) { FILE: 377-combination-sum-iv/377-combination-sum-iv.java class Solution (line 1) | class Solution { method combinationSum4 (line 4) | public int combinationSum4(int[] nums, int target) { method helper (line 11) | private int helper(int[] nums, int target) { FILE: 378-kth-smallest-element-in-a-sorted-matrix/378-kth-smallest-element-in-a-sorted-matrix.java class Solution (line 1) | class Solution { method kthSmallest (line 2) | public int kthSmallest(int[][] mat, int k) { FILE: 383-ransom-note/383-ransom-note.java class Solution (line 1) | class Solution { method canConstruct (line 2) | public boolean canConstruct(String ransomNote, String magazine) { FILE: 383-ransom-note/ransom-note.cpp class Solution (line 1) | class Solution { method canConstruct (line 3) | bool canConstruct(string ransomNote, string magazine) { FILE: 383-ransom-note/ransome-note-two-approaches.cpp class Solution (line 1) | class Solution { method canConstruct (line 3) | bool canConstruct(string rn, string mag) { FILE: 387-first-unique-character-in-a-string/387-first-unique-character-in-a-string.java class Solution (line 1) | class Solution { method firstUniqChar (line 2) | public int firstUniqChar(String s) { FILE: 387-first-unique-character-in-a-string/first-unique-character-in-a-string.CPP function firstUniqChar (line 1) | int firstUniqChar(string s) { FILE: 393-utf-8-validation/393-utf-8-validation.java class Solution (line 1) | class Solution { method validUtf8 (line 2) | public boolean validUtf8(int[] data) method validUtf8 (line 35) | public boolean validUtf8(int[] data) { class Solution (line 34) | class Solution { method validUtf8 (line 2) | public boolean validUtf8(int[] data) method validUtf8 (line 35) | public boolean validUtf8(int[] data) { FILE: 399-evaluate-division/399-evaluate-division.java class Solution (line 1) | class Solution { class Node (line 2) | class Node{ method Node (line 5) | Node(String k,double v){ method calcEquation (line 10) | public double[] calcEquation(List> equations, double[] va... method dfs (line 18) | private double dfs(String s,String d,Set vis,Map> buildGraph(List> eq,double... FILE: 4-median-of-two-sorted-arrays/4-median-of-two-sorted-arrays.java class Solution (line 1) | class Solution { method findMedianSortedArrays (line 2) | public double findMedianSortedArrays(int[] nums1, int[] nums2) { FILE: 406-queue-reconstruction-by-height/406-queue-reconstruction-by-height.java class Solution (line 1) | class Solution { method reconstructQueue (line 2) | public int[][] reconstructQueue(int[][] people) { FILE: 410-split-array-largest-sum/410-split-array-largest-sum.java class Solution (line 1) | class Solution { method splitArray (line 2) | public int splitArray(int[] nums, int m) { method canSplit (line 23) | private boolean canSplit(int[] nums, int m, int largest) { FILE: 417-pacific-atlantic-water-flow/417-pacific-atlantic-water-flow.java class Solution (line 1) | class Solution { method pacificAtlantic (line 2) | public List> pacificAtlantic(int[][] heights) { method dfs (line 23) | private void dfs(int row, int col, int rows, int cols, boolean[][] vis... FILE: 417_Pacific Atlantic Water Flow.cpp class Solution (line 3) | class Solution{ method pacificAtlantic (line 11) | vector > pacificAtlantic(vector>& heights) { method dfs (line 23) | void dfs(vector >& mat, vector >& visited, in... function main (line 35) | int main(){ FILE: 42 Trapping Rain Water hd s18.cpp class Solution (line 4) | class Solution { method trap (line 6) | int trap(vector& height) { FILE: 42-trapping-rain-water/42-trapping-rain-water.java class Solution (line 1) | class Solution { method trap (line 2) | public int trap(int[] h) { FILE: 429-n-ary-tree-level-order-traversal/429-n-ary-tree-level-order-traversal.cpp class Solution (line 1) | class Solution { method levelOrder (line 3) | vector> levelOrder(Node* root) { FILE: 429-n-ary-tree-level-order-traversal/429-n-ary-tree-level-order-traversal.java class Solution (line 20) | class Solution { method levelOrder (line 21) | public List> levelOrder(Node root) { method levelOrder (line 47) | public List> levelOrder(Node root) { class Solution (line 46) | class Solution { method levelOrder (line 21) | public List> levelOrder(Node root) { method levelOrder (line 47) | public List> levelOrder(Node root) { FILE: 456-132-pattern/456-132-pattern.java class Solution (line 1) | class Solution { method find132pattern (line 2) | public boolean find132pattern(int[] nums) { FILE: 458-poor-pigs/458-poor-pigs.java class Solution (line 1) | class Solution { method poorPigs (line 2) | public int poorPigs(int buckets, int minutesToDie, int minutesToTest) { FILE: 462-minimum-moves-to-equal-array-elements-ii/462-minimum-moves-to-equal-array-elements-ii.java class Solution (line 1) | class Solution { method minMoves2 (line 2) | public int minMoves2(int[] nums) { FILE: 47-permutations-ii/47-permutations-ii.java class Solution (line 1) | class Solution { method permuteUnique (line 6) | public List> permuteUnique(int[] nums) { method permuteUnique (line 14) | private void permuteUnique(int[] nums, List list) { FILE: 473-matchsticks-to-square/473-matchsticks-to-square.java class Solution (line 3) | class Solution { method Solution (line 15) | public Solution() { method recurse (line 20) | public boolean recurse(Integer mask, Integer sidesDone) { method makesquare (line 71) | public boolean makesquare(int[] nums) { FILE: 474-ones-and-zeroes/474-ones-and-zeroes.java class Solution (line 1) | class Solution { method findMaxForm (line 2) | public static int findMaxForm(String[] strs, int m, int n) { FILE: 48-rotate-image/48-Rotate-Image.cpp class Solution (line 1) | class Solution { method rotate (line 3) | void rotate(vector>& mat) { FILE: 48-rotate-image/48-rotate-image.java class Solution (line 1) | class Solution { method rotate (line 2) | public void rotate(int[][] matrix) { FILE: 5-longest-palindromic-substring/5-longest-palindromic-substring.java class Solution (line 1) | class Solution { method longestPalindrome (line 2) | public String longestPalindrome(String s) { FILE: 50-powx-n/50-powx-n.java class Solution (line 1) | class Solution { method myPow (line 2) | public double myPow(double x, int n) { FILE: 509-fibonacci-number/509-fibonacci-number.java class Solution (line 1) | class Solution{ method multiply (line 3) | long[][] multiply(long [][]m1, long[][]m2){ method matPow (line 12) | long[][] matPow(long [][]mat,long n){ method fib (line 20) | public int fib(int N){ FILE: 51-n-queens/51-n-queens.java class Solution (line 1) | class Solution { method solveNQueens (line 2) | public List> solveNQueens(int n) { method solve (line 14) | public static void solve(List> res, int col, char[][] boa... method construct (line 36) | public static List construct(char[][] board){ FILE: 52-n-queens-ii/52-n-queens-ii.java class Solution (line 1) | class Solution { method totalNQueens (line 3) | public int totalNQueens(int n) { method dfs (line 8) | public void dfs(boolean[][]board,int row){ method isSafe (line 21) | boolean isSafe(boolean[][] board,int row,int col){ FILE: 53-maximum-subarray/53-maximum-subarray.java class Solution (line 1) | class Solution { method maxSubArray (line 2) | public int maxSubArray(int[] nums) { FILE: 53-maximum-subarray/Maximum Subarray.py class Solution (line 1) | class Solution: method maxSubArray (line 2) | def maxSubArray(self, nums: List[int]) -> int: FILE: 535-encode-and-decode-tinyurl/535-encode-and-decode-tinyurl.java class Codec (line 1) | public class Codec { method encode (line 4) | public String encode(String s) { method decode (line 9) | public String decode(String s) { FILE: 538-convert-bst-to-greater-tree/538-convert-bst-to-greater-tree.java class Solution (line 1) | class Solution { method convertBST (line 3) | public TreeNode convertBST(TreeNode root) { FILE: 541-reverse-string-ii/541-reverse-string-ii.java class Solution (line 1) | class Solution { method reverseStr (line 2) | public String reverseStr(String s, int k) { FILE: 557 Reverse Words in a String III easy lc s22.cpp class Solution (line 4) | class Solution { method string (line 8) | string reverseWords(string s) { FILE: 557-reverse-words-in-a-string-iii/557-reverse-words-in-a-string-iii.java class Solution (line 1) | class Solution { method reverseWords (line 2) | public String reverseWords(String sy) { FILE: 560. Subarray Sum Equals K/560. Subarray Sum Equals K.cpp class Solution (line 1) | class Solution { method subarraySum (line 3) | int subarraySum(vector& nums, int k) { FILE: 576-out-of-boundary-paths/576-out-of-boundary-paths.java class Solution (line 1) | class Solution { method findPaths (line 4) | public int findPaths(int m, int n, int maxMove, int startRow, int star... method f (line 13) | int f(int m, int n, int max, int r, int c) { FILE: 581-shortest-unsorted-continuous-subarray/581-shortest-unsorted-continuous-subarray.java class Solution (line 1) | public class Solution { method findUnsortedSubarray (line 2) | public int findUnsortedSubarray(int[] nums) { FILE: 583-delete-operation-for-two-strings/583-delete-operation-for-two-strings.java class Solution (line 1) | class Solution { method minDistance (line 2) | public int minDistance(String word1, String word2) { FILE: 59-spiral-matrix-ii/59-spiral-matrix-ii.java class Solution (line 1) | class Solution { method generateMatrix (line 2) | public int[][] generateMatrix(int n) { method fillMatrix (line 9) | public void fillMatrix(int [][]ans, int i, int j, int cur, char dir){ FILE: 6-zigzag-conversion/6-zigzag-conversion.java class Solution (line 1) | class Solution { method convert (line 2) | public String convert(String s, int numRows) { FILE: 606-construct-string-from-binary-tree/606-construct-string-from-binary-tree.java class Solution (line 16) | class Solution { method tree2str (line 18) | public String tree2str(TreeNode root) { method dfs (line 23) | public void dfs(TreeNode root){ FILE: 609 Find Duplicate File in System lc med s19.cpp class Solution (line 4) | class Solution { method split (line 6) | vector split(string str, char delim) { method findDuplicate (line 14) | vector> findDuplicate(vector& paths) { FILE: 609-find-duplicate-file-in-system/609-find-duplicate-file-in-system.java class Solution (line 1) | class Solution { method findDuplicate (line 2) | public List> findDuplicate(String[] paths) { FILE: 62-unique-paths/62-unique-paths.java class Solution (line 1) | class Solution { method uniquePaths (line 2) | public int uniquePaths(int m, int n) { method helper (line 6) | private int helper(int m, int n, int[][] dp) { FILE: 622-design-circular-queue/622-design-circular-queue.java class MyCircularQueue (line 1) | class MyCircularQueue { method MyCircularQueue (line 9) | public MyCircularQueue(int k) { method enQueue (line 14) | public boolean enQueue(int value) { method deQueue (line 23) | public boolean deQueue() method Front (line 33) | public int Front() { method Rear (line 39) | public int Rear() { method isEmpty (line 45) | public boolean isEmpty() { method isFull (line 49) | public boolean isFull() { FILE: 623-add-one-row-to-tree/623-add-one-row-to-tree.java class Solution (line 16) | class Solution { method addOneRow (line 17) | public TreeNode addOneRow(TreeNode root, int val, int depth) { method dfs (line 26) | public void dfs(TreeNode root,int val,int depth){ FILE: 629-k-inverse-pairs-array/629-k-inverse-pairs-array.java class Solution (line 1) | public class Solution { method kInversePairs (line 2) | public int kInversePairs(int n, int k) { FILE: 63-unique-paths-ii/63-unique-paths-ii.java class Solution (line 1) | class Solution { method uniquePathsWithObstacles (line 2) | public int uniquePathsWithObstacles(int[][] a) { FILE: 630-course-schedule-iii/630-course-schedule-iii.java class Solution (line 1) | public class Solution { method scheduleCourse (line 2) | public int scheduleCourse(int[][] courses) { FILE: 637-average-of-levels-in-binary-tree.py class Solution (line 1) | class Solution: method averageOfLevels (line 2) | def averageOfLevels(self, root: Optional[TreeNode]) -> List[float]: FILE: 637-average-of-levels-in-binary-tree/637-average-of-levels-in-binary-tree.cpp class Solution (line 1) | class Solution { method averageOfLevels (line 3) | vector averageOfLevels(TreeNode* root) { FILE: 637-average-of-levels-in-binary-tree/637-average-of-levels-in-binary-tree.java class Solution (line 16) | class Solution { method averageOfLevels (line 17) | public List averageOfLevels(TreeNode root) { FILE: 647-palindromic-substrings/647-palindromic-substrings.java class Solution (line 1) | class Solution { method countSubstrings (line 2) | public int countSubstrings(String s) { FILE: 653-two-sum-iv-input-is-a-bst/653-two-sum-iv-input-is-a-bst.java class Solution (line 1) | public class Solution { method findTarget (line 2) | public boolean findTarget(TreeNode root, int k) { method dfs (line 5) | private boolean dfs(TreeNode root, TreeNode cur, int target) { method search (line 11) | private boolean search(TreeNode root, TreeNode cur, int target) { FILE: 658-find-k-closest-elements/658-find-k-closest-elements.java class Solution (line 1) | class Solution { method findClosestElements (line 2) | public List findClosestElements(int[] arr, int k, int x) { method binSea (line 30) | public int binSea(int[]arr,int x){ FILE: 659-split-array-into-consecutive-subsequences/659-split-array-into-consecutive-subsequences.cpp class Solution (line 1) | class Solution { method isPossible (line 3) | bool isPossible(vector& nums) { FILE: 659-split-array-into-consecutive-subsequences/659-split-array-into-consecutive-subsequences.java class Solution (line 1) | class Solution { method isPossible (line 2) | public boolean isPossible(int[] nums) { FILE: 665-non-decreasing-array/665-non-decreasing-array.java class Solution (line 1) | class Solution { method checkPossibility (line 2) | public boolean checkPossibility(int[] arr) { method helper (line 21) | public int helper(int[] arr) { FILE: 669-trim-a-binary-search-tree/669-trim-a-binary-search-tree.java class Solution (line 16) | class Solution { method trimBST (line 17) | public TreeNode trimBST(TreeNode root, int low, int high) { FILE: 680-valid-palindrome-ii/680-valid-palindrome-ii.java class Solution (line 1) | class Solution { method validPalindrome (line 2) | public boolean validPalindrome(String s) { method valid (line 19) | boolean valid(byte[] chars, int i, int j) { FILE: 682-baseball-game/682-baseball-game.java class Solution (line 1) | class Solution { method calPoints (line 2) | public int calPoints(String[] ops) { FILE: 695-max-area-of-island/695-max-area-of-island.java class Solution (line 1) | class Solution { method maxAreaOfIsland (line 2) | public int maxAreaOfIsland(int[][] grid) { method iarea (line 16) | public static int iarea(int [][]grid,int i,int j){ FILE: 695-max-area-of-island/SolutionCode.cpp class Solution (line 14) | class Solution { method travelMap (line 16) | int travelMap(int r, int c, vector> &grid){ method maxAreaOfIsland (line 34) | int maxAreaOfIsland(vector>& grid) { FILE: 698-partition-to-k-equal-sum-subsets/698-partition-to-k-equal-sum-subsets.java class Solution (line 1) | class Solution { method canPartitionKSubsets (line 2) | public boolean canPartitionKSubsets(int[] arr, int k) { method dfs (line 11) | public boolean dfs(int ind,int[] arr,int[] sum, int k,int target){ FILE: 7 Segment Display.java class Solution (line 1) | class Solution { method sevenSegments (line 2) | static String sevenSegments(String S, int N) { FILE: 70-climbing-stairs/70-climbing-stairs.java class Solution (line 1) | class Solution { method climbStairs (line 2) | public int climbStairs(int n) { FILE: 700-search-in-a-binary-search-tree/700-search-in-a-binary-search-tree.java class Solution (line 16) | class Solution { method searchBST (line 17) | public TreeNode searchBST(TreeNode root, int val) { FILE: 703-kth-largest-element-in-a-stream/703-kth-largest-element-in-a-stream.py class KthLargest (line 1) | class KthLargest: method __init__ (line 3) | def __init__(self, k: int, nums: List[int]): method add (line 8) | def add(self, val: int) -> int: FILE: 704-binary-search/704-binary-search.java class Solution (line 1) | class Solution { method search (line 2) | public int search(int[] nums, int target) { FILE: 705-design-hashset/705-design-hashset.java class MyHashSet (line 1) | class MyHashSet { method MyHashSet (line 3) | public MyHashSet() { method add (line 7) | public void add(int key) { method remove (line 11) | public void remove(int key) { method contains (line 15) | public boolean contains(int key) { FILE: 706-design-hashmap/706-design-hashmap.java class MyHashMap (line 1) | class MyHashMap { method MyHashMap (line 3) | public MyHashMap() { method put (line 8) | public void put(int key, int value) { method get (line 12) | public int get(int key) { method remove (line 17) | public void remove(int key) { FILE: 713_Subarray_Product_Less_Than_K.cpp class Solution (line 1) | class Solution { method numSubarrayProductLessThanK (line 3) | int numSubarrayProductLessThanK(vector& n, int k) { FILE: 718-Maximum-Length-of-Repeated-Subarray.cpp function findLength (line 1) | int findLength(vector& nums1, vector& nums2) FILE: 718-maximum-length-of-repeated-subarray/718-maximum-length-of-repeated-subarray.java class Solution (line 3) | class Solution { method rolling (line 8) | private int[] rolling(int[] source, int length) { method check (line 25) | private boolean check(int guess, int[] A, int[] B) { method findLength (line 43) | public int findLength(int[] A, int[] B) { FILE: 718-maximum-length-of-repeated-subarray/Solved Using DP.java class Solution (line 1) | class Solution { method findLength (line 2) | public int findLength(int[] nums1, int[] nums2) { FILE: 718. Maximum Length of Repeated Subarray lc med s20.cpp class Solution (line 4) | class Solution { method findLength (line 6) | int findLength(vector& nums1, vector& nums2) { FILE: 718. Maximum Length of Repeated Subarray/718. Maximum Length of Repeated Subarray.cpp class Solution (line 1) | class Solution { method findLength (line 3) | int findLength(vector& nums1, vector& nums2) { FILE: 724-find-pivot-index/724-find-pivot-index.java class Solution (line 1) | class Solution { method pivotIndex (line 2) | public int pivotIndex(int[] nums) { FILE: 729-my-calendar-i/729-my-calendar-i.java class MyCalendar (line 1) | class MyCalendar { class TreeNode (line 3) | class TreeNode{ method TreeNode (line 8) | TreeNode(int start,int end){ method MyCalendar (line 14) | public MyCalendar() { method book (line 18) | public boolean book(int start, int end) { method insert (line 26) | private boolean insert(TreeNode root, int start, int end){ FILE: 732-my-calendar-iii/732-my-calendar-iii.java class MyCalendarThree (line 1) | class MyCalendarThree { method MyCalendarThree (line 4) | public MyCalendarThree() { method book (line 8) | public int book(int start, int end) { FILE: 74-search-a-2d-matrix/74-search-a-2d-matrix.java class Solution (line 1) | class Solution { method searchMatrix (line 3) | public boolean searchMatrix(int[][] matrix, int target) { method binarySearch (line 17) | public boolean binarySearch(int[][]matrix,int i){ FILE: 743-network-delay-time/743-network-delay-time.java class Solution (line 1) | class Solution { method networkDelayTime (line 2) | public int networkDelayTime(int[][] times, int n, int k) { FILE: 745-prefix-and-suffix-search/745-prefix-and-suffix-search.java class WordFilter (line 1) | class WordFilter { method WordFilter (line 3) | public WordFilter(String[] words) { method f (line 20) | public int f(String prefix, String suffix) { class TrieNode (line 30) | class TrieNode { method TrieNode (line 33) | public TrieNode() { FILE: 746-min-cost-climbing-stairs/746-min-cost-climbing-stairs.java class Solution (line 1) | class Solution { method minCostClimbingStairs (line 2) | public int minCostClimbingStairs(int[] cost) { FILE: 76-minimum-window-substring/76-minimum-window-substring.java class Solution (line 1) | class Solution { method minWindow (line 2) | public String minWindow(String s, String t) { FILE: 763-partition-labels/763-partition-labels.java class Solution (line 1) | class Solution { method partitionLabels (line 2) | public List partitionLabels(String s) { FILE: 785-is-graph-bipartite/785-is-graph-bipartite.java class Solution (line 1) | class Solution { method isBipartite (line 2) | public boolean isBipartite(int[][] graph) { FILE: 791-Custom-Sort-String-Leetcode.cpp class Solution (line 1) | class Solution { method string (line 3) | string customSortString(string order, string s) FILE: 792-number-of-matching-subsequences/792-number-of-matching-subsequences.java class Solution (line 1) | class Solution { method numMatchingSubseq (line 2) | public int numMatchingSubseq(String s, String[] words) { FILE: 802. Find Eventual Safe States.java class Solution (line 1) | class Solution { method eventualSafeNodes (line 2) | public List eventualSafeNodes(int[][] graph) { method dfs (line 35) | public boolean dfs(List> adj,int node,int[] vis,int[] df... FILE: 804-unique-morse-code-words/804-unique-morse-code-words.java class Solution (line 1) | class Solution { method uniqueMorseRepresentations (line 3) | public int uniqueMorseRepresentations(String[] words) { method convertToMorseStr (line 19) | private String convertToMorseStr(String[] MORSE, String word) { FILE: 804-unique-morse-code-words/unique-morse-code.cpp class Solution (line 1) | class Solution { method uniqueMorseRepresentations (line 3) | int uniqueMorseRepresentations(vector& words) { FILE: 81-search-in-rotated-sorted-array-ii/81-search-in-rotated-sorted-array-ii.java class Solution (line 1) | class Solution { method search (line 2) | public boolean search(int[] nums, int target) { FILE: 814-binary-tree-pruning/814-binary-tree-pruning.java class Solution (line 16) | class Solution { method pruneTree (line 19) | public TreeNode pruneTree(TreeNode root) { method dfs (line 28) | void dfs(TreeNode root){ method sum (line 39) | int sum(TreeNode root){ method helper (line 58) | public boolean helper(TreeNode root){ FILE: 82-remove-duplicates-from-sorted-list-ii/82-remove-duplicates-from-sorted-list-ii.java class Solution (line 11) | public class Solution { method deleteDuplicates (line 12) | public ListNode deleteDuplicates(ListNode A) { FILE: 820-short-encoding-of-words/820-short-encoding-of-words.java class Solution (line 1) | class Solution { method minimumLengthEncoding (line 2) | public int minimumLengthEncoding(String[] words) { class Trie (line 17) | class Trie { method Trie (line 21) | public Trie() { method insert (line 25) | public boolean insert(String word) { class TrieNode (line 40) | class TrieNode { method TrieNode (line 43) | public TrieNode() {} FILE: 823-binary-trees-with-factors/823-binary-trees-with-factors.java class Solution (line 1) | class Solution { method numFactoredBinaryTrees (line 2) | public int numFactoredBinaryTrees(int[] arr) { FILE: 838-push-dominoes/838-push-dominoes.java class Solution (line 1) | class Solution { method pushDominoes (line 2) | public String pushDominoes(String dominoes) { FILE: 844-backspace-string-compare/844-backspace-string-compare.java class Solution (line 1) | class Solution { method backspaceCompare (line 2) | public boolean backspaceCompare(String s, String t) { method getNextCharacterPosition (line 24) | public int getNextCharacterPosition(String s, int start) { FILE: 845_Longest_Mountain_in_Array.cpp class Solution (line 1) | class Solution { method longestMountain (line 3) | int longestMountain(vector& arr) { FILE: 856-score-of-parentheses/856-score-of-parentheses.java class Solution (line 1) | class Solution { method scoreOfParentheses (line 2) | public int scoreOfParentheses(String S) { FILE: 86-partition-list/86-partition-list.java class Solution (line 11) | class Solution { method partition (line 12) | public ListNode partition(ListNode head, int x) { FILE: 867-transpose-matrix/867-transpose-matrix.java class Solution (line 1) | class Solution { method transpose (line 2) | public int[][] transpose(int[][] A) { FILE: 869-Reordered-Power-of-2/869-Reordered-Power-of-2.cpp class Solution (line 1) | class Solution { method reorderedPowerOf2 (line 3) | bool reorderedPowerOf2(int n) { FILE: 871-minimum-number-of-refueling-stops/871-minimum-number-of-refueling-stops.java class Solution (line 1) | class Solution { method minRefuelStops (line 2) | public int minRefuelStops(int target, int startFuel, int[][] stations) { FILE: 871-minimum-number-of-refueling-stops/Minimum-Number-of-Refueling-Stops.cpp class Solution (line 1) | class Solution { method minRefuelStops (line 3) | int minRefuelStops(int target, int startFuel, vector>& sta... FILE: 871. Minimum Number of Refueling Stops.cpp function minRefuelStops (line 1) | int minRefuelStops(int target, int sf, vector>& s) { FILE: 876-middle-of-the-linked-list/876-middle-of-the-linked-list.java class Solution (line 11) | class Solution { method middleNode (line 12) | public ListNode middleNode(ListNode head) { FILE: 88-merge-sorted-array/88-merge-sorted-array.java class Solution (line 1) | class Solution { method merge (line 2) | public void merge(int[] nums1, int m, int[] nums2, int n) { FILE: 881-boats-to-save-people/881-boats-to-save-people.java class Solution (line 1) | class Solution { method numRescueBoats (line 2) | public int numRescueBoats(int[] people, int limit) { FILE: 890-find-and-replace-pattern/890-find-and-replace-pattern.java class Solution (line 1) | class Solution { method findAndReplacePattern (line 2) | public static List findAndReplacePattern(String[] words, Strin... method checkPattern (line 11) | private static boolean checkPattern(String word, String pattern){ FILE: 895-maximum-frequency-stack/895-maximum-frequency-stack.java class FreqStack (line 1) | class FreqStack { method FreqStack (line 8) | public FreqStack() { method push (line 15) | public void push(int val) { method pop (line 27) | public int pop() { FILE: 897-increasing-order-search-tree/897-increasing-order-search-tree.java class Solution (line 1) | class Solution { method increasingBST (line 2) | public TreeNode increasingBST(TreeNode root){ method inOrder (line 13) | public void inOrder(TreeNode root,List list){ FILE: 905-sort-array-by-parity/905-sort-array-by-parity.java class Solution (line 1) | class Solution { method sortArrayByParity (line 2) | public int[] sortArrayByParity(int[] nums) { FILE: 91-decode-ways/91-decode-ways.java class Solution (line 1) | class Solution { method numDecodings (line 2) | public int numDecodings(String s) { FILE: 916-word-subsets/916-word-subsets.java class Solution (line 1) | class Solution { method wordSubsets (line 2) | public List wordSubsets(String[] A, String[] B) { method count (line 22) | public int[] count(String S) { FILE: 92-reverse-linked-list-ii/92-reverse-linked-list-ii.java class Solution (line 1) | class Solution { method reverseBetween (line 2) | public ListNode reverseBetween(ListNode head, int left, int right) { FILE: 923-3sum-with-multiplicity/923-3sum-with-multiplicity.java class Solution (line 1) | class Solution { method threeSumMulti (line 2) | public int threeSumMulti(int[] A, int target) { FILE: 936-stamping-the-sequence/936-stamping-the-sequence.java class Solution (line 1) | class Solution { method movesToStamp (line 2) | public int[] movesToStamp(String stamp, String target) { method stamp (line 28) | private int stamp(int start, char[] s, char[] t, int count) { method canStamp (line 38) | private boolean canStamp(int start, char[] s, char[] t) { FILE: 936-stamping-the-sequence/Stamping The Sequence.cpp class Solution (line 1) | class Solution { method canReplace (line 4) | bool canReplace(string &stamp, string &target, int i, int n) method replace (line 14) | void replace(string &stamp, string &target, int i, int n, int &cnt) method movesToStamp (line 21) | vector movesToStamp(string stamp, string target) { FILE: 936-stamping-the-sequence/stamping-the-sequence.cpp class Solution (line 13) | class Solution { method movesToStamp (line 15) | vector movesToStamp(string stamp, string target) { method remove (line 28) | int remove(string& str, string stamp){ FILE: 94-binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.java class Solution (line 16) | class Solution { method inorderTraversal (line 17) | public List inorderTraversal(TreeNode root) { method inOrder (line 22) | void inOrder(TreeNode root,List list){ FILE: 94-binary-tree-inorder-traversal/Binary Tree InOrder Traversal lc.cpp class Solution (line 15) | class Solution { method inorder (line 18) | void inorder(TreeNode* node){ method inorderTraversal (line 27) | vector inorderTraversal(TreeNode* root) { FILE: 94. Binary Tree Inorder Traversal.cpp class Solution (line 1) | class Solution { method solve (line 3) | void solve(TreeNode *root,vector &result) method inorderTraversal (line 12) | vector inorderTraversal(TreeNode* root) { FILE: 948 Bag of Tokens lc med.cpp class Solution (line 1) | class Solution { method bagOfTokensScore (line 3) | int bagOfTokensScore(vector& tokens, int power) { FILE: 948-bag-of-tokens/948-bag-of-tokens.java class Solution (line 1) | class Solution { method bagOfTokensScore (line 2) | public int bagOfTokensScore(int[] tokens, int power) { FILE: 96-Unique Binary Search Trees.java method helper (line 3) | public static int helper(int n, int[] dp) { method numTrees (line 15) | public int numTrees(int n) { method numTrees (line 23) | public int numTrees(int n) { FILE: 967-numbers-with-same-consecutive-differences/967-numbers-with-same-consecutive-differences.java class Solution (line 1) | class Solution { method numsSameConsecDiff (line 3) | public int[] numsSameConsecDiff(int n, int k) { method dfs (line 15) | void dfs(int num,int n,int k){ FILE: 968-binary-tree-cameras/968-binary-tree-cameras.java class Solution (line 1) | class Solution { method minCameraCover (line 7) | public int minCameraCover(TreeNode root) { method dfs (line 12) | private int dfs (TreeNode root){ FILE: 97-interleaving-string/97-interleaving-string.java class Solution (line 1) | class Solution { method isInterleave (line 2) | public boolean isInterleave(String s1, String s2, String s3) { method isInterleaveHelper (line 7) | private boolean isInterleaveHelper(String s1, String s2, String s3, in... FILE: 98-validate-binary-search-tree/98-validate-binary-search-tree.java class Solution (line 16) | class Solution { method isValidBST (line 17) | public boolean isValidBST(TreeNode root) { method dfs (line 20) | boolean dfs(TreeNode root,long lower,long upper){ FILE: 981-time-based-key-value-store/981-time-based-key-value-store.java class TimeValue (line 1) | class TimeValue { method TimeValue (line 6) | public TimeValue(int time, String value) { method toString (line 12) | public String toString() { class TimeMap (line 19) | class TimeMap { method TimeMap (line 23) | public TimeMap() { method set (line 27) | public void set(String key, String value, int timestamp) { method get (line 43) | public String get(String key, int timestamp) { FILE: 985 Sum of Even Numbers After Queries lc med.cpp class Solution (line 4) | class Solution { method sumEvenAfterQueries (line 6) | vector sumEvenAfterQueries(vector& nums, vector>... FILE: 985-sum-of-even-numbers-after-queries/985-sum-of-even-numbers-after-queries.java class Solution (line 1) | class Solution { method sumEvenAfterQueries (line 2) | public int[] sumEvenAfterQueries(int[] nums, int[][] queries) { FILE: 987-vertical-order-traversal-of-a-binary-tree/987-vertical-order-traversal-of-a-binary-tree.java class Solution (line 16) | class Solution { method verticalTraversal (line 19) | public List> verticalTraversal(TreeNode root) { method dfs (line 35) | void dfs(TreeNode root,int row,int col){ class Pair (line 60) | class Pair{ method Pair (line 65) | Pair(TreeNode value,int hdist){ method verticalTraversal (line 71) | public List> verticalTraversal(TreeNode root) { class Solution (line 58) | class Solution { method verticalTraversal (line 19) | public List> verticalTraversal(TreeNode root) { method dfs (line 35) | void dfs(TreeNode root,int row,int col){ class Pair (line 60) | class Pair{ method Pair (line 65) | Pair(TreeNode value,int hdist){ method verticalTraversal (line 71) | public List> verticalTraversal(TreeNode root) { FILE: 99-recover-binary-search-tree/99-recover-binary-search-tree.java class Solution (line 1) | class Solution { method recoverTree (line 5) | public void recoverTree(TreeNode root) { method swap (line 9) | public void swap(TreeNode a, TreeNode b) { method inorder (line 14) | public void inorder(TreeNode root) { FILE: 990-satisfiability-of-equality-equations/990-satisfiability-of-equality-equations.java class Solution (line 1) | class Solution { method find (line 3) | public int find(int x) { method equationsPossible (line 13) | public boolean equationsPossible(String[] equations) { FILE: 991-broken-calculator/991-broken-calculator.java class Solution (line 1) | class Solution { method brokenCalc (line 2) | public int brokenCalc(int startValue, int target) { FILE: Add 1 to linked list.java class Solution (line 1) | class Solution method addOne (line 3) | public static Node addOne(Node head) method reverse (line 23) | public static Node reverse(Node head){ FILE: Add Binary Strings.java class Solution (line 2) | public class Solution { method addBinary (line 3) | public String addBinary(String A, String B) { method addBinary (line 13) | public String addBinary(String A, String B) { class Solution (line 12) | public class Solution { method addBinary (line 3) | public String addBinary(String A, String B) { method addBinary (line 13) | public String addBinary(String A, String B) { FILE: Add Digits.java class Solution (line 1) | class Solution { method addDigits (line 2) | public int addDigits(int num) { FILE: Add One To Array.java class Solution (line 1) | public class Solution { method plusOne (line 2) | public int[] plusOne(int[] a) { method allNines (line 35) | public boolean allNines(int[]a){ FILE: Add Two Numbers.java class Solution (line 1) | class Solution { method addTwoNumbers (line 2) | public ListNode addTwoNumbers(ListNode l1, ListNode l2) { FILE: Add all greater values to every node in a BST.java class Solution (line 1) | class Solution{ method modify (line 4) | public Node modify(Node root){ method mod (line 9) | public void mod(Node node,int increment){ method sum (line 16) | public int sum(Node node){ FILE: Add binary.java class Solution (line 1) | class Solution { method addBinary (line 2) | public String addBinary(String a, String b) { FILE: Adding Array Elements.java class Solution (line 1) | class Solution { method minOperations (line 2) | int minOperations(int[] arr, int n, int k) { FILE: Adventure in a Maze - GFG/adventure-in-a-maze.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 37) | class Solution{ method FindWays (line 39) | public int[] FindWays(int[][] matrix){ FILE: Alien Dictionary - GFG/Alien Dictionary.cpp class Solution (line 10) | class Solution{ method solve (line 11) | void solve(int i,vector> v,vector &vis,string &res){ method string (line 24) | string findOrder(string dict[], int n, int k) { function f (line 55) | bool f(string a, string b) { function main (line 69) | int main() { FILE: All Elements in Two Binary Search Trees.java class Solution (line 1) | class Solution { method getAllElements (line 2) | public List getAllElements(TreeNode root1, TreeNode root2) { method dfs (line 13) | private void dfs(TreeNode node, LinkedList ret) { method dfs2 (line 20) | private void dfs2(TreeNode node, List ret, LinkedList specialStrings(ArrayList A) { method dfs (line 7) | void dfs(ArrayList ans,ArrayList arr,StringBuilder sb){ FILE: All Unique Permutations.java class Solution (line 1) | public class Solution { method permute (line 5) | public ArrayList> permute(ArrayList nums) { method permuteUnique (line 13) | private void permuteUnique(ArrayList nums, List list) { FILE: Allocate minimum number of pages.cpp class Solution (line 2) | class Solution method allocationPoss (line 6) | bool allocationPoss(int p,int M,int A[],int n){ method findPages (line 20) | int findPages(int A[], int N, int M) FILE: Alternate positive and negative numbers.cpp class Solution (line 1) | class Solution{ method rearrange (line 4) | void rearrange(int arr[], int n) { FILE: Alternate positive and negative numbers.java class Solution (line 1) | class Solution { method rearrange (line 2) | void rearrange(int arr[], int n) { FILE: Anagram of String.java class GfG (line 1) | class GfG method remAnagrams (line 3) | public int remAnagrams(String s,String s1){ FILE: Anagrams.java class Solution (line 1) | public class Solution { method anagrams (line 3) | public ArrayList> anagrams(final List A) { FILE: Anti Diagonals.py class Solution (line 1) | class Solution: method diagonal (line 2) | def diagonal(self, A): FILE: Arithmetic Slices.java class Solution (line 1) | class Solution { method numberOfArithmeticSlices (line 2) | public int numberOfArithmeticSlices(int[] nums) { FILE: Array 3 Pointers.java class Solution (line 1) | public class Solution { method minimize (line 3) | public int minimize(final List A, final List B, fina... method abs (line 38) | public int abs(int a){ FILE: Array Partition - GFG/array-partition.java class GFG (line 8) | class GFG { method main (line 9) | public static void main(String args[]) throws IOException { class Solution (line 36) | class Solution{ method rec (line 37) | boolean rec( int start , int[] A , int K , int M ){ method partitionArray (line 50) | boolean partitionArray(int N, int K, int M, int [] A){ FILE: Array Sum.java class Solution (line 1) | public class Solution { method addArrays (line 2) | public int[] addArrays(int[] A, int[] B) { FILE: Array to BST - GFG/array-to-bst.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 34) | class Solution{ method fillArray (line 35) | public void fillArray(int[] res,int[] n, int s, int e, int[] i){ method sortedArrayToBST (line 43) | public int[] sortedArrayToBST(int[] n){ FILE: Assign Mice to Holes.java class Solution (line 1) | public class Solution { method mice (line 2) | public int mice(int[] A, int[] B) { FILE: Assignment Problem - GFG/assignment-problem.cpp class Solution (line 6) | class Solution { method init_labels (line 19) | void init_labels() method update_labels (line 29) | void update_labels() method add_to_tree (line 48) | void add_to_tree(int x, int prev_iousx) method augment (line 64) | void augment() //main function of the algorithm method hungarian (line 157) | int hungarian() method assignmentProblem (line 172) | int assignmentProblem(int Arr[], int N) { function main (line 186) | int main() { FILE: Assignment Problem - GFG/assignment-problem.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 38) | class Solution { method assignmentProblem (line 39) | static int assignmentProblem(int a[], int n) { method dfs (line 54) | static int[] dfs(int[][]mat,int n){ FILE: Assignment Problem - GFG/assignment-problem.py class Solution (line 3) | class Solution: method assignmentProblem (line 4) | def assignmentProblem(self, Arr, N): FILE: Assignment Problem - GFG/hungarian_java(not_accepted).java class Solution (line 2) | class Solution { method main (line 8) | public static void main(String[] args) { method assignmentProblem (line 12) | static int assignmentProblem(int Arr[], int N) { method makeMat (line 75) | static void makeMat(int[] Arr, int[][] mat, int N) { method copy (line 85) | static void copy(int[][] mat, int[][] temp, int N) { method reduction (line 94) | static void reduction(int[][] temp, int N) { method optimisation (line 119) | static void optimisation(int[][] temp, int[][] sign, int N) { method deleteRow (line 148) | static void deleteRow(int[][] sign, int rowDel, int n) { method indexInCol (line 158) | static int indexInCol(int[][] temp,int[][]sign, int col, int n) { method countInCol (line 167) | static int countInCol(int[][] temp,int[][]sign, int col, int n) { method deleteCol (line 176) | static void deleteCol(int[][] sign, int delCol,int N) { method indexInRow (line 185) | static int indexInRow(int[][] temp,int[][]sign, int row, int N) { method countInRow (line 194) | static int countInRow(int[][] temp,int[][]sign, int row,int N) { FILE: Average of level in Binary tree.cpp class Solution (line 16) | class Solution { method averageOfLevels (line 18) | vector averageOfLevels(TreeNode* root) { FILE: Average of levels in binary tree.java class Solution (line 1) | class Solution { method averageOfLevels (line 2) | public List averageOfLevels(TreeNode root) { FILE: BST To Max Heap.cpp class Solution (line 1) | class Solution{ method recur (line 4) | void recur(Node *root,priority_queue&pq) method change (line 14) | void change(Node *root,priority_queue&pq) method convertToMaxHeapUtil (line 25) | void convertToMaxHeapUtil(Node* root) FILE: BST to greater sum tree - GFG/bst-to-greater-sum-tree.java class Node (line 9) | class Node{ method Node (line 13) | Node(int data){ class Tree (line 20) | class Tree { method buildTree (line 22) | static Node buildTree(String str){ method inOrder (line 78) | static void inOrder(Node root) method main (line 90) | public static void main (String[] args) throws IOException{ class Solution (line 127) | class Solution method transformTree (line 130) | public static void transformTree (Node root) method dfs (line 136) | static void dfs(Node root){ FILE: BST to max heap GFG/BstToMaxHeap.cpp function helper1 (line 2) | void helper1(Node *root,vector&ans){ function helper2 (line 11) | void helper2(Node *root,vector&ans,int &index){ function convertToMaxHeapUtil (line 20) | void convertToMaxHeapUtil(Node* root) FILE: BST to max heap gfg med.cpp type Node (line 7) | struct Node { function Node (line 15) | Node* newNode(int val) function Node (line 25) | Node* buildTree(string str) function postorderTraversal (line 87) | void postorderTraversal(Node* root) class Solution (line 101) | class Solution{ method postorder (line 105) | void postorder(Node* root){ method inorder (line 111) | void inorder(Node *root){ method convertToMaxHeapUtil (line 117) | void convertToMaxHeapUtil(Node* root) function main (line 124) | int main() FILE: BST-to-max-Heap/BSTtoMaxHeap.java class Solution (line 1) | class Solution method convertToMaxHeapUtil (line 4) | public static void convertToMaxHeapUtil(Node root) method inOrder (line 12) | public static void inOrder(Node root, ArrayList nodes) { FILE: BST-to-max-Heap/Solution.cpp class Solution (line 1) | class Solution{ method Node (line 5) | Node* helper(Node* root){ method convertToMaxHeapUtil (line 39) | void convertToMaxHeapUtil(Node* root) FILE: Bag Of Tokens.java class Solution (line 1) | class Solution { method bagOfTokensScore (line 2) | public int bagOfTokensScore(int[] tokens, int power) { FILE: Balanced Binary Tree.java class Solution (line 1) | public class Solution { method isBalanced (line 2) | public int isBalanced(TreeNode A) { method getHeight (line 21) | int getHeight(TreeNode root){ FILE: Balanced Parantheses!.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(String A) { FILE: Ball Coloring.cpp class Solution (line 1) | class Solution { method noOfWays (line 3) | unsigned long long int noOfWays(unsigned long long int n){ FILE: Ball coloring.cpp class Solution (line 1) | class Solution { method noOfWays (line 3) | unsigned long long int noOfWays(unsigned long long int n){ FILE: Ball coloring.java class Solution (line 1) | class Solution { method noOfWays (line 2) | static long noOfWays(long n){ FILE: Ball coloring.py class Solution (line 1) | class Solution: method noOfWays (line 2) | def noOfWays (self, n): FILE: Ball-Coloring/ball_coloring.java class Solution (line 1) | class Solution{ method noOfWays (line 2) | static long noOfWays(long n){ FILE: Best Time to Buy and Sell Stock IV.java class Solution (line 1) | class Solution { method maxProfit (line 2) | public int maxProfit(int k, int[] prices) { method maximumProfit (line 11) | public int maximumProfit(int[] prices, int k, int ind, int buy, int []... FILE: Best Time to Buy and Sell Stock.java class Solution (line 1) | class Solution { method maxProfit (line 2) | public int maxProfit(int[] prices) { FILE: Biconnected Graph.java class Solution (line 1) | class Solution { method biGraph (line 2) | static int biGraph(int[] arr, int n, int e) { FILE: Bike Racing - GFG/bike-racing.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException{ class Solution (line 33) | class Solution{ method check (line 34) | static boolean check(long T, long L, long S[], long A[], long N, long M){ method buzzTime (line 49) | static long buzzTime(long N, long M, long L, long H[], long A[]) FILE: Binary Matrix with at most K 1s.java class Solution (line 1) | class Solution { method largestSquare (line 2) | static ArrayList largestSquare(ArrayList> ... FILE: Binary Tree Pruning lc.cpp class Solution (line 4) | class Solution { method TreeNode (line 9) | TreeNode* pruneTree(TreeNode* root) { FILE: Binary Tree Pruning.java class Solution (line 1) | class Solution { method pruneTree (line 2) | public TreeNode pruneTree(TreeNode root) { method make (line 7) | public boolean make(TreeNode root) { FILE: Bipartite Graph - GFG/bipartite-graph.java class GFG (line 5) | class GFG method main (line 7) | public static void main(String[] args) throws IOException class Solution (line 37) | class Solution method isBipartite (line 39) | public boolean isBipartite(int V, ArrayList>adj) FILE: Bit Difference - GFG/Bit Difference.cpp class Solution (line 10) | class Solution{ method countBits (line 12) | int countBits(int N, long long int A[]) function main (line 33) | int main(){ FILE: Bitwise AND of the Array.java class Solution (line 1) | class Solution { method count (line 2) | int count(int N, int A[], int X){ FILE: Black Shapes.java class Solution (line 1) | public class Solution { method black (line 3) | public int black(String[] A) { method dfs (line 19) | void dfs(char[][]arr,int i,int j){ FILE: Book_Allcoation_Problem.cpp function isPossible (line 34) | bool isPossible(int arr[],int m,int n,int mid) function allocatedBooK (line 57) | int allocatedBooK(int arr[],int m,int n) function main (line 84) | int main() FILE: Brackets in Matrix Chain Multiplication - GFG/brackets-in-matrix-chain-multiplication.cpp class Solution (line 10) | class Solution { method string (line 16) | string matrixChainOrder(int A[], int n) { method matrixChainOrderUtil (line 20) | pair matrixChainOrderUtil(int p[], int l, int r) { function main (line 49) | int main(){ FILE: Brackets in Matrix Chain Multiplication - GFG/brackets-in-matrix-chain-multiplication.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 28) | class Solution{ method matrixChainOrder (line 31) | static String matrixChainOrder(int p[], int n){ method dfs (line 53) | static void dfs(int i,int j,int[][]path){ FILE: Brain Game - GFG/brain-game.cpp class Solution (line 6) | class Solution{ method brainGame (line 8) | bool brainGame(vectornums) { function main (line 28) | int main(){ FILE: Brain Game - GFG/brain-game.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 42) | class Solution method brainGame (line 44) | public boolean brainGame(int[] nums) method primeFactors (line 53) | int primeFactors(int n) method isPrime (line 68) | boolean isPrime(int n){ FILE: Breadth first search.cpp function bfs (line 6) | void bfs(int node,vector* adj,vector* visited) function main (line 30) | int main() FILE: Broken blocks - GFG/broken-blocks.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 36) | class Solution method MaxGold (line 39) | public int MaxGold(int[][] a){ method dfs (line 47) | public int dfs(int[][]a,int i,int j){ method valid (line 54) | public boolean valid(int[][]a,int i,int j){ FILE: Burning Tree.cpp class Solution (line 1) | class Solution { method minTime (line 4) | int minTime(Node* root, int target) FILE: Can Make Triangle.java class Solution (line 1) | class Solution method canMakeTriangle (line 3) | int[] canMakeTriangle(int A[], int N) method isTriangle (line 14) | boolean isTriangle(int a,int b,int c){ FILE: Can Place Flowers.java class Solution (line 1) | class Solution { method canPlaceFlowers (line 2) | public boolean canPlaceFlowers(int[] flowerbed, int n) { FILE: Capacity To Ship Packages Within D Days.java class Solution (line 1) | class Solution { method leastWeightCapacity (line 2) | static int leastWeightCapacity(int[] a, int n, int d) { method isValid (line 18) | static boolean isValid(int[]a,int k,int res){ method sum (line 30) | static int sum(int[]a){ method largest (line 37) | static int largest(int[]arr) FILE: Case-specific Sorting of Strings.java class Solution (line 1) | class Solution method caseSort (line 5) | public static String caseSort(String str) FILE: Case-specific Sorting of Strings.py class Solution (line 1) | class Solution: method caseSort (line 4) | def caseSort(self,s,n): FILE: Case-specific Sorting string.cpp class Solution (line 6) | class Solution method string (line 10) | string caseSort(string str, int n) function main (line 50) | int main() FILE: Ceil in BST.java class Tree (line 1) | class Tree { method findCeil (line 4) | int findCeil(Node root, int key) { method dfs (line 11) | void dfs(Node root,int key){ FILE: Champagne Tower.java class Solution (line 1) | class Solution { method champagneTower (line 2) | public double champagneTower(int poured, int query_row, int query_glas... method champagneTower (line 25) | public double champagneTower(int poured, int queryRow, int queryGlass) { class Solution (line 24) | class Solution { method champagneTower (line 2) | public double champagneTower(int poured, int query_row, int query_glas... method champagneTower (line 25) | public double champagneTower(int poured, int queryRow, int queryGlass) { FILE: Change Bits - GFG/change-bits.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 25) | class Solution { method changeBits (line 26) | static int[] changeBits(int N) { FILE: Check Mirror in N-ary tree.java class Solution (line 1) | class Solution { method checkMirrorTree (line 2) | static int checkMirrorTree(int n, int e, int[] A, int[] B) { FILE: Check Palindrome!.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(String s) { FILE: Chips Factory.java class Solution (line 1) | public class Solution { method solve (line 2) | public int[] solve(int[] A) { FILE: Chocolate_Distribution_Problem_gfg.cpp class Solution (line 5) | class Solution{ method findMinDiff (line 7) | long long findMinDiff(vector a, long long n, long long m){ FILE: Choose and Swap - GFG/choose-and-swap.java class GFG (line 9) | class GFG method main (line 11) | public static void main(String args[])throws IOException class Solution (line 34) | class Solution{ method chooseandswap (line 35) | String chooseandswap(String A){ FILE: Climbing Stairs.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(ArrayList A) { FILE: Clone Graph.java class Solution (line 1) | class Solution { method cloneGraph (line 3) | public Node cloneGraph(Node node) { method cloneGraph (line 19) | public Node cloneGraph(Node node) { class Solution (line 18) | class Solution { method cloneGraph (line 3) | public Node cloneGraph(Node node) { method cloneGraph (line 19) | public Node cloneGraph(Node node) { FILE: Closest Palindrome - GFG/closest-palindrome.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 27) | class Solution method closestPalindrome (line 29) | public long closestPalindrome(long num) method toPal (line 87) | private long toPal(String num, boolean isEven) method isPalindrome (line 97) | private boolean isPalindrome(String num) FILE: Coin Piles - GFG/coin-piles.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 32) | class Solution { method minSteps (line 33) | static int minSteps(int[] arr, int n, int k) { method findUpper (line 58) | static int findUpper(int[] arr , int target, int s , int e){ FILE: Coins of Geekland.java class Solution (line 1) | class Solution method Maximum_Sum (line 3) | public int Maximum_Sum(int mat[][],int N,int K){ method sum (line 13) | public int sum(int[][]arr,int row, int col, int k){ FILE: Combination Sum II.java class Solution (line 1) | public class Solution { method combinationSum (line 5) | public ArrayList> combinationSum(ArrayList... method dfs (line 13) | void dfs(int idx,ArrayList a,ArrayList curr,int sum){ FILE: Combination Sum.java class Solution (line 1) | public class Solution { method combinationSum (line 5) | public ArrayList> combinationSum(ArrayList... method dfs (line 13) | public void dfs(int sum,int index,ArrayList curr){ FILE: Combinations.java class Solution (line 1) | public class Solution { method combine (line 5) | public ArrayList> combine(int n, int k) { method dfs (line 12) | public void dfs(int curr,ArrayList curList){ FILE: Compare Version Numbers.java class Solution (line 1) | class Solution { method compareVersion (line 2) | public int compareVersion(String version1, String version2) { method compareVersion (line 20) | public int compareVersion(String version1, String version2) { class Solution (line 19) | public class Solution { method compareVersion (line 2) | public int compareVersion(String version1, String version2) { method compareVersion (line 20) | public int compareVersion(String version1, String version2) { FILE: Complete Binary Tree.java class GfG (line 1) | class GfG method isCompleteBT (line 3) | boolean isCompleteBT(Node root) FILE: Composite And Prime.java class Solution (line 5) | class Solution method isPrime (line 10) | public boolean isPrime(int a){ method Count (line 29) | public int Count(int l, int r) FILE: Composite and Prime gfg med s18.cpp class Solution (line 4) | class Solution { method isPrime (line 8) | void isPrime(int n){ method Count (line 24) | int Count(int L, int R){ function main (line 35) | int main(){ FILE: Composite and Prime.cpp class Solution (line 6) | class Solution { method Count (line 8) | int Count(int L, int R){ function main (line 36) | int main(){ FILE: Composite and Prime.java class Solution (line 1) | class Solution method Count (line 3) | public int Count(int L, int R) FILE: Composite and Prime.py class Solution (line 3) | class Solution: method Count (line 4) | def Count(self, l, r): FILE: Composite-and-prime.cpp class Solution (line 1) | class Solution{ method isPrime (line 3) | bool isPrime(int num){ method Count (line 12) | int Count(int L, int R){ FILE: Compute Before Matrix.java class Solution (line 1) | class Solution{ method computeBeforeMatrix (line 2) | public int[][] computeBeforeMatrix(int N, int M,int[][] after ){ FILE: Concatenate two numbers.java class Solution (line 1) | class Solution method countPairs (line 3) | long countPairs(int N, int X, int numbers[]) FILE: Connect Ropes.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(ArrayList A) { FILE: Consecutive Parent - Child.java class Solution (line 14) | public class Solution { method consecutiveNodes (line 15) | public int consecutiveNodes(TreeNode A) { FILE: Construct BST from Preorder.java class Solution (line 14) | public class Solution { method constructBST (line 16) | public TreeNode constructBST(int[] A) { method bstFromPreOrder (line 20) | public TreeNode bstFromPreOrder(int[] preorder ,int bound){ FILE: Construct Binary Tree From Inorder And Preorder.java class Solution (line 10) | public class Solution { method buildTree (line 14) | public TreeNode buildTree(ArrayList preorder, ArrayList int: FILE: Count Operations to Obtain Zero.java class Solution (line 1) | class Solution { method countOperations (line 2) | public int countOperations(int num1, int num2) { FILE: Count Palindromic Subsequence.cpp class Solution (line 5) | class Solution{ method ll (line 10) | ll solve(string& s,int i,int j,vector> &dp){ method ll (line 37) | ll countPS(string str) function main (line 52) | int main() FILE: Count Palindromic Subsequences.java class Solution (line 1) | class Solution method countPS (line 6) | long countPS(String str) method dfs (line 13) | long dfs(String s,int i,int j){ FILE: Count Smaller elements.java class Solution (line 1) | class Solution { method constructLowerArray (line 2) | int[] constructLowerArray(int[] a, int n) { method dfs (line 16) | int dfs(List arr,int key,int l,int h){ FILE: Count digit groupings of a number - GFG/count-digit-groupings-of-a-number.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 26) | class Solution{ method TotalCount (line 27) | public int TotalCount(String str){ method backtrack (line 38) | public int backtrack(String str, int currsum, int index, int[][]dp){ FILE: Count occurrences of a given word in a 2-d array(dynamic programming).cpp class Solution (line 1) | class Solution{ method solve (line 3) | void solve(int i, int j, vector > &mat, string target,int... method findOccurrence (line 20) | int findOccurrence(vector > &mat, string target){ FILE: Count occurrences of a given word in a 2-d array.cpp class Solution (line 1) | class Solution{ method isSafe (line 4) | bool isSafe(int i,int j,int m,int n,int x,vector> &mat,st... method solve (line 12) | void solve(int i,int j,int m,int n,int x,vector> &mat,str... method findOccurrence (line 39) | int findOccurrence(vector > &mat, string target){ FILE: Count occurrences of a given word in a 2-d array.java class Solution (line 1) | class Solution method findOccurrence (line 4) | public int findOccurrence(char mat[][], String target) method dfs (line 14) | void dfs(char[][]mat,int i,int j,String target,int idx){ FILE: Count occurrences of a given word in a 2-d array.py class Solution (line 1) | class Solution: method findOccurrence (line 2) | def findOccurrence(self,mat,target): FILE: Count pairs in array divisible by K - GFG/count-pairs-in-array-divisible-by-k.java class GFG (line 6) | class GFG method main (line 8) | public static void main (String[] args) throws IOException { class Solution (line 31) | class Solution method countKdivPairs (line 33) | public static long countKdivPairs(int arr[], int n, int k) FILE: Count possible ways to construct buildings - GFG/count-possible-ways-to-construct-buildings.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 27) | class Solution method TotalWays (line 29) | public int TotalWays(int N) FILE: Count subsequences of type a^i, b^j, c^k - GFG/count-subsequences-of-type-ai-bj-ck.java class GFG (line 7) | class GFG { method main (line 8) | public static void main (String[] args) { class Solution (line 29) | class Solution{ method fun (line 30) | public int fun(String s){ FILE: Count the paths - GFG/count-the-paths.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 37) | class Solution method possible_paths (line 42) | public int possible_paths(int[][] edges, int n, int s, int d) method dfs (line 57) | void dfs(int curr){ FILE: Count-occurrences-of-a-given-string-in-2d-array.cpp class Solution (line 2) | class Solution{ method dfs (line 6) | void dfs(int i, int j, vector> &mat, string target, int i... method findOccurrence (line 24) | int findOccurrence(vector > &mat, string target){ FILE: Count_occurences_of_a_given_word_in_a_2-d_array/Solution.java class Solution (line 1) | class Solution method isSafe (line 5) | boolean isSafe(char mat[][],int r,int c) method dfs (line 12) | public void dfs(char mat[][],int i,int r, int c,String target) method findOccurrence (line 34) | public int findOccurrence(char mat[][], String target) FILE: Counting Bits.java class Solution (line 1) | class Solution { method countBits (line 2) | public int[] countBits(int n) { FILE: Counts Zeros Xor Pairs - GFG/counts-zeros-xor-pairs.java class Array (line 18) | class Array { method main (line 21) | public static void main (String[] args) throws IOException{ class Complete (line 58) | class Complete{ method calculate (line 62) | public static long calculate (int arr[], int n) { FILE: Course Schedule - GFG/course-schedule.java class Main (line 8) | class Main { method main (line 9) | public static void main(String[] args) throws IOException { method check (line 48) | static boolean check(ArrayList> list, int V, int[] ... class Solution (line 63) | class Solution{ method findOrder (line 64) | static int[] findOrder(int n, int m, ArrayList> pre... FILE: Cousins of a given node.java class Solution (line 1) | class Solution method printCousins (line 3) | public static ArrayList printCousins(Node root, Node find) FILE: Covered-Uncovered Nodes.java class Solution (line 14) | public class Solution { method coveredNodes (line 15) | public Long coveredNodes(TreeNode A) { FILE: Create number of weak characters in game.java class Solution (line 1) | class Solution { method numberOfWeakCharacters (line 2) | public int numberOfWeakCharacters(int[][] properties) { FILE: Delete and Earn.java class Solution (line 1) | class Solution { method maxPoints (line 5) | private int maxPoints(int num) { method deleteAndEarn (line 25) | public int deleteAndEarn(int[] nums) { method deleteAndEarn (line 40) | public int deleteAndEarn(int[] nums) { class Solution (line 39) | class Solution { method maxPoints (line 5) | private int maxPoints(int num) { method deleteAndEarn (line 25) | public int deleteAndEarn(int[] nums) { method deleteAndEarn (line 40) | public int deleteAndEarn(int[] nums) { FILE: Delete nodes greater than k.java class Solution (line 1) | class Solution method deleteNode (line 3) | public Node deleteNode(Node root,int k) FILE: Deserialize.java class Solution (line 1) | public class Solution { method deserialize (line 2) | public ArrayList deserialize(String A) { FILE: Design Add and Search Words Data Structure.java class WordDictionary (line 1) | class WordDictionary { method WordDictionary (line 5) | public WordDictionary() { method addWord (line 11) | public void addWord(String word) { method search (line 22) | public boolean search(String word) { FILE: Design Bitset.java class Bitset (line 1) | class Bitset { method Bitset (line 5) | public Bitset(int size) { method fix (line 10) | public void fix(int idx) { method unfix (line 15) | public void unfix(int idx) { method flip (line 20) | public void flip() { method all (line 26) | public boolean all() { method one (line 30) | public boolean one() { method count (line 34) | public int count() { method toString (line 38) | public String toString() { FILE: Design Browser History/Design-Browser-History.cpp class BrowserHistory (line 2) | class BrowserHistory { method BrowserHistory (line 39) | BrowserHistory(string homepage) { method visit (line 43) | void visit(string url) { method string (line 49) | string back(int steps) { method string (line 55) | string forward(int steps) { FILE: Diagonal Traversal of Binary Tree - GFG/diagonal-traversal-of-binary-tree.java class Node (line 10) | class Node{ method Node (line 14) | Node(int data){ class GfG (line 20) | class GfG { method buildTree (line 22) | static Node buildTree(String str){ method printInorder (line 78) | static void printInorder(Node root) method main (line 89) | public static void main (String[] args) throws IOException{ class Tree (line 124) | class Tree method diagonal (line 126) | public ArrayList diagonal(Node root) FILE: Different Bits Sum Pairwise.java class Solution (line 1) | public class Solution { method cntBits (line 2) | public int cntBits(ArrayList A) { FILE: Diffk II.java class Solution (line 1) | public class Solution { method diffPossible (line 3) | public int diffPossible(final int[] A, int B) { FILE: Diffk.java class Solution (line 1) | public class Solution { method diffPossible (line 2) | public int diffPossible(int[] a, int k) { FILE: Digital Root.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A) { FILE: Dijkstra’s_Algorithm_Shortest_distance.cpp function dij (line 3) | void dij(vector> adj[], int n, int src) function main (line 35) | int main() FILE: Distance from the Source (Bellman-Ford Algorithm).java class Solution (line 3) | class Solution method bellman_ford (line 5) | static int[] bellman_ford(int V, ArrayList> adj, in... FILE: Distinct Numbers in Window.java class Solution (line 1) | public class Solution { method dNums (line 2) | public ArrayList dNums(ArrayList a, int B) { FILE: Distinct Subsequences.java class Solution (line 1) | public class Solution { method numDistinct (line 2) | public int numDistinct(String s1, String s2) { FILE: Distinct palindromic substrings.java class Solution (line 1) | class Solution { method palindromeSubStrs (line 2) | int palindromeSubStrs(String s) { FILE: Distribute in Circle!.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A, int B, int C) { FILE: Divisible by 60.java class Solution (line 1) | public class Solution { method divisibleBy60 (line 2) | public int divisibleBy60(ArrayList A) { FILE: Dungeon Princess.java class Solution (line 1) | public class Solution { method calculateMinimumHP (line 2) | public int calculateMinimumHP(int[][] A) { FILE: Earthquake and the Paint Shop - GFG/earthquake-and-the-paint-shop.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class alphanumeric (line 28) | class alphanumeric { method alphanumeric (line 31) | alphanumeric(String name, int count) { class Solution (line 36) | class Solution { method sortedStrings (line 37) | alphanumeric[] sortedStrings(int N, String A[]) { FILE: Egg Dropping Puzzle.java class Solution (line 1) | class Solution method eggDrop (line 5) | static int eggDrop(int n, int k) FILE: Elements in the Range.java class Solution (line 1) | class Solution method check_elements (line 3) | boolean check_elements(int arr[], int n, int A, int B) FILE: Equivalent Sub-Arrays - GFG/equivalent-sub-arrays.java class Solution (line 16) | class Solution method countDistinctSubarray (line 19) | static int countDistinctSubarray(int arr[], int n) class Array (line 53) | class Array { method main (line 56) | public static void main (String[] args) throws IOException{ FILE: Escape the Forbidden Forest.java class Sol (line 1) | class Sol method build_bridges (line 3) | public static int build_bridges(String str1 , String str2) FILE: Eulerian Path in an Undirected Graph - GFG/eulerian-path-in-an-undirected-graph.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 30) | class Solution{ method eulerPath (line 31) | static int eulerPath(int n, int arr[][]){ FILE: Evaluate Expression To True.java class Solution (line 1) | public class Solution { method cnttrue (line 7) | public int cnttrue(String A) { method solveTrue (line 13) | int solveTrue(String A, int i, int j){ method solveFalse (line 47) | int solveFalse(String A, int i, int j){ FILE: Evaluate Expression(Postfix).java class Solution (line 1) | public class Solution { method evalRPN (line 2) | public int evalRPN(String[] A) { FILE: Even and Odd - GFG/even-and-odd.java class GFG (line 5) | class GFG { method main (line 6) | public static void main(String args[]) throws IOException { method check (line 25) | static int check(int arr[], int n) class Solution (line 62) | class Solution { method reArrange (line 63) | static void reArrange(int arr[], int N) { FILE: Exactly one swap.java class Solution (line 1) | class Solution method countStrings (line 3) | long countStrings(String s) FILE: Excel Column Title.java class Solution (line 1) | public class Solution { method convertToTitle (line 2) | public String convertToTitle(int n) { FILE: Excel Sheet Column Number.java class Solution (line 1) | class Solution { method titleToNumber (line 2) | public int titleToNumber(String columnTitle) { method titleToNumber (line 14) | public int titleToNumber(String columnTitle) { class Solution (line 13) | class Solution { method titleToNumber (line 2) | public int titleToNumber(String columnTitle) { method titleToNumber (line 14) | public int titleToNumber(String columnTitle) { FILE: Exceptionally odd.java class Solution (line 2) | class Solution { method getOddOccurrence (line 3) | int getOddOccurrence(int[] arr, int n) { FILE: Fact Digit Sum.cpp class Solution (line 1) | class Solution{ method FactDigit (line 3) | vector FactDigit(int N) FILE: Fact Digit Sum.java class Solution (line 1) | class Solution method FactDigit (line 3) | ArrayList FactDigit(int N) FILE: Fact Digit Sum/Fact-Digit-Sum.cpp class Solution (line 1) | class Solution{ method factorial (line 3) | long factorial(long n){ method FactDigit (line 7) | vector FactDigit(int N) FILE: Farthest number - GFG/farthest-number.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 42) | class Solution method farNumber (line 44) | static int[] farNumber(int N, int a[]){ FILE: File Search.java class Solution (line 1) | public class Solution { method breakRecords (line 3) | public int breakRecords(int A, int[][] B) { class UnionFind (line 13) | class UnionFind { method UnionFind (line 19) | public UnionFind(int size) { method find (line 30) | public int find(int x) { method union (line 36) | public void union(int x, int y) { method getSets (line 53) | public int getSets() { FILE: Fill the Tank - GFG/fill-the-tank.java class GFG (line 5) | class GFG method main (line 7) | public static void main(String args[])throws IOException class Solution (line 38) | class Solution method minimum_amount (line 40) | long minimum_amount(int [][]Edges, int N, int S, int []cap) method ans (line 54) | long ans(ArrayList> adj, int s, int[] cap, boolean[... FILE: Filling Bucket - GFG/filling-bucket.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 25) | class Solution { method fillingBucket (line 26) | static int fillingBucket(int N) { FILE: Find All Anagrams in a String.java class Solution (line 1) | class Solution { method findAnagrams (line 2) | public List findAnagrams(String s, String p) { FILE: Find Last Digit.java class Solution (line 2) | public class Solution { method solve (line 3) | public int solve(String A, String B) { FILE: Find Missing And Repeating.java class Solve (line 1) | class Solve { method findTwoElement (line 2) | int[] findTwoElement(int arr[], int n) { FILE: Find Original Array From Doubled Array.java class Solution (line 1) | class Solution { method findOriginalArray (line 2) | public int[] findOriginalArray(int[] changed) { FILE: Find Prime numbers in a range.java class Solution (line 1) | class Solution { method primeRange (line 2) | ArrayList primeRange(int M, int N) { method isPrime (line 10) | boolean isPrime(int n){ FILE: Find Second Smallest and Second Largest Element in an array without sorting/Find-Second-Smallest-and-Second-Largest-Element-in-an-array-with-out-sorting.cpp function main (line 5) | int main() FILE: Find Three Consecutive Integers That Sum to a Given Number.py class Solution (line 1) | class Solution: method sumOfThree (line 2) | def sumOfThree(self, num: int) -> List[int]: FILE: Find Transition Point - GFG/find-transition-point.java class Sorted_Array (line 4) | class Sorted_Array { method main (line 5) | public static void main(String args[]) { class GfG (line 22) | class GfG { method transitionPoint (line 23) | int transitionPoint(int arr[], int n){ FILE: Find a peak element.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(ArrayList A) { FILE: Find all distinct subset (or subsequence) sums - GFG/Find all distinct subset (or subsequence) sums.cpp class Solution (line 5) | class Solution { method DistinctSum (line 9) | vector DistinctSum(vectornums){ method solve (line 19) | void solve(int sum, vector& nums, int n) { method DistinctSum (line 35) | vector DistinctSum(vector nums){ class Solution (line 33) | class Solution { method DistinctSum (line 9) | vector DistinctSum(vectornums){ method solve (line 19) | void solve(int sum, vector& nums, int n) { method DistinctSum (line 35) | vector DistinctSum(vector nums){ FILE: Find all distinct subset (or subsequence) sums.java class Solution (line 1) | class Solution method DistinctSum (line 3) | public int[] DistinctSum(int[] nums) method dfs (line 18) | void dfs(int[]nums,int i,int sum,Set set,boolean[][]dp){ FILE: Find all possible paths from top to bottom - GFG/find-all-possible-paths-from-top-to-bottom.java class IntArray (line 6) | class IntArray method input (line 8) | public static int[] input(BufferedReader br, int n) throws IOException method print (line 18) | public static void print(int[] a) method print (line 25) | public static void print(ArrayList a) class IntMatrix (line 34) | class IntMatrix method input (line 36) | public static int[][] input(BufferedReader br, int n, int m) throws IO... method print (line 51) | public static void print(int[][] m) method print (line 61) | public static void print(ArrayList> m) class GFG (line 72) | class GFG { method main (line 73) | public static void main(String[] args) throws IOException { class Solution (line 95) | class Solution { method findAllPossiblePaths (line 96) | public static ArrayList> findAllPossiblePaths(int n... method dfs (line 106) | static void dfs(ArrayList> ans,ArrayListcu... method valid (line 124) | static boolean valid(int i,int j,int[][]grid){ FILE: Find an Replace in String - GFG/find-an-replace-in-string.java class GFG (line 5) | class GFG { method main (line 6) | public static void main(String args[]) throws IOException { class Solution (line 38) | class Solution { method findAndReplace (line 39) | static String findAndReplace(String s, int q, int[] ind, String[] src,... FILE: Find length of Loop - GFG/find-length-of-loop.java class Node (line 8) | class Node method Node (line 13) | Node(int x) class GFG (line 20) | class GFG method makeLoop (line 22) | public static void makeLoop(Node head, Node tail, int x){ method main (line 32) | public static void main (String[] args){ class Solution (line 75) | class Solution method countNodesinLoop (line 78) | static int countNodesinLoop(Node head){ FILE: Find pairs with given sum in doubly linked list.cpp class Solution (line 1) | class Solution method findPairsWithGivenSum (line 4) | vector> findPairsWithGivenSum(Node *head, int target) FILE: Find pairs with given sum in doubly linked list.java class Solution (line 2) | class Solution { method findPairsWithGivenSum (line 3) | public static ArrayList> findPairsWithGivenSum(int ... FILE: Find rectangle with corners as 1.java class Solution (line 1) | public class Solution { method ValidCorner (line 2) | static boolean ValidCorner(int mat[][]) { FILE: Find the Difference.java class Solution (line 1) | class Solution { method findTheDifference (line 2) | public char findTheDifference(String s, String t) { FILE: Find the Maximum Flow - GFG/find-the-maximum-flow.java class GFG (line 5) | class GFG{ method main (line 6) | public static void main(String args[]) throws IOException { class Solution (line 35) | class Solution method bfs (line 37) | int bfs(int[][] g,int[] p,int source,int sink,int n){ method ford (line 63) | int ford(int[][] g,int source,int sink,int n){ method solve (line 80) | int solve(int N, int M, ArrayList> Edges) FILE: Find the nearest smaller number in left.cpp class Solution (line 3) | class Solution{ method leftSmaller (line 5) | vector leftSmaller(int n, int a[]){ FILE: Find the number of islands.java class axis (line 1) | class axis{ method axis (line 4) | public axis(int x,int y){ method equals (line 8) | @Override class Solution (line 18) | class Solution { method numIslands (line 20) | public int numIslands(char[][] grid) { method clearIsland (line 34) | public void clearIsland(char[][]grid,axis ax){ FILE: Find whether path exist - GFG/find-whether-path-exist.java class GFG (line 5) | class GFG method main (line 7) | public static void main(String[] args) throws IOException class Solution (line 34) | class Solution method is_Possible (line 38) | public boolean is_Possible(int[][] grid){ method bfs (line 52) | public void bfs(int[][]a,boolean[][]vis,int i,int j){ method valid (line 65) | public boolean valid(int[][]a,boolean[][]vis,int i,int j){ FILE: Find-Pattern/find_patter.java class GFG (line 3) | class GFG{ method findPattern (line 5) | public static int findPattern(String s, String p){ FILE: Finding Profession - GFG/finding-profession.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 28) | class Solution{ method countSetBits (line 29) | static int countSetBits(int n) method profession (line 39) | static char profession(int level, int pos){ FILE: Firing employees.java class Solution (line 1) | class Solution { method firingEmployees (line 2) | static int firingEmployees(int arr[], int n) { method dfs (line 15) | static int dfs(int[]arr,int ind,int[]dp){ method isPrime (line 22) | static boolean isPrime(int n) FILE: First Missing Integer.java class Solution (line 1) | public class Solution { method firstMissingPositive (line 2) | public int firstMissingPositive(ArrayList A) { FILE: First Repeating element.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(ArrayList A) { FILE: Flip.java class Solution (line 1) | public class Solution { method flip (line 2) | public ArrayList flip(String A) { FILE: Foldable Binary Tree.cpp function HEAD (line 1) | HEAD function checkMirror (line 31) | bool checkMirror(Node* root1, Node* root2) FILE: Foldable Binary Tree.java class Tree (line 1) | class Tree method IsFoldable (line 4) | boolean IsFoldable(Node node) method dfs (line 10) | boolean dfs(Node a,Node b){ FILE: Form a palindrome - GFG/form-a-palindrome.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String args[])throws IOException class Solution (line 26) | class Solution{ method find (line 28) | private static int find(int l, int r, String s){ method findMinInsertions (line 43) | int findMinInsertions(String S){ FILE: Form coils in a matrix - GFG/form-coils-in-a-matrix.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 33) | class Solution{ method formCoils (line 34) | static int[][] formCoils(int n){ FILE: Fraction Trouble - GFG/fraction-trouble.java class GFG (line 6) | class GFG method main (line 8) | public static void main(String[] args) throws IOException class Solution (line 31) | class Solution method numAndDen (line 33) | public int[] numAndDen(int n, int d) method gcdnumber (line 51) | static int gcdnumber(int a, int b) FILE: Fraction.java class Solution (line 1) | public class Solution { method fractionToDecimal (line 2) | public String fractionToDecimal(int numerator, int denominator) { FILE: Friends Pairing Problem DP.java class Solution (line 1) | class Solution method countFriendsPairings (line 3) | public long countFriendsPairings(int n) method helper (line 9) | long helper(int n,long[] dp,long mod){ FILE: Friends Pairing Problem.cpp class Solution (line 1) | class Solution method countFriendsPairings (line 8) | int countFriendsPairings(int n) FILE: Friends Pairing Problem.java class Solution (line 1) | class Solution method countFriendsPairings (line 3) | public long countFriendsPairings(int n) FILE: GFG/0 -1 Knapsack Problem/0 - 1 Knapsack Problem.java class Solution (line 1) | class Solution method myfunc (line 7) | static int myfunc(int w, int wt[], int val[], int n, int[][] ans){ method knapSack (line 16) | static int knapSack(int W, int wt[], int val[], int n) FILE: GFG/2D Hopscotch/2D Hopscotch.java class Solution (line 1) | class Solution{ method hopscotch (line 2) | static int hopscotch(int n, int m, int mat[][], int ty, int i, int j) method isValid (line 47) | static boolean isValid(int i,int j,int n,int m){ FILE: GFG/3 Divisors/3 Divisors.java class Solution (line 1) | class Solution{ method threeDivisors (line 2) | static ArrayList threeDivisors(ArrayList query, int qn){ FILE: GFG/A Game of LCM/A Game of LCM.java class Solution (line 2) | class Solution { method maxGcd (line 3) | long maxGcd(int N) { method solve (line 7) | long solve(int n){ method gcd (line 19) | long gcd(long a,long b){ FILE: GFG/A difference of values and indexes/A difference of values and indexes.java class Solution (line 1) | class Solution{ method maxDistance (line 5) | public static int maxDistance (int arr[], int n) { FILE: GFG/Absolute List Sorting/Absolute List Sorting.java class Solution (line 1) | class Solution method sortList (line 3) | Node sortList(Node head) { FILE: GFG/Absolute difference divisible by K/Absolute difference divisible by K.java class Solution (line 1) | class Solution { method countPairs (line 2) | static long countPairs(int n, int[] arr, int k) { FILE: GFG/Add Binary Strings/Add Binary Strings.java class Solution (line 1) | class Solution { method addBinary (line 2) | String addBinary(String A, String B) { FILE: GFG/Aggressive Cows/Aggressive Cows.java class Solution (line 1) | class Solution { method solve (line 2) | public static int solve(int n, int k, int[] stalls) { method isPossible (line 16) | static boolean isPossible(int k,int[]arr,int minDis){ FILE: GFG/Akku and Binary Numbers/Akku and Binary Numbers.java class Solution (line 1) | class Solution{ method precompute (line 3) | void precompute(){ method solve (line 6) | long solve(long L, long R){ FILE: GFG/Alex Travelling/Alex Travelling.cpp class Solution (line 1) | class Solution { method minimumCost (line 4) | int minimumCost(vector>& flights, int n, int k) { FILE: GFG/Alex Travelling/Alex Travelling.java class Solution (line 1) | class Solution { class Pair (line 2) | class Pair{ method Pair (line 5) | Pair(int n,int w){ method minimumCost (line 10) | int minimumCost(int[][] flights, int n, int k) { FILE: GFG/Alternate Vowel and Consonant String/Alternate Vowel and Consonant String.java class Solution (line 1) | class Solution{ method rearrange (line 2) | public String rearrange(String S, int N){ method rearrange (line 63) | public String rearrange(String S, int N){ method getRes (line 112) | public String getRes(int []f, int i, int j, StringBuilder sb) { method getNextVowel (line 146) | public int getNextVowel(int f[]) { method countVowels (line 154) | public int countVowels(String s, boolean isVowel) { class Solution (line 62) | class Solution{ method rearrange (line 2) | public String rearrange(String S, int N){ method rearrange (line 63) | public String rearrange(String S, int N){ method getRes (line 112) | public String getRes(int []f, int i, int j, StringBuilder sb) { method getNextVowel (line 146) | public int getNextVowel(int f[]) { method countVowels (line 154) | public int countVowels(String s, boolean isVowel) { FILE: GFG/Array Pair Sum Divisibility Problem/Array Pair Sum Divisibility Problem.java class Solution (line 1) | class Solution { method canPair (line 2) | public boolean canPair(int[] nums, int k) { FILE: GFG/Array Removals/Array Removals.cpp class Solution (line 1) | class Solution{ method removals (line 3) | int removals(vector& arr, int k){ FILE: GFG/Array Removals/Array Removals.java class Solution (line 1) | class Solution { method removals (line 2) | int removals(int[] arr, int n, int k) { FILE: GFG/Articulation Point - I/Articulation Point - I.java class Solution (line 1) | class Solution method articulationPoints (line 5) | public ArrayList articulationPoints(int V,ArrayList> adj,int[]pare... FILE: GFG/Asteroid Collision/Asteroid Collision.cpp class Solution (line 1) | class Solution { method asteroidCollision (line 3) | vector asteroidCollision(int N, vector &asteroids) { FILE: GFG/Asteroid Collision/Asteroid Collision.java class Solution (line 2) | class Solution { method asteroidCollision (line 3) | public static int[] asteroidCollision(int N, int[] arr) { FILE: GFG/Balanced string/Balanced string.java class Solution (line 1) | class Solution { method BalancedString (line 2) | static String BalancedString(int N) { FILE: GFG/Base Equivalance/Base Equivalence.java class Solution (line 20) | class Solution method baseEquiv (line 22) | String baseEquiv(int n, int m) method calculateDigits (line 36) | public int calculateDigits(int n, int m) { FILE: GFG/Base Equivalence/Base Equivalence.java class Solution (line 2) | class Solution method baseEquiv (line 4) | String baseEquiv(int n, int m) FILE: GFG/Binary Tree to DLL/Binary Tree to DLL.cpp function Node (line 8) | Node * bToDLL(Node *root) type Node (line 58) | struct Node type Node (line 59) | struct Node method Node (line 61) | Node(int x){ type Node (line 55) | struct Node type Node (line 58) | struct Node type Node (line 59) | struct Node method Node (line 61) | Node(int x){ class Solution (line 68) | class Solution method inorder (line 72) | void inorder(Node* root){ method Node (line 80) | Node * bToDLL(Node *root) FILE: GFG/Binary Tree to DLL/Binary Tree to DLL.java class Solution (line 1) | class Solution method bToDLL (line 4) | Node bToDLL(Node root) method dfs (line 10) | Node[] dfs(Node root){ method bToDLL (line 51) | Node bToDLL(Node root) method inorder (line 94) | public void inorder(Node root,ArrayList al){ class Solution (line 49) | class Solution method bToDLL (line 4) | Node bToDLL(Node root) method dfs (line 10) | Node[] dfs(Node root){ method bToDLL (line 51) | Node bToDLL(Node root) method inorder (line 94) | public void inorder(Node root,ArrayList al){ FILE: GFG/Black and White/Black and White.java class BlackAndWhite (line 1) | class BlackAndWhite method numOfWays (line 5) | static long numOfWays(int N, int M) method valid (line 24) | static boolean valid(int i,int j,int n,int m){ FILE: GFG/Break a number/Break a number.java class Solution (line 1) | class Solution{ method waysToBreakNumber (line 2) | int waysToBreakNumber(int N){ FILE: GFG/Build the smallest/Build the smallest.java class Solution (line 1) | class Solution { method buildLowestNumber (line 2) | static String buildLowestNumber(String str, int k) { FILE: GFG/Burst Balloons/Burst Balloons.java class Solution (line 1) | class Solution { method maxCoins (line 3) | public static int maxCoins(int N, int[] arr) { method dfs (line 14) | static int dfs(int l,int r,int[]arr){ FILE: GFG/Check for BST/Check for BST.java class Solution (line 1) | public class Solution method isBST (line 4) | boolean isBST(Node root, int minValue, int maxValue) { method isBST (line 9) | boolean isBST(Node root) FILE: GFG/Check if all levels of two trees are anagrams or not/Check if all levels of two trees are anagrams or not.java class Solution (line 1) | class Solution { method areAnagrams (line 2) | public static boolean areAnagrams(Node node1, Node node2) { FILE: GFG/Check if it is possible to convert one string into another with given constraints/Check if it is possible to convert one string into another with given constraints.java class Solution (line 1) | class Solution { method isItPossible (line 2) | int isItPossible(String S, String T, int M, int N) { FILE: GFG/Chicks in a Zoo/Chicks in a Zoo.cpp class solution (line 1) | class solution{ method NoOfChicks (line 3) | long long int NoOfChicks(int n){ FILE: GFG/Chicks in a Zoo/Chicks in a Zoo.java class Solution (line 1) | class Solution method NoOfChicks (line 3) | public long NoOfChicks(int N) FILE: GFG/Complement/Complement.java class Solve (line 4) | class Solve { method findRange (line 6) | Vector findRange(String str, int n) { FILE: GFG/Construct Binary Tree from String with bracket representation/Construct Binary Tree from String with bracket representation.cpp class Solution (line 1) | class Solution{ method Node (line 4) | Node* solve(string str) method Node (line 54) | Node *treeFromString(string str){ FILE: GFG/Construct Binary Tree from String with bracket representation/Construct Binary Tree from String with bracket representation.java class Solution (line 1) | class Solution { method treeFromString (line 2) | public static Node treeFromString(String s) { method dfs (line 7) | static Node dfs(int[] idx,String s){ FILE: GFG/Container With Most Water/Container With Most Water.cpp function maxArea (line 1) | long long maxArea(long long A[], int len) FILE: GFG/Container With Most Water/Container With Most Water.java class Solve (line 2) | class Solve{ method maxArea (line 4) | long maxArea(int A[], int len){ FILE: GFG/Count Lucky Permutations/Count Lucky Permutations.java class Solution (line 5) | class Solution { method luckyPermutations (line 6) | long luckyPermutations(int N, int M, int arr[], int[][] graph) { FILE: GFG/Count all possible paths from top left to bottom right/Count all possible paths from top left to bottom right oc4.cpp class Solution (line 3) | class Solution { method mem (line 6) | long long int mem(int i, int j, int m, int n, vector countEleLessThanOrEqual(int arr1[], int arr2[], int m, int n) FILE: GFG/Counting Elements in Two Arrays/Counting Elements in Two Arrays.java class Solution (line 1) | class Solution method countEleLessThanOrEqual (line 3) | public static ArrayList countEleLessThanOrEqual(int arr1[], i... method binarySearch (line 13) | static int binarySearch(int[]arr,int target,int i,int j){ FILE: GFG/Counting Elements in Two Arrays/Counting Elements in Two Arrays.py class Solution (line 2) | class Solution: method countEleLessThanOrEqual (line 3) | def countEleLessThanOrEqual(self,arr1,n1,arr2,n2): FILE: GFG/Cycle in Directed Graph/Cycle in Directed Graph.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int vtces, ArrayList> B) { method isCycle (line 26) | public static boolean isCycle(ArrayList [] graph,int src,boolean... class Edge (line 41) | class Edge{ method Edge (line 44) | Edge(int src,int nbr){ FILE: GFG/Cycle in Undirected Graph/Cycle in Undirected Graph.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A, ArrayList> B) { method dfs (line 19) | public boolean dfs(ArrayList> adj, boolean vis[],in... FILE: GFG/Decode the string/Decode the string.cpp class Solution (line 1) | class Solution{ method string (line 3) | string decodedString(string s){ FILE: GFG/Decode the string/Decode the string.java class Solution (line 1) | class Solution{ method decodedString (line 2) | static String decodedString(String s){ method decodedString (line 49) | static String decodedString(String s){ class Solution (line 48) | class Solution{ method decodedString (line 2) | static String decodedString(String s){ method decodedString (line 49) | static String decodedString(String s){ FILE: GFG/Distance of nearest cell having 1/Distance of nearest cell having 1.java class Solution (line 1) | class Solution method nearest (line 4) | public int[][] nearest(int[][] grid) FILE: GFG/Earthquake and the Paint Shop/Earthquake and the Paint Shop.cpp type alphanumeric (line 1) | struct alphanumeric { class Solution (line 5) | class Solution { method sortedStrings (line 7) | vector sortedStrings(int N, vector A) { FILE: GFG/Enemy/Enemy.cpp class Solution (line 1) | class Solution method largestArea (line 4) | int largestArea(int n,int m,int k,vector> &enemy) FILE: GFG/Enemy/Enemy.java class Solution (line 1) | class Solution { method largestArea (line 2) | public static int largestArea(int n,int m,int k,int[][] enemy) { FILE: GFG/Fill up buckets/Fill up buckets.cpp class Solution (line 8) | class Solution{ method totalWays (line 10) | int totalWays(int n, vectorcapacity) { FILE: GFG/Fill up buckets/Fill up buckets.java class Solution (line 1) | class Solution{ method totalWays (line 2) | public int totalWays(int n, int[] arr) { FILE: GFG/Filling Bucket/Filling Bucket.cpp class Solution (line 1) | class Solution { method fillingBucket (line 3) | int fillingBucket(int N) { FILE: GFG/Filling Bucket/Filling Bucket.java class Solution (line 1) | class Solution { method fillingBucket (line 2) | static int fillingBucket(int N) { FILE: GFG/Find The Safe Position/Find The Safe Position s30.cpp class Solution (line 3) | class Solution { method safePos (line 5) | int safePos(int n, int k) { function main (line 12) | int main() { FILE: GFG/Find The Safe Position/Find the Safe Position.java class Solution (line 1) | class Solution { method safePos (line 2) | static int safePos(int n, int k) { FILE: GFG/Find minimum number of Laptops required/Find minimum number of Laptops required.cpp class Solution (line 1) | class Solution { method minLaptops (line 3) | int minLaptops(int N, int start[], int end[]) { FILE: GFG/Find minimum number of Laptops required/Find minimum number of Laptops required.java class Solution (line 5) | class Solution { method minLaptops (line 6) | public int minLaptops(int n, int[] start, int[] end) { FILE: GFG/Find patterns/Find patterns.cpp class Solution (line 1) | class Solution{ method numberOfSubsequences (line 3) | int numberOfSubsequences(string S, string W){ FILE: GFG/Find patterns/Find patterns.java class Solution (line 1) | class Solution{ method numberOfSubsequences (line 2) | static int numberOfSubsequences(String S, String W){ FILE: GFG/Find the N-th character/Find the N-th character.cpp class Solution (line 1) | class Solution{ method nthCharacter (line 3) | char nthCharacter(string S, int R, int N) { FILE: GFG/Find the first node of loop in linked list/Find the first node of loop in linked list.java class Solution (line 1) | class Solution { method findFirstNode (line 3) | public static int findFirstNode(Node head){ FILE: GFG/Find the longest string/Find the longest string.java class TrieNode (line 1) | class TrieNode{ method TrieNode (line 4) | TrieNode(){ class Solution (line 11) | class Solution { method longestString (line 13) | public static String longestString(int n, String[] arr) { method isPresent (line 39) | static boolean isPresent(String s){ method insert (line 49) | static void insert(String s){ FILE: GFG/Find the maximum GCD of the siblings of a Binary Tree/Find the maximum GCD of the siblings of a Binary Tree.java class Solution (line 1) | class Solution { method maxGCD (line 4) | int maxGCD(Node root) { method dfs (line 11) | int dfs(Node root){ method gcd (line 26) | int gcd(int a,int b){ FILE: GFG/Fitting The Array/Fitting The Array s28.cpp class Solution (line 3) | class Solution{ method isFit (line 6) | bool isFit(int arr[], int brr[], int n){ function main (line 18) | int main() FILE: GFG/Fitting The Array/Fitting The Array.cpp class Solution (line 1) | class Solution{ method isFit (line 4) | bool isFit(int arr[], int brr[], int n){ FILE: GFG/Fitting The Array/Fitting The Array.java class Solution (line 1) | class Solution{ method isFit (line 5) | public static boolean isFit (int arr[], int brr[], int n) { FILE: GFG/Flatten binary tree to linked list/Flatten binary tree to linked list.java class Solution (line 1) | class Solution method flatten (line 4) | public static void flatten(Node root) method dfs (line 10) | static void dfs(Node root){ FILE: GFG/Flattening a Linked List/Flattening a Linked List.java class GfG (line 1) | class GfG method flatten (line 3) | Node flatten(Node root) method merge (line 15) | Node merge(Node l1,Node l2){ FILE: GFG/Floyd Warshall/Floyd Warshall.java class Solution (line 1) | class Solution method shortest_distance (line 3) | public void shortest_distance(int[][] mat) FILE: GFG/Floyd Warshall/FloydWarshall.cpp class Solution (line 1) | class Solution { FILE: GFG/Form a palindrome/Form a palindrome.py class Solution (line 3) | class Solution: method countMin (line 4) | def countMin(self, Str): FILE: GFG/GCD Array/GCD Array.java class Solution (line 1) | class Solution { method solve (line 2) | public static int solve(int N, int K, int[] arr) { FILE: GFG/Geek and Number String/Geek and Number Str.cpp function minLength (line 1) | int minLength(string s, int n) { FILE: GFG/Geek and Strings/Geek and Strings.java class Solution (line 1) | class Solution{ class Trie (line 2) | static class Trie { method prefixCount (line 6) | static List prefixCount(int N, int Q, String li[], String que... FILE: GFG/Geek in a Maze/Geek in a maze.java class Pair (line 9) | class Pair method Pair (line 13) | Pair(int x, int y, int u_left, int d_left) class Solution (line 23) | class Solution method isValid (line 26) | private static boolean isValid(int x, int y, boolean visited[][], char... method numberOfCells (line 33) | public static int numberOfCells(int n, int m, int r, int c, int u, int... class GFG (line 91) | public class GFG { method main (line 92) | public static void main (String[] args) { FILE: GFG/Grouping Of Numbers/Grouping Of Numbers.java class Solution (line 1) | class Solution { method maxGroupSize (line 2) | static int maxGroupSize(int[] a, int N, int k) { method maxGroupSize (line 31) | static int maxGroupSize(int[] arr, int N, int K) { class Solution (line 30) | class Solution { method maxGroupSize (line 2) | static int maxGroupSize(int[] a, int N, int k) { method maxGroupSize (line 31) | static int maxGroupSize(int[] arr, int N, int K) { FILE: GFG/Hamiltonian Path/Hamiltonian Path.java class Solution (line 1) | class Solution method check (line 4) | boolean check(int N, int M, ArrayList> Edges) method dfs (line 26) | boolean dfs(int curr,Set set,Map> ... FILE: GFG/Help Ishaan/Help Ishaan.cpp function NthTerm (line 25) | int NthTerm(int N){ FILE: GFG/Help Ishaan/Help Ishaan.java class Solution (line 1) | class Solution method isPrime (line 3) | public static boolean isPrime(int n){ method NthTerm (line 23) | public int NthTerm(int n) method isPrime (line 55) | public static boolean isPrime(int num){ method NthTerm (line 66) | public int NthTerm(int n) class Solution (line 53) | class Solution method isPrime (line 3) | public static boolean isPrime(int n){ method NthTerm (line 23) | public int NthTerm(int n) method isPrime (line 55) | public static boolean isPrime(int num){ method NthTerm (line 66) | public int NthTerm(int n) FILE: GFG/Help a Thief/Help a thief.cpp class Solution (line 10) | class Solution method maxCoins (line 13) | int maxCoins(int A[], int B[], int T, int N) function main (line 38) | int main() { FILE: GFG/Help the Old Man/Help the old man.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 25) | class Solution{ method hanoi (line 26) | public static void hanoi(int N,int A,int B,int C,ArrayList shiftPile(int N, int n){ FILE: GFG/Hungry Pizza Lovers/Hungry pizza lovers.java class Array (line 12) | class Array { method main (line 15) | public static void main (String[] args) throws IOException{ class Complete (line 51) | class Complete{ method permute (line 55) | public static ArrayList permute (int arr[][], int n) { FILE: GFG/IPL 2021 - Match Day 2/IPL 2021 - Match Day 2 gfg med s22.cpp class Solution (line 4) | class Solution { method max_of_subarrays (line 6) | vector max_of_subarrays(vector arr, int n, int k) { function main (line 23) | int main() { FILE: GFG/IPL/IPL.cpp function max_of_subarrays (line 1) | vector max_of_subarrays(vector arr, int n, int k) { FILE: GFG/Ishaan Loves Chocolates/Ishaan loves chocolates.py function chocolates (line 3) | def chocolates (arr, n): FILE: GFG/Josephus problem/Josephus problem.java class Solution (line 1) | class Solution method josephus (line 3) | public int josephus(int n, int k) FILE: GFG/Jump Game/Jump game.java class GFG (line 5) | class GFG { method main (line 6) | public static void main(String args[]) throws IOException { class Solution (line 29) | class Solution { method canReach (line 30) | static int canReach(int A[], int N) { FILE: GFG/Jumping Numbers/Jumping Numbers.cpp class Solution (line 1) | class Solution { method jumpingNums (line 3) | long long jumpingNums(long long x) { FILE: GFG/Knight Walk/Knight Walk.cpp class Solution (line 6) | class Solution { method minStepToReachTarget (line 8) | int minStepToReachTarget(vector&KnightPos, vector&TargetPos,... method isValid (line 60) | bool isValid(int r, int c, int n){ method minStepToReachTarget (line 64) | int minStepToReachTarget(vector&KnightPos, vector&TargetPos,... class Solution (line 58) | class Solution { method minStepToReachTarget (line 8) | int minStepToReachTarget(vector&KnightPos, vector&TargetPos,... method isValid (line 60) | bool isValid(int r, int c, int n){ method minStepToReachTarget (line 64) | int minStepToReachTarget(vector&KnightPos, vector&TargetPos,... FILE: GFG/Knight Walk/Knight Walk.java class Pair (line 1) | class Pair{ method Pair (line 5) | Pair(int i,int j,int d){ class Solution (line 11) | class Solution method minStepToReachTarget (line 13) | public int minStepToReachTarget(int KnightPos[], int TargetPos[], int N) method isValid (line 41) | boolean isValid(int i,int j,boolean[][]vis,int N){ FILE: GFG/Kth smallest element/Kth smallest element.py class Solution (line 4) | class Solution: method kthSmallest (line 5) | def kthSmallest(self,arr, l, r, k): FILE: GFG/LCM Triplet/LCM Triplet.java class Solution (line 1) | class Solution { method lcmTriplets (line 2) | long lcmTriplets(long N) { FILE: GFG/Largest subtree sum in a tree/Largest subtree sum in a tree.cpp class Solution (line 1) | class Solution { method subtree (line 3) | int subtree(Node* root, int& ans){ method findLargestSubtreeSum (line 13) | int findLargestSubtreeSum(Node* root){ FILE: GFG/Largest subtree sum in a tree/Largest subtree sum in a tree.java class Solution (line 1) | class Solution { method findLargestSubtreeSum (line 3) | public static int findLargestSubtreeSum(Node root) { method dfs (line 9) | static int dfs(Node root){ FILE: GFG/Last modified ball/Last modified ball.java class Solution (line 1) | class Solution { method solve (line 2) | int solve(int N, int[] A) { FILE: GFG/Longest Bitonic subsequence/Longest Bitonic subsequence.java class Solution (line 1) | class Solution method LongestBitonicSequence (line 3) | public int LongestBitonicSequence(int[] nums) FILE: GFG/Longest Perfect Piece/Longest Perfect Piece.java class Solution (line 1) | class Solution { method longestPerfectPiece (line 2) | static int longestPerfectPiece(int[] arr, int N) { FILE: GFG/Magic Triplets/Magic Triplets.java class Solution (line 1) | class Solution{ method countTriplets (line 2) | public int countTriplets(int[] nums){ FILE: GFG/Majority Element/Majority Element.java class Solution (line 3) | class Solution { method majorityElement (line 4) | public int majorityElement(int[] nums) { method majorityElement (line 24) | public int majorityElement(int[] nums) { method recurse (line 28) | public int recurse(int[] nums, int start){ method majorityElement (line 48) | public int majorityElement(int[] nums) { class Solution (line 22) | class Solution { method majorityElement (line 4) | public int majorityElement(int[] nums) { method majorityElement (line 24) | public int majorityElement(int[] nums) { method recurse (line 28) | public int recurse(int[] nums, int start){ method majorityElement (line 48) | public int majorityElement(int[] nums) { class Solution (line 47) | class Solution { method majorityElement (line 4) | public int majorityElement(int[] nums) { method majorityElement (line 24) | public int majorityElement(int[] nums) { method recurse (line 28) | public int recurse(int[] nums, int start){ method majorityElement (line 48) | public int majorityElement(int[] nums) { FILE: GFG/Majority Element/Majority Element.py class Solution (line 4) | class Solution: method majorityElement (line 5) | def majorityElement(self, arr, n): FILE: GFG/Make array elements unique/Make array elements unique.java class Solution (line 1) | class Solution { method minIncrements (line 2) | public long minIncrements(int[] arr, int N) { FILE: GFG/Max Min/Max Min.cpp class Solution (line 1) | class Solution method findSum (line 4) | int findSum(int A[], int N) FILE: GFG/Max Min/Max Min.java class Solution (line 2) | class Solution method findSum (line 4) | public static int findSum(int A[],int N) FILE: GFG/Max Min/Max Min.py class Solution (line 1) | class Solution: method findSum (line 2) | def findSum(self,A,N): FILE: GFG/Maximize the sum of selected numbers from an array to make it empty/Maximize the sum of selected numbers from a sorted array to make it empty.cpp class Solution (line 1) | class Solution{ method maximizeSum (line 3) | int maximizeSum(int a[], int n) FILE: GFG/Maximize the sum of selected numbers from an array to make it empty/Maximize the sum of selected numbers from an array to make it empty.java class Complete (line 1) | class Complete{ method maximizeSum (line 5) | public static int maximizeSum (int arr[], int n) { FILE: GFG/Maximum Number of Toys/Maximum Number of Toys.java class Pair (line 3) | class Pair{ method Pair (line 6) | public Pair(K a,V b){ method getCost (line 10) | public K getCost(){ method getIndex (line 13) | public V getIndex(){ class Solution (line 19) | class Solution { method maximumToys (line 20) | ArrayList maximumToys(int N, int A[], FILE: GFG/Maximum Profit By Choosing A Subset Of Intervals/Maximum Profit By Choosing A Subset Of Intervals.java class Solution (line 1) | class Solution { method maximum_profit (line 2) | public static int maximum_profit(int n, int[][] arr) { method rec (line 11) | static int rec(int index,int[][]arr,int n,int[]dp){ method findNext (line 19) | static int findNext(int i,int prevEnd,int[][]arr,int n){ FILE: GFG/Maximum Sub Array/Maximum Sub Array.java class Solution (line 1) | class Solution { method findSubarray (line 3) | ArrayList findSubarray(int a[], int n) { FILE: GFG/Maximum Sub-String after at most K changes/Maximum Sub-String after at most K changes.cpp class Solution (line 1) | class Solution { method characterReplacement (line 3) | int characterReplacement(string s, int k){ FILE: GFG/Maximum Sub-String after at most K changes/Maximum Sub-String after at most K changes.java class Solution (line 1) | class Solution method characterReplacement (line 3) | public int characterReplacement(String s, int k) method find (line 21) | int find(int[]arr,int k){ FILE: GFG/Maximum Sum LCM/Maximum Sum LCM.java class Solution (line 2) | class Solution { method maxSumLCM (line 3) | static long maxSumLCM(int n) { FILE: GFG/Maximum Value/Maximum Value.java class Solution (line 1) | class Solution { method maximumValue (line 2) | ArrayList maximumValue(Node node) { FILE: GFG/Maximum of all subarrays of size k/Maximum of all subarrays of size k.java class Solution (line 1) | class Solution method max_of_subarrays (line 4) | static ArrayList max_of_subarrays(int arr[], int n, int k) FILE: GFG/Median in a row-wise sorted Matrix/Median in a row-wise sorted Matrix.java class Solution (line 1) | class Solution { method median (line 2) | int median(int matrix[][], int R, int C) { FILE: GFG/Merge Sort/Merge Sort.java class Solution (line 3) | class Solution method merge (line 5) | void merge(int arr[], int l, int m, int r) method mergeSort (line 29) | void mergeSort(int arr[], int l, int r) FILE: GFG/Merge two BST 's/Merge two BST.cpp class Solution (line 4) | class Solution method inorder1 (line 9) | void inorder1(Node* root, vector &v1){ method inorder2 (line 18) | void inorder2(Node* root, vector &v1){ method merge (line 25) | vector merge(Node *root1, Node *root2) FILE: GFG/Min operations/Min operations.java class Solution (line 1) | class Solution { method solve (line 3) | public static int solve(int a, int b) { FILE: GFG/Minimize number of Students to be removed/Minimize number of Students to be removed.java class Solution (line 1) | class Solution { method removeStudents (line 2) | public int removeStudents(int[] H, int n) { method binarySearch (line 15) | int binarySearch(int ele,ArrayList arr){ FILE: GFG/Minimize the sum/Minimize the sum.java class Solution (line 1) | class Solution { method minimizeSum (line 2) | long minimizeSum(int N, int arr[]) { FILE: GFG/Minimum Cost of ropes/Minimum Cost of ropes.java class Solution (line 1) | class Solution method minCost (line 4) | long minCost(long arr[], int n) FILE: GFG/Minimum Costs of Ropes/Minimum Costs of Ropes.cpp class Solution (line 4) | class Solution method minCost (line 8) | long long minCost(long long arr[], long long n) { function main (line 33) | int main() { FILE: GFG/Minimum characters to be added at front to make string palindrome/Minimum characters to be added at front to make string palindrome oc2.cpp class Solution (line 3) | class Solution { method minChar (line 5) | int minChar(string str){ function main (line 23) | int main() FILE: GFG/Minimum characters to be added at front to make string palindrome/Minimum characters to be added at front to make string palindrome.cpp class Solution (line 1) | class Solution { method minChar (line 3) | int minChar(string str){ FILE: GFG/Minimum characters to be added at front to make string palindrome/Minimum characters to be added at front to make string palindrome.java class Solution (line 1) | class Solution { method minChar (line 2) | public static int minChar(String str) { FILE: GFG/Minimum characters to be added at front to make string palindrome/Minimum characters to be added at front to make string palindrome.py class Solution (line 1) | class Solution: method minChar (line 2) | def minChar(self,str): FILE: GFG/Minimum number of Coins/Minimum number of Coins.cpp class Solution (line 1) | class Solution{ method minPartition (line 3) | vector minPartition(int N) FILE: GFG/Minimum number of Coins/Minimum number of Coins.java class Solution (line 1) | class Solution{ method minPartition (line 2) | static List minPartition(int N) FILE: GFG/Minimum sum partition/Minimum sum partition.java class Solution (line 1) | class Solution method minDifference (line 4) | public int minDifference(int arr[], int n) method dfs (line 10) | public int dfs(int[]arr,int n,int s1,int s2,Map map){ FILE: GFG/Missing number in matrix.java/Missing number in matrix.java class Solution (line 1) | class Solution method MissingNo (line 3) | public long MissingNo(int[][] mat) FILE: GFG/Modified Numbers and Queries/Modified Numbers And Queries.java class Solution (line 1) | class Solution method sumOfAll (line 3) | public int sumOfAll(int l, int r) FILE: GFG/Modified Numbers and Queries/Modified Numbers and Queries oc3.cpp class Solution (line 4) | class Solution { method Sieve (line 5) | void Sieve(vector &Primes, int n){ method sumOfAll (line 13) | int sumOfAll(int l, int r){ function main (line 23) | int main() { FILE: GFG/Modified Numbers and Queries/Modified Numbers and Queries.py class Solution (line 1) | class Solution: method sumOfAll (line 2) | def sumOfAll(self, l, r): FILE: GFG/Move Last Element to Front of a Linked List/Move Last Element to Front of a Linked List 2 different approaches.java class Solution (line 10) | class Solution { method moveToFront (line 11) | public static Node moveToFront(Node head) { method moveToFront (line 53) | public static Node moveToFront(Node head) { class Solution (line 52) | class Solution { method moveToFront (line 11) | public static Node moveToFront(Node head) { method moveToFront (line 53) | public static Node moveToFront(Node head) { FILE: GFG/Move Last Element to Front of a Linked List/Move Last Element to Front of a Linked List.cpp class Solution (line 1) | class Solution{ method ListNode (line 3) | ListNode *moveToFront(ListNode *head){ FILE: GFG/Move Last Element to Front of a Linked List/Move Last Element to Front of a Linked List.java class Solution (line 1) | class Solution { method moveToFront (line 2) | public static Node moveToFront(Node head) { FILE: GFG/Next Greater Element/Next Greater Element.java class Solution (line 1) | class Solution{ method nextLargerElement (line 2) | public static long[] nextLargerElement(long[] arr, int n) { FILE: GFG/Next Happy Number/Next Happy Number.java class Solution (line 1) | class Solution{ method nextHappy (line 3) | static int nextHappy(int N){ method isHappyNumber (line 14) | public static boolean isHappyNumber(int n, ArrayList ar) method findSquareNumber (line 29) | public static int findSquareNumber(int n) FILE: GFG/Nine Divisors/Nine Divisors.cpp class Solution (line 1) | class Solution{ method nineDivisors (line 3) | long long int nineDivisors(long long int N){ FILE: GFG/Nine Divisors/Nine Divisors.java class Solution (line 1) | class Solution{ method nineDivisors (line 2) | static long nineDivisors(long N){ FILE: GFG/Number Formation/Number Formation.cpp class Solution (line 1) | class Solution { method getSum (line 7) | int getSum(int X, int Y, int Z) { FILE: GFG/Number Formation/Number Formation.java class Solution (line 1) | class Solution { method getSum (line 3) | public int getSum(int X, int Y, int Z) { FILE: GFG/Number Of Islands/Number Of Islands.cpp class Solution (line 1) | class Solution { method dfs (line 6) | void dfs(vector>&v,int l,int i,int j,int n,int m){ method numOfIslands (line 36) | vector numOfIslands(int n, int m, vector> &operators) { FILE: GFG/Number Of Islands/Number Of Islands.java class UnionFind (line 1) | class UnionFind{ method UnionFind (line 4) | UnionFind(int row,int col){ method union (line 11) | void union(int x,int y){ method findParent (line 16) | int findParent(int x){ method count (line 20) | int count(int [][]mat){ class Solution (line 36) | class Solution { method numOfIslands (line 38) | public List numOfIslands(int rows, int cols, int[][] operator... FILE: GFG/Number Of Open Doors/Number Of Open Doors.java class Solution (line 1) | class Solution { method noOfOpenDoors (line 2) | static int noOfOpenDoors(Long N) { FILE: GFG/Number of Distinct Islands/Number of Distinct Islands oct1.cpp class Solution (line 4) | class Solution { method dfs (line 6) | void dfs(vector>& grid, int i, int j, int xi, int xj, int ... method countDistinctIslands (line 17) | int countDistinctIslands(vector>& grid) { method dfs (line 62) | void dfs(int i,int j,int r,int c,vector> &vis, vector>& grid) { function main (line 33) | int main() { class Solution (line 60) | class Solution { method dfs (line 6) | void dfs(vector>& grid, int i, int j, int xi, int xj, int ... method countDistinctIslands (line 17) | int countDistinctIslands(vector>& grid) { method dfs (line 62) | void dfs(int i,int j,int r,int c,vector> &vis, vector>& grid) { FILE: GFG/Number of Distinct Islands/Number of Distinct Islands.py class Solution (line 2) | class Solution: method countDistinctIslands (line 4) | def countDistinctIslands(self, grid : List[List[int]]) -> int: FILE: GFG/Number of turns in binary tree/Number of turns in binary tree.cpp class Solution (line 7) | class Solution{ method NumberOFTurns (line 11) | int NumberOFTurns(struct Node* root, int first, int second) method Node (line 28) | Node* lca(Node* root ,int n1 ,int n2 ) method countTurns (line 55) | int countTurns(Node* root, int n, char d) method traverseHelper (line 89) | void traverseHelper(Node* root, int first, int second, vector &F... method NumberOFTurns (line 112) | int NumberOFTurns(struct Node* root, int first, int second) class Solution (line 87) | class Solution{ method NumberOFTurns (line 11) | int NumberOFTurns(struct Node* root, int first, int second) method Node (line 28) | Node* lca(Node* root ,int n1 ,int n2 ) method countTurns (line 55) | int countTurns(Node* root, int n, char d) method traverseHelper (line 89) | void traverseHelper(Node* root, int first, int second, vector &F... method NumberOFTurns (line 112) | int NumberOFTurns(struct Node* root, int first, int second) FILE: GFG/Number of turns in binary tree/Number of turns in binary tree.java class Solution (line 5) | class Solution method NumberOfTurns (line 8) | static int NumberOfTurns(Node root, int first, int second) method findCount (line 30) | static boolean findCount(Node node,boolean left,int key){ method findLCA (line 54) | static Node findLCA(Node root,int first,int second){ method NumberOfTurns (line 78) | static int NumberOfTurns(Node root, int first, int second) method solve (line 94) | static boolean solve(Node root,int x,Boolean left){ method lca (line 121) | static Node lca(Node root, int n1,int n2) class Solution (line 75) | class Solution method NumberOfTurns (line 8) | static int NumberOfTurns(Node root, int first, int second) method findCount (line 30) | static boolean findCount(Node node,boolean left,int key){ method findLCA (line 54) | static Node findLCA(Node root,int first,int second){ method NumberOfTurns (line 78) | static int NumberOfTurns(Node root, int first, int second) method solve (line 94) | static boolean solve(Node root,int x,Boolean left){ method lca (line 121) | static Node lca(Node root, int n1,int n2) FILE: GFG/Phone directory/Phone directory.cpp class Solution (line 1) | class Solution{ method displayContacts (line 3) | vector> displayContacts(int n, string contact[], string s) FILE: GFG/Phone directory/Phone directory.java class Trie (line 1) | class Trie{ method Trie (line 4) | Trie(){ class Solution (line 11) | class Solution{ method displayContacts (line 12) | static ArrayList> displayContacts(int n, class Trie (line 63) | static class Trie { method displayContacts (line 67) | static ArrayList> displayContacts(int n, method findAllPrefixes (line 121) | public static int findAllPrefixes(Trie cur, StringBuilder sb, ArrayLi... class Solution (line 62) | class Solution{ method displayContacts (line 12) | static ArrayList> displayContacts(int n, class Trie (line 63) | static class Trie { method displayContacts (line 67) | static ArrayList> displayContacts(int n, method findAllPrefixes (line 121) | public static int findAllPrefixes(Trie cur, StringBuilder sb, ArrayLi... FILE: GFG/Primes sum/Primes sum.cpp class Solution (line 1) | class Solution { method checkPrime (line 3) | bool checkPrime(int n) method string (line 25) | string isSumOfTwo(int N){ FILE: GFG/Primes sum/Primes sum.java class Solution (line 1) | class Solution { method isSumOfTwo (line 2) | static String isSumOfTwo(int N){ FILE: GFG/Print Diagonally/Print Diagonally.cpp class Solution (line 1) | class Solution{ method downwardDigonal (line 4) | vector downwardDigonal(int N, vector> A) FILE: GFG/Print Diagonally/Print Diagonally.java class Solution (line 1) | class Solution{ method downwardDigonal (line 2) | static ArrayList downwardDigonal(int N, int A[][]) FILE: GFG/Print leaf nodes from preorder traversal of BST/Print leaf nodes from preorder traversal of BST.cpp class Solution (line 1) | class Solution { method leafNodes (line 3) | vector leafNodes(int a[],int n) { FILE: GFG/Print leaf nodes from preorder traversal of BST/Print leaf nodes from preorder traversal of BST.java class Solution (line 1) | class Solution method leafNodes (line 3) | public int[] leafNodes(int arr[], int N) FILE: GFG/Queries on a matrix/Queries on a matrix hard s25 gfg.cpp class Solution (line 4) | class Solution { method solveQueries (line 6) | vector> solveQueries(int n, vector> Queries) { function main (line 34) | int main() { FILE: GFG/Rearrange Array Alternately/Rearrange Array Alternately.java class Solution (line 1) | class Solution{ method rearrange (line 6) | public static void rearrange(long arr[], int n){ FILE: GFG/Reorder List/Reorder List.java class Solution (line 1) | class Solution { method reorderlist (line 2) | Node reorderlist(Node head) { method reverse (line 26) | Node reverse(Node head){ FILE: GFG/Replace O's with X's/Replace O's with X's.cpp class Solution (line 1) | class Solution{ method dfs (line 5) | void dfs(int r,int c,vector> &vis,int n,int m,vector> fill(int n, int m, vector> grid) FILE: GFG/Replace every element with the least greater element on its right/Replace every element with the least greater element on its right.cpp class Solution (line 1) | class Solution{ method findLeastGreater (line 3) | vector findLeastGreater(vector& arr, int n) { FILE: GFG/Replace every element with the least greater element on its right/Replace every element with the least greater element on its right.java class Solution (line 1) | class Solution { method findLeastGreater (line 2) | public static ArrayList findLeastGreater(int n, int[] arr) { class Node (line 21) | static class Node { method Node (line 25) | Node(int val) { method findLeastGreater (line 31) | public static ArrayList findLeastGreater(int n, int[] arr) { method addNodeInBST (line 64) | public static Node addNodeInBST(int val, Node cur, Node prev) { method leastGreater (line 75) | public static void leastGreater(Node head, int []max, int value) { class Solution (line 20) | class Solution { method findLeastGreater (line 2) | public static ArrayList findLeastGreater(int n, int[] arr) { class Node (line 21) | static class Node { method Node (line 25) | Node(int val) { method findLeastGreater (line 31) | public static ArrayList findLeastGreater(int n, int[] arr) { method addNodeInBST (line 64) | public static Node addNodeInBST(int val, Node cur, Node prev) { method leastGreater (line 75) | public static void leastGreater(Node head, int []max, int value) { FILE: GFG/Reverse Spiral Form of Matrix/Reverse Spiral Form of Matrix.cpp class Solution (line 1) | class Solution { method reverseSpiral (line 3) | vector reverseSpiral(int R, int C, vector>&a) { FILE: GFG/Reverse Spiral Form of Matrix/Reverse Spiral Form of Matrix.java class Solution (line 1) | class Solution method reverseSpiral (line 3) | public int[] reverseSpiral(int R, int C, int[][] a) FILE: GFG/Satisfy the equation/Satisfy the equation.java class Pair (line 1) | class Pair{ method Pair (line 4) | Pair(int a,int b){ class Solution (line 14) | class Solution { method satisfyEqn (line 16) | static int[] satisfyEqn(int[] A, int N) { FILE: GFG/Save Your Life/Save Your Life.cpp class Solution (line 1) | class Solution{ method string (line 3) | string maxSum(string w,char x[], int b[],int n){ FILE: GFG/Save Your Life/Save Your Life.java class Solution (line 1) | class Solution{ method maxSum (line 2) | static String maxSum(String w,char x[],int b[], int n){ method maxSum (line 35) | static String maxSum(String w,char x[],int b[], int n){ class Solution (line 34) | class Solution{ method maxSum (line 2) | static String maxSum(String w,char x[],int b[], int n){ method maxSum (line 35) | static String maxSum(String w,char x[],int b[], int n){ FILE: GFG/Search Pattern (KMP-Algorithm)/Search Pattern (KMP-Algorithm).java class Solution (line 1) | class Solution method search (line 4) | ArrayList search(String pat, String txt) method fill (line 54) | void fill(int lps[],String s,int pn){ FILE: GFG/Search Pattern (Rabin-Karp Algorithm)/Search Pattern (Rabin-Karp Algorithm).java class Solution (line 1) | class Solution method search (line 4) | ArrayList search(String pat, String S) method compare (line 44) | boolean compare(String p,String s,int st){ FILE: GFG/Sequence Fun/Sequence Fun.java class Solution (line 1) | class Solution method NthTerm (line 3) | public int NthTerm(int n) FILE: GFG/Shortest Distance in a Binary Maze/Shortest Distance in a Binary Maze.cpp class Solution (line 1) | class Solution { method isSafe (line 3) | bool isSafe(int i,int j,int n,int m){ method shortestPath (line 9) | int shortestPath(vector> &grid, pair source, pai... FILE: GFG/Shortest Distance in a Binary Maze/Shortest Distance in a Binary Maze.java class Solution (line 1) | class Solution { class Pair (line 3) | class Pair{ method Pair (line 6) | Pair(int i,int j){ method Pair (line 53) | Pair(int i, int j) { method shortestPath (line 11) | int shortestPath(int[][] grid, int[] src, int[] des) { class Pair (line 51) | class Pair { method Pair (line 6) | Pair(int i,int j){ method Pair (line 53) | Pair(int i, int j) { method shortestPath (line 58) | int shortestPath(int[][] grid, int[] source, int[] destination) { method getPair (line 86) | public Pair getPair(int x, int y, int[][] grid, int [][]visited) { class Solution (line 50) | class Solution { class Pair (line 3) | class Pair{ method Pair (line 6) | Pair(int i,int j){ method Pair (line 53) | Pair(int i, int j) { method shortestPath (line 11) | int shortestPath(int[][] grid, int[] src, int[] des) { class Pair (line 51) | class Pair { method Pair (line 6) | Pair(int i,int j){ method Pair (line 53) | Pair(int i, int j) { method shortestPath (line 58) | int shortestPath(int[][] grid, int[] source, int[] destination) { method getPair (line 86) | public Pair getPair(int x, int y, int[][] grid, int [][]visited) { FILE: GFG/Shortest Path by Removing K walls/Shortest Path by Removing K walls.java class Solution (line 1) | class Solution { method shotestPath (line 2) | static int shotestPath(int[][] mat, int n, int m, int k) { FILE: GFG/Shortest Prime Path/Shortest Prime Path.java class Solution (line 1) | class Solution method Solution (line 4) | Solution() method shortestPath (line 18) | public int shortestPath(int Num1,int Num2){ FILE: GFG/Shreyansh and his bits/Shreyansh and his bits.java class Solution (line 1) | class Solution{ method count (line 3) | long count(long n) method nCr (line 22) | long nCr(int n,int r){ FILE: GFG/Single valued subtree/Single valued subtree.java class Solution (line 1) | class Solution method singlevalued (line 4) | public int singlevalued(Node root) method dfs (line 11) | Integer dfs(Node root){ FILE: GFG/Sort an array of 0s, 1s and 2s/Sort an array of 0s, 1s and 2s.java class Solution (line 1) | class Solution method sort012 (line 3) | public static void sort012(int a[], int n) FILE: GFG/Sort an array of 0s, 1s and 2s/Sort an array of 0s,1s and 2s s29.cpp class Solution (line 3) | class Solution method sort012 (line 6) | void sort012(int a[], int n) function main (line 20) | int main() { FILE: GFG/Spiral Matrix/Spiral Matrix.cpp class Solution (line 1) | class Solution{ method findK (line 4) | int findK(vector> &matrix, int m, int n, int k) FILE: GFG/Split Array Largest Sum/Split Array Largest Sum.java class Solution (line 1) | class Solution { method splitArray (line 2) | static int splitArray(int[] arr , int N, int K) { method isPossible (line 23) | static boolean isPossible(int maxSum,int[]arr,int k){ FILE: GFG/Stepping Numbers/Stepping Numbers.cpp class Solution (line 1) | class Solution{ method dfs (line 6) | void dfs(int n, int m) method steppingNumbers (line 26) | int steppingNumbers(int n, int m) FILE: GFG/Stepping Numbers/Stepping Numbers.java class Solution (line 1) | class Solution{ method steppingNumbers (line 2) | int steppingNumbers(int n, int m){ FILE: GFG/Substrings of length k with k-1 distinct elements/Substrings of length k with k-1 distinct elements.java class Solution (line 1) | class Solution { method countOfSubstrings (line 2) | static int countOfSubstrings(String s, int k) { FILE: GFG/Sum of Beauty of All Substrings/Sum of Beauty of All Substrings.java class Solution (line 1) | class Solution { method beautySum (line 2) | public static int beautySum(String s) { method beauty (line 24) | static int beauty(int[]freq){ FILE: GFG/The Smurfs/The Smurfs.cpp class Solution (line 1) | class Solution{ method findMin (line 3) | int findMin(int n, char arr[]){ FILE: GFG/The Smurfs/The Smurfs.java class Solution (line 2) | class Solution{ method minFind (line 3) | static int minFind(int n, String a[]){ FILE: GFG/Tom and jerry/Tom and Jerry easy s26.cpp class Solution (line 3) | class Solution { method numsGame (line 5) | int numsGame(int N) { function main (line 12) | int main() { FILE: GFG/Tom and jerry/Tom and Jerry.java class Solution (line 1) | class Solution { method numsGame (line 2) | static int numsGame(int N) { FILE: GFG/Tom and jerry/Tom and Jerry.py class Solution (line 1) | class Solution: method numsGame (line 2) | def numsGame(self, N): FILE: GFG/Transform to Sum Tree/Transform to Sum Tree.java class Solution (line 1) | class Solution{ method toSumTree (line 2) | public void toSumTree(Node root){ method dfs (line 6) | int dfs(Node root){ FILE: GFG/Two numbers with odd occurrences/Two numbers with odd occurrences.cpp class Solution (line 1) | class Solution{ method twoOddNum (line 3) | vector twoOddNum(long long int Arr[], long long int N) FILE: GFG/Two numbers with odd occurrences/Two numbers with odd occurrences.java class Solution (line 1) | class Solution method twoOddNum (line 3) | public int[] twoOddNum(int arr[], int N) FILE: GFG/Unique partitions/Unique partitions.java class Solution (line 1) | class Solution method UniquePartitions (line 3) | public ArrayList> UniquePartitions(int n) method dfs (line 17) | void dfs(ArrayList> ans,ArrayList curr, FILE: GFG/Wine Buying and Selling/Wine Buying and Selling.java class GFG (line 7) | public class GFG { method main (line 8) | public static void main(String[] args) throws Exception { method main (line 109) | public static void main(String[] args) throws Exception { class Solution (line 32) | class Solution { method wineSelling (line 33) | long wineSelling(int arr[],int N){ method wineSelling (line 134) | long wineSelling(int arr[],int N){ class GFG (line 108) | public class GFG { method main (line 8) | public static void main(String[] args) throws Exception { method main (line 109) | public static void main(String[] args) throws Exception { class Solution (line 133) | class Solution { method wineSelling (line 33) | long wineSelling(int arr[],int N){ method wineSelling (line 134) | long wineSelling(int arr[],int N){ FILE: GFG/Zero Sum Subarrays/Zero Sum Subarrays.java class Solution (line 1) | class Solution{ method findSubarray (line 3) | public static long findSubarray(long[] arr ,int n) FILE: GFG/k-th smallest element in BST/k-th smallest element in BST.java class Solution (line 2) | class Solution { method KthSmallestElement (line 4) | public int KthSmallestElement(Node root, int k) { FILE: Game with nos.java class Complete (line 1) | class Complete{ method game_with_number (line 5) | public static int[] game_with_number (int arr[], int n) { FILE: Gas Station.java class Solution (line 1) | class Solution { method canCompleteCircuit (line 2) | public int canCompleteCircuit(int[] gas, int[] cost) { FILE: Geek and Number String s23 med.cpp class Solution (line 3) | class Solution{ method minLength (line 5) | int minLength(string s, int n) { function main (line 30) | int32_t main() FILE: Geek and Number String.cpp class Solution (line 1) | class Solution{ method minLength (line 3) | int minLength(string s, int n) { FILE: Geek and Number String.java method minLength (line 3) | public int minLength(String s, int n) { class Solution (line 25) | class Solution { method minLength (line 27) | public int minLength(String s1, int n) { FILE: Geek and knots.java class Solution (line 1) | class Solution{ method knots (line 3) | static int knots(int M, int N, int K){ method comb (line 10) | static long comb(int n,int k,long[][]dp){ FILE: Generate IP Addresses.cpp class Solution (line 1) | class Solution{ method isValid (line 3) | bool isValid(string op) method solve (line 50) | void solve(string ip,string op,vector &ans) method genIp (line 85) | vector genIp(string &s) { FILE: Generate IP Addresses.java class Solution (line 1) | class Solution { method genIp (line 2) | public ArrayList genIp(String s) { method validx (line 26) | boolean validx(String s){ FILE: Generate IP Addresses.py class Solution (line 1) | class Solution: method genIp (line 2) | def genIp(self, s): FILE: Generate all Parentheses II.java class Solution (line 1) | public class Solution { method generateParenthesis (line 5) | public ArrayList generateParenthesis(int A) { method rec (line 12) | public void rec(int leftCount, int rightCount, int index, StringBuilde... FILE: Get min at pop.java class GetMin (line 2) | class GetMin method _push (line 5) | public static Stack _push(int arr[],int n) method _getMinAtPop (line 23) | static void _getMinAtPop(Stacks) FILE: Greater of Lesser.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(ArrayList A, ArrayList B, int C) { FILE: Greater than All.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int[] A) { FILE: Hamiltonian Path - GFG/hamiltonian-path.java class GFG (line 5) | class GFG{ method main (line 6) | public static void main(String args[]) throws IOException { class Solution (line 37) | class Solution method check (line 40) | boolean check(int N, int M, ArrayList> Edges) method dfs (line 62) | boolean dfs(int curr,Set set,Map> ... FILE: Height Using Parent Array.java class Solution (line 1) | class Solution{ method findHeight (line 2) | static int findHeight(int N, int arr[]){ FILE: Highest Product.java class Solution (line 1) | public class Solution { method maxp3 (line 2) | public int maxp3(int[] A) { FILE: Highest Score.java class Solution (line 1) | public class Solution { method highestScore (line 2) | public int highestScore(String[][] A) { FILE: Hit most Balloons.java class Solution (line 1) | class Solution { method mostBalloons (line 2) | public int mostBalloons(int N, int arr[][]) { FILE: INVERSIONS.java class Solution (line 1) | public class Solution { method countInversions (line 2) | public int countInversions(ArrayList A) { FILE: IPL 2021 - Match Day 2.cpp class Solution (line 1) | class Solution { method max_of_subarrays (line 3) | vector max_of_subarrays(vector arr, int n, int k) { FILE: IPL 2021 - Match Day 2.java class Solution (line 1) | class Solution { method max_of_subarrays (line 2) | static ArrayList max_of_subarrays(int arr[], int n, int k) { FILE: IPL 2021 - Match Day 2.py class Solution (line 3) | class Solution: method max_of_subarrays (line 4) | def max_of_subarrays(self,arr,n,k): FILE: Identical Binary Trees.java class Solution (line 1) | public class Solution { method isSameTree (line 2) | public int isSameTree(TreeNode A, TreeNode B) { method equal (line 9) | public boolean equal(TreeNode a,TreeNode b){ FILE: Immediate Smaller Element.java class Solution (line 1) | class Solution { method immediateSmaller (line 2) | void immediateSmaller(int arr[], int n) { FILE: Immediate Smaller Element.js class Solution (line 1) | class Solution { method immediateSmaller (line 2) | immediateSmaller(arr,n){ FILE: Immediate Smaller Element.py class Solution (line 3) | class Solution: method immediateSmaller (line 5) | def immediateSmaller(self,arr,n): FILE: Implement StrStr.java class Solution (line 1) | public class Solution { method strStr (line 3) | public int strStr(final String A, final String B) { FILE: Implementing Dijkstra Algorithm.java class Solution (line 1) | class Solution method dijkstra (line 5) | static int[] dijkstra(int V, ArrayList>> ... method dijkstra (line 73) | static int[] dijkstra(int V, ArrayList>> ... class Solution (line 69) | class Solution method dijkstra (line 5) | static int[] dijkstra(int V, ArrayList>> ... method dijkstra (line 73) | static int[] dijkstra(int V, ArrayList>> ... FILE: Inorder Traversal of Cartesian Tree.java class Solution (line 14) | public class Solution { method buildTree (line 15) | public TreeNode buildTree(int[] A) { method dfs (line 18) | TreeNode dfs(int[]a,int i,int j){ FILE: Inorder linear Traversal.java class Solution (line 1) | public class Solution { method inorderTraversal (line 2) | public ArrayList inorderTraversal(TreeNode A) { FILE: Insertion Sort List.java class Solution (line 1) | public class Solution { method insertionSortList (line 2) | public ListNode insertionSortList(ListNode A) { method iinsert (line 23) | public static void iinsert(ListNode head, ListNode in ) { FILE: Insertion Sort for Singly Linked List.java class Solution (line 1) | class Solution method insertionSort (line 3) | public static Node insertionSort(Node head){ FILE: Integer To Roman.java class Solution (line 1) | public class Solution { method intToRoman (line 2) | public String intToRoman(int A) { method getRoman (line 19) | public String getRoman(int a){ FILE: Integers in Strings.java class Solution (line 1) | public class Solution { method solve (line 2) | public ArrayList solve(String A) { FILE: Intersection Of Sorted Arrays.java class Solution (line 1) | public class Solution { method intersect (line 3) | public ArrayList intersect(final List a, final List<... FILE: Intersection of Linked Lists.java class Solution (line 1) | public class Solution { method getIntersectionNode (line 2) | public ListNode getIntersectionNode(ListNode a, ListNode b) { FILE: Interviewbit/Colorful Number/Colorful Number.java class Solution (line 1) | public class Solution { method colorful (line 2) | public int colorful(int num) { method product (line 16) | public int product(String s,int i,int j){ FILE: Interviewbit/Colorful Number/Colorful Number.py class Solution (line 1) | class Solution: method colorful (line 4) | def colorful(self, A): FILE: Interviewbit/Copy List/Copy List.java class Solution (line 9) | public class Solution { method copyRandomList (line 10) | public RandomListNode copyRandomList(RandomListNode head) { FILE: Interviewbit/Valid Sudoku/Valid Sudoku.java class Solution (line 1) | public class Solution { method isValidSudoku (line 3) | public int isValidSudoku(final String[] A) { FILE: Invert the Binary Tree.java class Solution (line 1) | public class Solution { method invertTree (line 2) | public TreeNode invertTree(TreeNode A) { FILE: Is Subsequence.java class Solution (line 1) | class Solution { method isSubsequence (line 2) | public boolean isSubsequence(String s, String t) { FILE: IsRectangle.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int a, int b, int c, int d) { FILE: Jump Game Array.java class Solution (line 1) | class Solution { method canReach (line 2) | static int canReach(int A[], int N) { FILE: K Largest Elements.java class Solution (line 1) | public class Solution { method solve (line 2) | public ArrayList solve(ArrayList A, int B) { FILE: K-diff Pairs in an Array.java class Solution (line 1) | class Solution { method findPairs (line 2) | public int findPairs(int[] nums, int k) { method findPairs (line 33) | public int findPairs(int[] nums, int k) { class Solution (line 32) | class Solution { method findPairs (line 2) | public int findPairs(int[] nums, int k) { method findPairs (line 33) | public int findPairs(int[] nums, int k) { FILE: Kill Captain America - GFG/kill-captain-america.java class GFG (line 9) | class GFG method main (line 11) | public static void main(String args[])throws IOException class UnionFind (line 39) | class UnionFind method UnionFind (line 44) | UnionFind(int N) method findParent (line 54) | private int findParent(int x) method union (line 60) | public void union (int x, int y) method getMain (line 68) | public int getMain() class Solution (line 90) | class Solution method captainAmerica (line 93) | int captainAmerica(int N, int M, int V[][]) FILE: Killing Spree - GFG/killing-spree.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String args[])throws IOException class Solution (line 31) | class Solution{ method killinSpree (line 33) | long killinSpree(long n) FILE: Koko Eating Bananas.java class Solution (line 1) | class Solution { method minEatingSpeed (line 2) | public int minEatingSpeed(int[] piles, int h) { method max (line 21) | public int max(int[]a){ FILE: Kth Permutation Sequence.java class Solution (line 1) | public class Solution { method getPermutation (line 2) | public String getPermutation(int A, int B) { FILE: Kth Row of Pascal's Triangle.java class Solution (line 1) | public class Solution { method getRow (line 2) | public int[] getRow(int a) { FILE: Kth Smallest Absolute Difference.java class Compute (line 1) | class Compute { method kthDiff (line 3) | public long kthDiff(long arr[], long n, long k) method ok (line 18) | public static boolean ok(int m,long[] arr,int n,int k){ FILE: Kth Smallest Element In Tree.java class Solution (line 14) | public class Solution { method kthsmallest (line 16) | public int kthsmallest(TreeNode root, int B) { method inorder (line 22) | public static void inorder(TreeNode root,int k){ FILE: Kth smallest element.cpp class Solution (line 1) | class Solution{ method kthSmallest (line 7) | int kthSmallest(int arr[], int l, int r, int k) { FILE: LC 1000. Minimum Cost to Merge Stones.cpp class Solution (line 1) | class Solution { method mergeStones (line 7) | int mergeStones(vector &stones, int k) FILE: LCP - GFG/lcp.java class GFG (line 8) | class GFG method main (line 10) | public static void main(String args[]) class Solution (line 35) | class Solution method lcp (line 37) | public String lcp(String s[],int n){ FILE: Largest BST - GFG/largest-bst.java class Node (line 10) | class Node method Node (line 15) | public Node(int d) class GFG (line 22) | class GFG method buildTree (line 24) | static Node buildTree(String str) method main (line 79) | public static void main(String args[]) throws IOException { class Solution (line 114) | class Solution{ method largestBst (line 117) | static int largestBst(Node root){ method checkBST (line 123) | static boolean checkBST(Node root){ method count (line 141) | static int count(Node root){ method getMIN (line 145) | static int getMIN(Node root){ method getMAX (line 149) | static int getMAX(Node root){ FILE: Largest Number.java class Solution (line 1) | public class Solution { method largestNumber (line 3) | public String largestNumber(final List A) { FILE: Largest Permutation.java class Solution (line 1) | public class Solution { method solve (line 2) | public int[] solve(int[] A, int B) { FILE: Largest Rectangle in Histogram.java class Solution (line 1) | class Solution { method largestRectangleArea (line 2) | public int largestRectangleArea(int[] a) { method prevSmallest (line 13) | public int[] prevSmallest(int[]a){ method nextSmallest (line 29) | public int[] nextSmallest(int[]a){ FILE: Largest number with given sum - GFG/largest-number-with-given-sum.java class Driverclass (line 6) | class Driverclass method main (line 8) | public static void main(String args[])throws IOException class Solution (line 31) | class Solution method largestNumber (line 35) | static String largestNumber(int n, int sum){ FILE: Largest prime factor.cpp class Solution (line 1) | class Solution{ method isPrime (line 3) | bool isPrime(int N){ method largestPrimeFactor (line 9) | long long int largestPrimeFactor(int N){ FILE: Largest value in each level.java class Solution (line 1) | class Solution method largestValues (line 3) | public ArrayList largestValues(Node root) method dfs (line 16) | public void dfs(Node root,int level,Map map){ FILE: Last Node in a Complete Binary Tree.java class Solution (line 14) | public class Solution { method lastNode (line 15) | public int lastNode(TreeNode A) { FILE: Last digit K count.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A, int B, int C) { FILE: Leaders in an array.java class Solution (line 1) | public class Solution { method solve (line 2) | public ArrayList solve(ArrayList A) { FILE: Leaves to DLL.java class Tree (line 1) | class Tree{ method convertToDLL (line 3) | public Node convertToDLL(Node root) method solve (line 23) | static Node solve(Node root,ArrayList al) FILE: Leetcode/104 maximum depth of binary tree/104 maximum depth of binary tree.cpp class Solution (line 12) | class Solution { method maxDepth (line 14) | int maxDepth(TreeNode* root) { FILE: Leetcode/104 maximum depth of binary tree/104. Maximum Depth of Binary Tree.java class Solution (line 1) | class Solution { method maxDepth (line 2) | public int maxDepth(TreeNode root) { FILE: Leetcode/112 Path Sum/112 Path Sum oc4.cpp type TreeNode (line 3) | struct TreeNode { method TreeNode (line 7) | TreeNode() : val(0), left(nullptr), right(nullptr) {} method TreeNode (line 8) | TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} method TreeNode (line 9) | TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left),... class Solution (line 11) | class Solution { method hasPathSum (line 13) | bool hasPathSum(TreeNode* root, int targetSum) { FILE: Leetcode/112 Path Sum/Path Sum.java class Solution (line 4) | class Solution { method fun (line 5) | public static void fun(TreeNode root, int sum , int val, ArrayList int: FILE: Leetcode/1217. Minimum Cost to Move Chips to The Same Position/1217. Minimum Cost to Move Chips to The Same Position.java class Solution (line 1) | class Solution { method minCostToMoveChips (line 3) | public int minCostToMoveChips(int[] position) { FILE: Leetcode/1252. Cells with Odd Values in a Matrix/1252. Cells with Odd Values in a Matrix.java class Solution (line 1) | class Solution { method oddCells (line 2) | public int oddCells(int m, int n, int[][] indices) { method increment1 (line 27) | static void increment1(int b , int[][] arr){ method increment2 (line 34) | static void increment2(int c,int[][]arr){ method cunt (line 42) | static int cunt(int[][] brr, int m , int n) FILE: Leetcode/1304.Find N Unique Integers Sum up to Zero/1304.Find N Unique Integers Sum up to Zero.java class Solution (line 1) | class Solution { method sumZero (line 2) | public int[] sumZero(int n) { FILE: Leetcode/15. 3Sum/3sum.java class Solution (line 3) | public class Solution { method threeSum (line 4) | public List> threeSum(int[] num) { FILE: Leetcode/151.Reverse Words in a String/Reverse Words in a String.java class Solution (line 1) | class Solution { method reverseWords (line 2) | public String reverseWords(String s) { FILE: Leetcode/1531. String Compression II/1531. String Compression II.cpp class Solution (line 1) | class Solution { method helper (line 4) | int helper(int currIdx,int prevchar,int curFreq,int k, vector& time) { method minCost (line 36) | int minCost(string colors, vector& neededTime) { class Solution (line 34) | class Solution { method minCost (line 12) | int minCost(string s, vector& time) { method minCost (line 36) | int minCost(string colors, vector& neededTime) { FILE: Leetcode/1578. Minimum Time to Make Rope Colorful/1578. Minimum Time to Make Rope Colorful.py class Solution (line 1) | class Solution: method minCost (line 2) | def minCost(self, colors: str, neededTime: List[int]) -> int: FILE: Leetcode/1662. Check If Two String Arrays are Equivalent/Check If Two String Arrays are Equivalent.java class Solution (line 3) | class Solution { method arrayStringsAreEqual (line 4) | public boolean arrayStringsAreEqual(String[] word1, String[] word2) { method arrayStringsAreEqual (line 32) | public boolean arrayStringsAreEqual(String[] word1, String[] word2) { class Solution (line 31) | class Solution { method arrayStringsAreEqual (line 4) | public boolean arrayStringsAreEqual(String[] word1, String[] word2) { method arrayStringsAreEqual (line 32) | public boolean arrayStringsAreEqual(String[] word1, String[] word2) { FILE: Leetcode/19 Remove Nth Node From End of List/19 Remove Nth Node From End of List.cpp class Solution (line 5) | class Solution { method ListNode (line 7) | ListNode* removeNthFromEnd(ListNode* head, int n) { method ListNode (line 54) | ListNode* removeNthFromEnd(ListNode* head, int n) { class Solution (line 52) | class Solution { method ListNode (line 7) | ListNode* removeNthFromEnd(ListNode* head, int n) { method ListNode (line 54) | ListNode* removeNthFromEnd(ListNode* head, int n) { FILE: Leetcode/19 Remove Nth Node From End of List/Remove Nth Node from End Of List.java class Solution (line 31) | class Solution { method removeNthFromEnd (line 32) | public ListNode removeNthFromEnd(ListNode head, int n) { FILE: Leetcode/1996. The Number of Weak Characters in the Game/The Number of Weak Characters in the Game.cpp class Solution (line 1) | class Solution { method comp (line 4) | static bool comp(vector &a,vector &b){ method numberOfWeakCharacters (line 10) | int numberOfWeakCharacters(vector>& p) { FILE: Leetcode/2095. Delete the Middle Node of a Linked List/2095 Delete the Middle Node of a Linked List.java class Solution (line 11) | class Solution { method deleteMiddle (line 12) | public ListNode deleteMiddle(ListNode head) { FILE: Leetcode/2124. Check if All A's Appears Before All B's/2124. Check if All A's Appears Before All B's.java class Solution (line 2) | class Solution { method checkString (line 3) | public boolean checkString(String s) { method Complexity (line 16) | Time Complexity:O(String Length)[As indexOf() FILE: Leetcode/218 The Skyline Problem/218 The Skyline Problem s30.cpp class Solution (line 4) | class Solution { method getSkyline (line 6) | vector> getSkyline(vector>& buildings) { FILE: Leetcode/221. Maximal Square/221. Maximal Square.java class Solution (line 1) | class Solution { method maximalSquare (line 2) | public int maximalSquare(char[][] matrix) { FILE: Leetcode/222. Count Complete Tree Nodes/Count Complete Tree Nodes.java class Solution (line 1) | class Solution { method countNodes (line 3) | public int countNodes(TreeNode root) { FILE: Leetcode/2368. Reachable Nodes With Restrictions/Reachable Nodes With Restrictions.cpp class Solution (line 1) | class Solution { method dfs (line 4) | void dfs(vector adj[],vector&vis,int node,int &no){ method reachableNodes (line 14) | int reachableNodes(int n, vector>& edges, vector& res) { FILE: Leetcode/237. Delete Node in a Linked List/Delete Node in a Linked List.cpp class Solution (line 9) | class Solution { method deleteNode (line 11) | void deleteNode(ListNode* node) { FILE: Leetcode/237. Delete Node in a Linked List/Delete Node in a Linked List.java class Solution (line 1) | class Solution { method deleteNode (line 2) | public void deleteNode(ListNode node) { FILE: Leetcode/2424. Longest Uploaded Prefix/2424. Longest Uploaded Prefix.java class LUPrefix (line 42) | class LUPrefix { method LUPrefix (line 45) | public LUPrefix(int n) { method upload (line 50) | public void upload(int video) { method longest (line 60) | public int longest() { FILE: Leetcode/2427. Number of Common Factors/2427. Number of Common Factors.cpp class Solution (line 4) | class Solution { method commonFactors (line 6) | int commonFactors(int a, int b) { FILE: Leetcode/2428. Maximum Sum of an Hour Glass/2428. Maximum Sum of an Hour Glass.cpp class Solution (line 4) | class Solution { method maxSum (line 6) | int maxSum(vector>& grid) { FILE: Leetcode/263. Ugly Number/263. Ugly Number.cpp class Solution (line 1) | class Solution { method isUgly (line 3) | bool isUgly(int n) { FILE: Leetcode/279. Perfect Squares/279. Perfect Squares.cpp class Solution (line 1) | class Solution { method solve (line 2) | int solve(int ind, vector &nums, int tar, vector> &dp) method numSquares (line 21) | int numSquares(int n) { FILE: Leetcode/336. Palindrome Pairs/336. Palindrome Pairs.java class Solution (line 1) | class Solution { method palindromepair (line 2) | static int palindromepair(int N, String arr[]) { method isPalindrome (line 15) | static boolean isPalindrome(String input){ FILE: Leetcode/336. Palindrome Pairs/336. Palindrome pairs.cpp type TrieNode (line 5) | struct TrieNode { class Solution (line 11) | class Solution { method add (line 13) | void add(string &s, int i) { method isPalindrome (line 25) | bool isPalindrome(string &s, int i, int j) { method palindromePairs (line 30) | vector> palindromePairs(vector& words) { FILE: Leetcode/4. Median of Two Sorted Arrays/4. Median of Two Sorted Arrays.java class Solution (line 5) | class Solution { method findMedianSortedArrays (line 6) | public double findMedianSortedArrays(int[] arr1, int[] arr2) { FILE: Leetcode/4. Median of Two Sorted Arrays/Median of Two Sorted Arrays.cpp class Solution (line 1) | class Solution { method findMedianSortedArrays (line 3) | double findMedianSortedArrays(vector& v1, vector& v2) { FILE: Leetcode/401 binary watch/401-binary-watch.java class Solution (line 1) | class Solution { method readBinaryWatch (line 2) | public List readBinaryWatch(int turnedOn) { FILE: Leetcode/437 Path Sum III/pathSum.cpp class Solution (line 1) | class Solution { method dfs (line 4) | void dfs(TreeNode* root,long long target) method pathSum (line 14) | int pathSum(TreeNode* root, int targetSum) FILE: Leetcode/4Sum II/4Sum II.java class Solution (line 1) | class Solution { method fourSumCount (line 2) | public int fourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] n... FILE: Leetcode/622 Design Circular Queue/622 Design Circular Queue med s25.cpp class MyCircularQueue (line 4) | class MyCircularQueue { method MyCircularQueue (line 6) | MyCircularQueue(int k) { method enQueue (line 15) | bool enQueue(int value) { method deQueue (line 23) | bool deQueue() { method Front (line 32) | int Front() { method Rear (line 38) | int Rear() { method isEmpty (line 44) | bool isEmpty() { method isFull (line 49) | bool isFull() { FILE: Leetcode/623 Add One Row To Tree/Add one row to tree.java class Solution (line 1) | class Solution { method addOneRow (line 2) | public TreeNode addOneRow(TreeNode root, int val, int depth) { method addRow (line 11) | public void addRow(TreeNode root, int val, int height, int expHeight) { FILE: Leetcode/623 Add One Row to Tree/623 Add One Row to Tree.java class Solution (line 1) | class Solution { method add (line 3) | public TreeNode add(TreeNode root, int val, int depth, int currdepth){ method addOneRow (line 36) | public TreeNode addOneRow(TreeNode root, int val, int depth) { FILE: Leetcode/658 Find K Closest Elements/658 Find K Closest Elements s29.cpp class Solution (line 4) | class Solution { method findClosestElements (line 6) | vector findClosestElements(vector& arr, int k, int x) { FILE: Leetcode/658 Find K Closest Elements/Find k Closest Elements.java class Solution (line 2) | class Solution { method findClosestElements (line 3) | public List findClosestElements(int[] arr, int k, int x) { method compareTo (line 55) | public int compareTo(Pair p){ method findClosestElements (line 64) | public List findClosestElements(int[] arr, int k, int x) { FILE: Leetcode/704 binary search/704-Binary-Search.py function binary_search (line 3) | def binary_search(arr, x): FILE: Leetcode/72 Edit distance/minDistance.cpp class Solution (line 2) | class Solution { method dp (line 5) | int dp(string word1, string word2, int i, int j) { method minDistance (line 15) | int minDistance(string word1, string word2) { FILE: Leetcode/72 Edit distance/minDistance.java class Solution (line 1) | public class Solution { method minDistance (line 2) | public int minDistance(String A, String B) { method editDist (line 6) | int editDist(String A,String B,int x,int y,int[][]memory){ FILE: Leetcode/75.Sort colors/75.Sort-colors.java class Solution (line 1) | class Solution { method sortColors (line 2) | public void sortColors(int[] nums) { FILE: Leetcode/75.Sort colors/Sort colors.cpp class Solution (line 1) | class Solution { method sortColors (line 3) | void sortColors(vector& v) { FILE: Leetcode/79.Word Search/79. Word Search.cpp class Solution (line 1) | class Solution { method exist (line 3) | bool exist(vector>& board, string word) { method dfsSearch (line 18) | bool dfsSearch(vector>& board, string& word, int k, int i... FILE: Leetcode/838 Push Dominoes/838 Push Dominoes lc med s27.cpp class Solution (line 4) | class Solution { method string (line 7) | string pushDominoes(string dominoes) { FILE: Leetcode/91 Decode Ways/91 Decode Ways oc1.cpp class Solution (line 4) | class Solution { method numDecodings (line 6) | int numDecodings(string s) { FILE: Leetcode/92 Reverse Linked List II/Reverse Linked List II.cpp class Solution (line 11) | class Solution { method ListNode (line 13) | ListNode* reverseBetween(ListNode* head, int left, int right) { FILE: Leetcode/92 Reverse Linked List II/Reverse Linked List II.java class Solution (line 1) | public class Solution { method reverseBetween (line 2) | public ListNode reverseBetween(ListNode A, int B, int C) { FILE: Leetcode/990 Satisfiability of Equality Equations/990 Satisfiability of Equality Equations med s26.cpp class Solution (line 4) | class Solution { method find (line 7) | int find(int x){ method equationsPossible (line 10) | bool equationsPossible(vector& equations) { FILE: Leetcode/Break A Palindrome/Break A Palindrome.java class Solution (line 1) | class Solution{ method breakPalindrome (line 2) | public String breakPalindrome(String s) { method Complexity (line 26) | Time Complexity:O(S.length()/2); method Complexity (line 27) | Space Complexity:O(1) method Space (line 28) | Auxiliary Space:O(1) FILE: Leetcode/K diff pairs/K diff pairs.cpp class Solution (line 1) | class Solution { method findPairs (line 3) | int findPairs(vector& nums, int k) { FILE: Leetcode/Merge Overlapping Intervals/Merge Overlapping Intervals.cpp class Solution (line 1) | class Solution { method merge (line 3) | vector> merge(vector>& intervals) { FILE: Leetcode/Minimum time to Make Rope Colorful/Minimum Time to Make Rope Colorful.cpp class Solution (line 1) | class Solution { method minCost (line 3) | int minCost(string colors, vector& neededTime) { FILE: Leetcode/Remove Letter To Equalize Frequency/Remove Letter To Equalize Frequency.cpp class Solution (line 1) | class Solution { method equalFrequency (line 3) | bool equalFrequency(string word) { FILE: Leetcode/Sort Colors/Sort Colors.cpp class Solution (line 1) | class Solution { method sortColors (line 3) | void sortColors(vector& nums) { FILE: Leetcode/Top K Frequent Words/Top K Frequent Words.cpp class Solution (line 1) | class Solution { class comp (line 4) | class comp { method topKFrequent (line 12) | vector topKFrequent(vector& words, int k) { FILE: Leetcode/Two Sum IV-Input is BST/Two Sum IV-Input is a BST.java class Solution (line 11) | class Solution { method fun (line 13) | public void fun(TreeNode root,ArrayListaa){ method findTarget (line 23) | public boolean findTarget(TreeNode root, int target) { FILE: Length of Last Word.java class Solution (line 1) | public class Solution { method lengthOfLastWord (line 3) | public int lengthOfLastWord(final String s) { FILE: Length of longest palindrome in Linked List.java class GfG (line 1) | class GfG method fun (line 3) | public static int fun(LinkedListlist,int start, int end){ method maxPalindrome (line 18) | public static int maxPalindrome(Node head) FILE: Length of longest palindrome in linked list.java class GfG (line 1) | class GfG method maxPalindrome (line 4) | public static int maxPalindrome(Node head) method binary (line 20) | public static int binary(ArrayList al , int i, int[] arr){ FILE: Letter Phone.java class Solution (line 1) | public class Solution { method letterCombinations (line 3) | public ArrayList letterCombinations(String digits) { method dfs (line 12) | public void dfs(String digits, int index, StringBuilder sb, ArrayList<... FILE: Level Order.java class Solution (line 1) | public class Solution { method levelOrder (line 2) | public ArrayList> levelOrder(TreeNode A) { FILE: Levels Of Game.java class Solution (line 2) | class Solution { method maxLevel (line 3) | public static int maxLevel(int h,int m) { method dfs (line 12) | static int dfs(int h,int m,int[][]dp){ method maxLevel (line 27) | public static int maxLevel(int h,int m) { class Solution (line 26) | class Solution { method maxLevel (line 3) | public static int maxLevel(int h,int m) { method dfs (line 12) | static int dfs(int h,int m,int[][]dp){ method maxLevel (line 27) | public static int maxLevel(int h,int m) { FILE: Licence Key Formatting.java class Solution (line 1) | class Solution{ method ReFormatString (line 2) | static String ReFormatString(String s, int k){ FILE: License Key Formatting GFG/Licence.cpp function string (line 1) | string ReFormatString(string S, int K){ class Solution (line 44) | class Solution method string (line 47) | string ReFormatString(string S, int K){ FILE: License Key Formatting med s21.cpp class Solution (line 3) | class Solution method string (line 6) | string ReFormatString(string S, int K){ function main (line 35) | int main() FILE: License Key Formatting(explanation in comments).cpp class Solution (line 9) | class Solution method string (line 12) | string ReFormatString(string S, int K){ function main (line 61) | int main() FILE: License Key Formatting.cpp class Solution (line 1) | class Solution method string (line 4) | string ReFormatString(string s, int k){ FILE: License Key Formatting.java class Solution (line 1) | class Solution{ method ReFormatString (line 2) | static String ReFormatString(String S, int K){ FILE: Linked List Cycle II.java class Solution (line 1) | public class Solution { method detectCycle (line 2) | public ListNode detectCycle(ListNode head) { method detect (line 12) | public ListNode detect(ListNode node){ FILE: Linked List Cycle.java class Solution (line 1) | public class Solution { method hasCycle (line 2) | public boolean hasCycle(ListNode head) { FILE: Longest Bitonic subsequence.cpp class Solution (line 1) | class Solution{ method LongestBitonicSequence (line 3) | int LongestBitonicSequence(vectornums) FILE: Longest Common Prefix.java class Solution (line 1) | public class Solution { method longestCommonPrefix (line 2) | public String longestCommonPrefix(ArrayList a) { FILE: Longest Common Subsequence.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(String A, String B) { FILE: Longest Palindromic Subsequence.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(String A) { FILE: Longest Palindromic Substring.java class Solution (line 1) | public class Solution { method longestPalindrome (line 2) | public String longestPalindrome(String s) { FILE: Longest Path in a matrix - GFG/longest-path-in-a-matrix.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 36) | class Solution{ method longestIncreasingPath (line 39) | public int longestIncreasingPath(int[][] matrix){ method dfs (line 52) | public int dfs(int i,int j){ method valid (line 80) | public boolean valid(int i,int j){ FILE: Longest Possible Route in a Matrix with Hurdles - GFG/longest-possible-route-in-a-matrix-with-hurdles.java class IntArray (line 6) | class IntArray method input (line 8) | public static int[] input(BufferedReader br, int n) throws IOException method print (line 18) | public static void print(int[] a) method print (line 25) | public static void print(ArrayList a) class IntMatrix (line 34) | class IntMatrix method input (line 36) | public static int[][] input(BufferedReader br, int n, int m) throws IO... method print (line 51) | public static void print(int[][] m) method print (line 61) | public static void print(ArrayList> m) class GFG (line 72) | class GFG { method main (line 73) | public static void main(String[] args) throws IOException { class Solution (line 98) | class Solution { method longestPath (line 101) | public static int longestPath(int[][] mat,int n,int m,int xs,int ys,in... method dfs (line 108) | public static int dfs(int[][]mat,int x,int y,boolean[][]vis){ method valid (line 129) | public static boolean valid(int[][]mat,int x,int y,boolean[][]vis){ FILE: Longest Sub-Array with Sum K.cpp class Solution (line 1) | class Solution{ method lenOfLongSubarr (line 3) | int lenOfLongSubarr(int A[], int N, int K) FILE: Longest Sub-Array with Sum K.java class Solution (line 1) | class Solution{ method lenOfLongSubarr (line 5) | public static int lenOfLongSubarr (int A[], int N, int K) { FILE: Longest subarray with sum divisible by K - GFG/longest-subarray-with-sum-divisible-by-k.java class Solution (line 15) | class Solution{ method longSubarrWthSumDivByK (line 16) | int longSubarrWthSumDivByK(int a[], int n, int k){ class GFG (line 35) | class GFG { method main (line 38) | public static void main (String[] args) throws IOException{ FILE: Longest substring to form a Palindrome - GFG/longest-substring-to-form-a-palindrome.java class GFG (line 5) | class GFG { method main (line 6) | public static void main(String args[]) throws IOException { class Solution (line 22) | class Solution { method longestSubstring (line 23) | static int longestSubstring(String S) { FILE: Longest valid Parentheses.java class Solution (line 1) | public class Solution { method longestValidParentheses (line 2) | public int longestValidParentheses(String s) { FILE: M-Coloring Problem.java class solve (line 1) | class solve { method graphColoring (line 5) | public boolean graphColoring(boolean graph[][], int m, int n) { method dfs (line 19) | boolean dfs(Map> map,int currNode,int[]col,... method safe (line 31) | boolean safe(int currNode,int currColor,Map... FILE: MInimum time to fulfil all orders.cpp class Solution (line 1) | class Solution{ method countDonut (line 5) | int countDonut(int R, int T) method findMinTime (line 18) | int findMinTime(int N, vector&A, int L){ FILE: Magician and Chocolates.java class Solution (line 1) | public class Solution { method nchoc (line 2) | public int nchoc(int A, ArrayList B) { FILE: Magnet Array Problem - GFG/magnet-array-problem.java class GFG (line 9) | class GFG { method main (line 10) | public static void main(String[] args) throws IOException class Solution (line 45) | class Solution { method nullPoints (line 47) | public void nullPoints(int n, double magnets[], double getAnswer[]) method solve (line 53) | public double solve(int n,double arr[],double low,double high){ method force (line 67) | public double force(double arr[],int n,double mid){ FILE: Majority Element.java class Solution (line 3) | class Solution { method majorityElement (line 4) | public int majorityElement(int[] nums) { method majorityElement (line 24) | public int majorityElement(int[] nums) { method recurse (line 28) | public int recurse(int[] nums, int start){ method majorityElement (line 48) | public int majorityElement(int[] nums) { class Solution (line 22) | class Solution { method majorityElement (line 4) | public int majorityElement(int[] nums) { method majorityElement (line 24) | public int majorityElement(int[] nums) { method recurse (line 28) | public int recurse(int[] nums, int start){ method majorityElement (line 48) | public int majorityElement(int[] nums) { class Solution (line 47) | class Solution { method majorityElement (line 4) | public int majorityElement(int[] nums) { method majorityElement (line 24) | public int majorityElement(int[] nums) { method recurse (line 28) | public int recurse(int[] nums, int start){ method majorityElement (line 48) | public int majorityElement(int[] nums) { FILE: Make equal elements Array.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int[] A, int B) { FILE: Matrix Chain Multiplication.cpp class Solution (line 1) | class Solution{ method solve (line 3) | int solve(vector> &dp, int arr[] , int i , int j) method matrixMultiplication (line 18) | int matrixMultiplication(int N, int arr[]) FILE: Matrix Exponentiation - GFG/matrix-exponentiation.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 27) | class Solution method multiply (line 31) | long[][] multiply(long [][]m1, long[][]m2) method matPow (line 42) | long[][] matPow(long [][]mat,long n){ method FindNthTerm (line 50) | public int FindNthTerm(int N){ FILE: Matrix Operations.java class Solution (line 1) | class Solution{ method endPoints (line 6) | static int [] endPoints(int [][]arr, int m, int n){ method outOfBounds (line 24) | static boolean outOfBounds(int[][] arr,int row,int col){ method getDir (line 32) | static int[] getDir(char c){ method changeDir (line 43) | static char changeDir(char c){ FILE: Matrix Search.java class Solution (line 1) | public class Solution { method searchMatrix (line 2) | public int searchMatrix(ArrayList> A, int B) { method dfs (line 5) | public int dfs(ArrayList> A, int B,int l,int h){ FILE: Max Depth of Binary Tree.java class Solution (line 14) | public class Solution { method maxDepth (line 15) | public int maxDepth(TreeNode A) { FILE: Max Distance.java class Solution (line 1) | public class Solution { method maximumGap (line 3) | public int maximumGap(final int[] arr) { FILE: Max Non Negative SubArray.java class Solution (line 1) | public class Solution { method maxset (line 2) | public ArrayList maxset(ArrayList a) { FILE: Max Product Subarray.java class Solution (line 1) | public class Solution { method maxProduct (line 3) | public int maxProduct(final int[] nums) { FILE: Max Rectangle in Binary Matrix.java class Solution (line 1) | public class Solution { method maximalRectangle (line 2) | public int maximalRectangle(int[][] a) { method largestRectangleArea (line 18) | public int largestRectangleArea(int[] a) { method prevSmallest (line 29) | public int[] prevSmallest(int[]a){ method nextSmallest (line 45) | public int[] nextSmallest(int[]a){ FILE: Max Sum Path in Binary Tree.java class Solution (line 14) | public class Solution { method maxPathSum (line 16) | public int maxPathSum(TreeNode A) { method dfs (line 21) | int dfs(TreeNode A){ method max (line 31) | int max(int a,int b,int c){ method sum (line 34) | int sum(TreeNode A){ FILE: Max length chain.cpp class Solution (line 1) | class Solution{ method maxChainLen (line 4) | int maxChainLen(struct val p[],int n){ FILE: Max length chain.java class GfG (line 1) | class GfG method maxChainLength (line 3) | int maxChainLength(Pair arr[], int n) FILE: Maximize The Array - GFG/maximize-the-array.java class GFG (line 8) | public class GFG { method main (line 10) | public static void main(String[] args) throws Exception { class Solution (line 36) | class Solution { method maximizeArray (line 37) | ArrayList maximizeArray(int[] arr1, int[] arr2, int n) { FILE: Maximize the sum of selected numbers from an array to make it empty - GFG/maximize-the-sum-of-selected-numbers-from-an-array-to-make-it-empty.java class Array (line 13) | class Array { method main (line 16) | public static void main (String[] args) throws IOException{ class Complete (line 53) | class Complete{ method maximizeSum (line 57) | public static int maximizeSum (int arr[], int n) { FILE: Maximum Depth of Binary Tree.java class Solution (line 1) | class Solution { method maxDepth (line 2) | public int maxDepth(TreeNode root) { FILE: Maximum GCD of siblings of a binary tree - GFG/maximum-gcd-of-siblings-of-a-binary-tree.java class GFG (line 5) | class GFG { method main (line 6) | public static void main(String args[]) throws IOException { class Solution (line 33) | class Solution { method getGCD (line 34) | static int getGCD(int a,int b){ method maxBinTreeGCD (line 50) | static int maxBinTreeGCD(ArrayList> arr, int N) { FILE: Maximum Number of Words Found in Sentences.java class Solution (line 1) | class Solution { method mostWordsFound (line 2) | public int mostWordsFound(String[] sentences) { FILE: Maximum Path Sum between 2 Leaf Nodes.cpp class Solution (line 2) | class Solution { method maxSum (line 4) | int maxSum(Node* root,int &sum){ method maxPathSum (line 15) | int maxPathSum(Node* root) FILE: Maximum Path in Triangle.java class Solution (line 1) | public class Solution { method solve (line 3) | public int solve(int[][] A) { method solve (line 11) | public int solve(int[][]arr,int i,int j){ FILE: Maximum Product of Increasing Subsequence of Size 3 - GFG/maximum-product-of-increasing-subsequence-of-size-3.java class Array (line 15) | class Array { method main (line 18) | public static void main (String[] args) throws IOException{ class Solution (line 57) | class Solution{ method maxProductSubsequence (line 60) | public static ArrayList maxProductSubsequence (int arr[], int... FILE: Maximum Split of Positive Even Integers.py class Solution (line 1) | class Solution: method maximumEvenSplit (line 2) | def maximumEvenSplit(self, num: int) -> List[int]: FILE: Maximum Twin Sum of a Linked List.java class Solution (line 1) | class Solution { method pairSum (line 2) | public int pairSum(ListNode head) { FILE: Maximum Width of Binary Tree.java class Solution (line 1) | class Solution { method widthOfBinaryTree (line 2) | public int widthOfBinaryTree(TreeNode root) { method bfs (line 9) | public int bfs(Queue q){ FILE: Maximum XOR of Two Numbers in an Array.java class Solution (line 2) | class Solution { method findMaximumXOR (line 3) | public int findMaximumXOR(int[] nums) { method findMaximumXOR (line 59) | public int findMaximumXOR(int[] nums) { class Node (line 32) | class Node { method Node (line 34) | Node() { class Trie (line 39) | class Trie { method Trie (line 42) | Trie() { method insert (line 46) | public void insert(int[] A) { class Solution (line 58) | class Solution { method findMaximumXOR (line 3) | public int findMaximumXOR(int[] nums) { method findMaximumXOR (line 59) | public int findMaximumXOR(int[] nums) { FILE: Maximum average subarray - GFG/maximum-average-subarray.java class GFG (line 7) | public class GFG { method main (line 8) | public static void main(String[] args) throws Exception { class Solution (line 35) | class Solution { method findMaxAverage (line 36) | int findMaxAverage(int[] arr, int n, int k) { FILE: Maximum level sum.java class Solution (line 14) | public class Solution { method solve (line 15) | public int solve(TreeNode A) { FILE: Maximum number of 2X2 squares.cpp class Solution (line 11) | class Solution method numberOfSquares (line 14) | long long int numberOfSquares(long long int base) function main (line 24) | int main() FILE: Maximum number of 2X2 squares.java class Solution (line 1) | class Solution method numberOfSquares (line 3) | public static long numberOfSquares(long n) FILE: Maximum number of events that can be attended.java class Solution (line 1) | class Solution { method maxEvents (line 2) | static int maxEvents(int[] start, int[] end, int N) { FILE: Maximum selections - GFG/maximum-selections.java class GFG (line 6) | class GFG{ method main (line 7) | public static void main(String args[]) throws IOException { class solver (line 36) | class solver method max_non_overlapping (line 38) | static int max_non_overlapping(int ranges[][], int n){ FILE: Maximum sum Rectangle - GFG/maximum-sum-rectangle.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 31) | class Solution { method kade (line 32) | int kade(int[]sum){ method maximumSumRectangle (line 47) | int maximumSumRectangle(int r, int c, int mat[][]) { FILE: Maximum sum leaf to root path.java class Solution (line 1) | class Solution method maxPathSum (line 3) | public static int maxPathSum(Node root) FILE: Maximum sum of Non-adjacent nodes.java class Solution (line 1) | class Solution{ method solve (line 3) | public static int solve(Node root, boolean canTake,String path, Map merge(ArrayList arr) { FILE: Merge Two Sorted Array.py class Solution (line 1) | class Solution: method merge (line 2) | def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) ->... FILE: Merge Two Sorted Lists.java class Solution (line 1) | class Solution { method mergeTwoLists (line 2) | public ListNode mergeTwoLists(ListNode l1, ListNode l2) { FILE: Merge Without Extra Space.cpp class Solution (line 3) | class Solution{ method merge (line 6) | void merge(long long arr1[], long long arr2[], int n, int m) FILE: Merge k Sorted Lists.java class Solution (line 1) | class Solution { method mergeKLists (line 2) | public ListNode mergeKLists(ListNode[] lists) { method partition (line 6) | public ListNode partition(ListNode[] lists, int i, int j){ method sort (line 22) | public ListNode sort(ListNode l1, ListNode l2){ method mergeKLists (line 53) | public ListNode mergeKLists(ListNode[] lists) { class Solution (line 52) | class Solution { method mergeKLists (line 2) | public ListNode mergeKLists(ListNode[] lists) { method partition (line 6) | public ListNode partition(ListNode[] lists, int i, int j){ method sort (line 22) | public ListNode sort(ListNode l1, ListNode l2){ method mergeKLists (line 53) | public ListNode mergeKLists(ListNode[] lists) { FILE: Merge two Binary Tree.java class Solution (line 1) | public class Solution { method solve (line 2) | public TreeNode solve(TreeNode A, TreeNode B) { FILE: Merge two sorted linked lists - GFG/merge-two-sorted-linked-lists.java class Node (line 4) | class Node method Node (line 8) | Node(int d) { class MergeLists (line 15) | class MergeLists method printList (line 22) | public static void printList(Node head) method main (line 36) | public static void main(String args[]) class LinkedList (line 87) | class LinkedList{ method sortedMerge (line 90) | Node sortedMerge(Node head1, Node head2) { FILE: Merging Details - GFG/Merging Details.cpp class Solution (line 1) | class Solution { method mergeDetails (line 3) | vector> mergeDetails(vector>& details) { FILE: Merging Details _GFG.cpp class Solution (line 1) | class Solution { method mergeDetails (line 3) | vector> mergeDetails(vector>& details) { FILE: Merging Details.java class Solution (line 1) | class Solution { method mergeDetails (line 3) | public List> mergeDetails(List> details) { FILE: Min Coin - GFG/min-coin.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 35) | class Solution{ method MinCoin (line 36) | public int MinCoin(int[] nums, int amount){ FILE: Min Depth of Binary Tree.java class Solution (line 14) | public class Solution { method minDepth (line 15) | public int minDepth(TreeNode A) { FILE: Min Jumps Array.java class Solution (line 1) | public class Solution { method jump (line 2) | public int jump(int[] a) { FILE: Min Stack.java class Solution (line 1) | class Solution { method push (line 4) | public void push(int x) { method pop (line 17) | public void pop() { method top (line 23) | public int top() { method getMin (line 30) | public int getMin() { FILE: Min Steps in Infinite Grid.java class Solution (line 1) | public class Solution { method coverPoints (line 2) | public int coverPoints(int[] A, int[] B) { method getDistance (line 15) | int getDistance(int x1, int y1, int x2, int y2) { FILE: Min Sum Path in Matrix.java class Solution (line 1) | public class Solution { method minPathSum (line 3) | public int minPathSum(int[][] A) { method dfs (line 9) | public int dfs(int[][]A,int i,int j){ method valid (line 22) | public boolean valid(int[][]A,int i,int j){ FILE: Min Sum Path in Triangle.java class Solution (line 1) | public class Solution { method minimumTotal (line 2) | public int minimumTotal(ArrayList> list) { FILE: Min sum formed by digits - GFG/min-sum-formed-by-digits.java class GFG (line 8) | class GFG { method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 41) | class Solution { method minSum (line 43) | public static long minSum(int arr[], int n) FILE: Minimize Deviation in Array.java class Solution (line 1) | class Solution { method minimumDeviation (line 2) | public int minimumDeviation(int[] nums) { FILE: Minimum Add to Make Parentheses Valid/Minimum-Add-to-Make-Parentheses-Valid.cpp class Solution (line 1) | class Solution { method minAddToMakeValid (line 3) | int minAddToMakeValid(string s) { FILE: Minimum Cost to Set Cooking Time.java class Solution (line 1) | class Solution { method minCostSetTime (line 2) | public int minCostSetTime(int startAt, int moveCost, int pushCost, int... FILE: Minimum Cost to cut a board into squares.cpp class Solution (line 1) | class Solution { method minimumCostOfBreaking (line 3) | int minimumCostOfBreaking(vector X, vector Y, int M, int N){ FILE: Minimum Cost to cut a board into squares.java class Solution (line 1) | class Solution { method minimumCostOfBreaking (line 2) | public static int minimumCostOfBreaking(int[] X, int[] Y,int M,int N) { FILE: Minimum Cost to cut a board into squares.py class Solution (line 2) | class Solution: method minimumCostOfBreaking (line 3) | def minimumCostOfBreaking(self, X, Y, M, N): FILE: Minimum Exchange GFG/MinimumExchange.cpp class Solution (line 1) | class Solution { method MinimumExchange (line 3) | int MinimumExchange(vector>matrix){ FILE: Minimum Exchange gfg easy sep12.cpp class Solution (line 4) | class Solution { method MinimumExchange (line 6) | int MinimumExchange(vector>matrix){ function main (line 38) | int main(){ FILE: Minimum Exchange.java class Solution (line 1) | class Solution method MinimumExchange (line 3) | public int MinimumExchange(char[][] matrix) { method Count (line 24) | private int Count(char x, char y, char[][] matrix) { FILE: Minimum Lights to Activate.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int[] a, int b) { FILE: Minimum Number in a sorted rotated array - GFG/minimum-number-in-a-sorted-rotated-array.java class Array (line 6) | class Array method main (line 8) | public static void main(String args[])throws IOException class Solution (line 32) | class Solution method minNumber (line 35) | static int minNumber(int arr[], int l, int h){ FILE: Minimum Number in a sorted rotated array - GFG/minimum-number-in-a-sorted-rotated-array.py class Solution (line 4) | class Solution: method minNumber (line 7) | def minNumber(self, arr,low,high): function main (line 17) | def main(): FILE: Minimum Number of Vertices to Reach All Nodes.java class Solution (line 1) | class Solution { method findSmallestSetOfVertices (line 2) | public List findSmallestSetOfVertices(int n, List &A,vector &B,int N){ FILE: Minimum Sum of Absolute Differences of Pairs.java class Solution (line 1) | class Solution { method findMinSum (line 2) | long findMinSum(int[] A,int[] B,int N) { FILE: Minimum Sum of Absolute Differences of Pairs.py class Solution (line 1) | class Solution: method findMinSum (line 2) | def findMinSum(self, A,B,N): FILE: Minimum Sum of Four Digit Number After Splitting Digits.java class Solution (line 1) | class Solution { method minimumSum (line 2) | public int minimumSum(int num) { FILE: Minimum Swaps GFG (easy solution with comments).cpp class Solution (line 10) | class Solution { method minimumSwaps (line 12) | int minimumSwaps(int c[],int v[],int n,int k,int b,int T) function main (line 46) | int main(){ FILE: Minimum Swaps to Group All 1's Together II.cpp class Solution (line 1) | class Solution { method minSwaps (line 3) | int minSwaps(vector& nums) FILE: Minimum Swaps to Sort.java class Solution (line 1) | class Solution method minSwaps (line 4) | public int minSwaps(int nums[]){ FILE: Minimum Swaps.java class Solution (line 1) | class Solution { method minimumSwaps (line 2) | public static int minimumSwaps(int[] c, int[] v,int n,int k,int b,int ... FILE: Minimum Time To Fulfill All Orders Using BinarySearch And ApSeries Formula.java class Solution (line 1) | class Solution { method findMinTime (line 2) | public static int findMinTime(int n, int l, int[] arr) { method isAnswer (line 19) | public static boolean isAnswer(int arr[], int mid, int n) { method getNumber (line 29) | public static int getNumber(int a, int sum) { FILE: Minimum Time to Remove All Cars Containing Illegal Goods.java class Solution (line 1) | class Solution { method minimumTime (line 2) | public int minimumTime(String s) { FILE: Minimum X (xor) A - GFG/minimum-x-xor-a.java class GFG (line 8) | class GFG { method main (line 9) | public static void main(String[] args) throws IOException { class Solution (line 38) | class Solution { method minVal (line 39) | public static int minVal(int a, int b) { FILE: Minimum increment/decrement to make array non-Increasing - GFG/minimum-incrementdecrement-to-make-array-non-increasing.java class Solution (line 11) | class Solution method minOperations (line 13) | public static int minOperations(int a[], int n){ class GFG (line 29) | class GFG method main (line 32) | public static void main(String args[]) throws IOException { FILE: Minimum sum of absolute difference of pairs.cpp class Solution (line 9) | class Solution{ method findMinSum (line 11) | long long findMinSum(vector &A,vector &B,int N){ function main (line 30) | int main(){ FILE: Minimum time to fulfil all orders gfg hard.cpp class Solution (line 3) | class Solution{ method getDonuts (line 5) | int getDonuts(int rank, int time){ method isPossible (line 13) | bool isPossible(vector&A, int time, int donuts){ method findMinTime (line 19) | int findMinTime(int N, vector&A, int L){ FILE: Minimum time to fulfil all orders.java class Solution (line 1) | class Solution { method findMinTime (line 2) | public static int findMinTime(int n, int x, int[] arr) { method isPossible (line 19) | static boolean isPossible(int mid,int n,int[]arr){ FILE: Minimum time to fulfill all orders.java class Solution (line 1) | class Solution { method donutCount (line 2) | public static int donutCount(int min,int rank[]) method findMinTime (line 21) | public static int findMinTime(int n, int arrLength, int[] arr) { FILE: Minimum times A has to be repeated such that B is a substring of it - GFG/minimum-times-a-has-to-be-repeated-such-that-b-is-a-substring-of-it.py class Solution (line 3) | class Solution: method minRepeats (line 4) | def minRepeats(self, A, B): FILE: Minimum-Exchange/Solution.java class Solution (line 1) | class Solution method MinimumExchange (line 3) | public int MinimumExchange(char[][] m) FILE: Minimum-swaps.cpp class Solution (line 1) | class Solution { method minimumSwaps (line 3) | int minimumSwaps(int c[],int v[],int n,int k,int b,int T) FILE: Minimum_Cost_to_cut_a_board_into_squares_gfg_greedy.cpp class Solution (line 3) | class Solution { method minimumCostOfBreaking (line 5) | int minimumCostOfBreaking(vector X, vector Y, int M, int N){ FILE: Move Last Element to Front of a Linked List - GFG/move-last-element-to-front-of-a-linked-list.java class Node (line 6) | class Node method Node (line 11) | Node(int x) method inputList (line 17) | public static Node inputList(BufferedReader br) throws IOException method printList (line 29) | public static void printList(Node node) class GFG (line 43) | class GFG { method main (line 44) | public static void main(String[] args) throws IOException { class Solution (line 82) | class Solution { method moveToFront (line 83) | public static Node moveToFront(Node head) { FILE: Move Zeroes.java class Solution (line 1) | public class Solution { method solve (line 2) | public int[] solve(int[] A) { FILE: Move all zeroes to end of the array.java class Solution (line 1) | public class Solution { method solve (line 2) | public ArrayList solve(ArrayList A) { FILE: Move all zeros to the front of the linked list - GFG/move-all-zeros-to-the-front-of-the-linked-list.java class Node (line 5) | class Node{ method Node (line 8) | Node(int d){ class Zeroes (line 13) | class Zeroes{ method main (line 14) | public static void main(String[] args){ class GfG (line 58) | class GfG{ method moveZeroes (line 59) | public Node moveZeroes(Node head){ FILE: Moving on grid - GFG/moving-on-grid.java class GFG (line 6) | class GFG method main (line 8) | public static void main(String[] args) throws IOException class Solution (line 27) | class Solution method movOnGrid (line 29) | public String movOnGrid(int r, int c){ FILE: Multiple left rotations of the array.java class Solution (line 1) | public class Solution { method solve (line 3) | public int[][] solve(int[] A, int[] B) { method rotate (line 18) | int[] rotate(int[]arr,int n){ FILE: N-th_Tribonacci_Number_leetcode1137.cpp class Solution (line 1) | class Solution { method tribonacci (line 3) | int tribonacci(int n) { FILE: Nearest Smaller Element.java class Solution (line 1) | public class Solution { method prevSmaller (line 2) | public int[] prevSmaller(int[] A) { method findMin (line 10) | public int findMin(int[]a,int index){ method prevSmaller (line 24) | public ArrayList prevSmaller(ArrayList A) { class Solution (line 23) | public class Solution { method prevSmaller (line 2) | public int[] prevSmaller(int[] A) { method findMin (line 10) | public int findMin(int[]a,int index){ method prevSmaller (line 24) | public ArrayList prevSmaller(ArrayList A) { FILE: Nearly sorted - GFG/nearly-sorted.java class gfg (line 6) | class gfg method main (line 8) | public static void main(String args[]) class Solution (line 33) | class Solution method nearlySorted (line 36) | ArrayList nearlySorted(int arr[], int num, int k) FILE: Negative weight cycle - GFG/negative-weight-cycle.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 35) | class Solution{ method isNegativeWeightCycle (line 36) | public int isNegativeWeightCycle(int n, int[][] edges){ FILE: Next Pointer Binary Tree.java class Solution (line 1) | public class Solution { method connect (line 2) | public void connect(TreeLinkNode root) { FILE: Next Right Node.cpp class Solution (line 1) | class Solution method Node (line 4) | Node *nextRight(Node *root, int key) FILE: Next Right Node.java class Solution (line 1) | class Solution{ method nextRight (line 2) | Node nextRight(Node root, int key) FILE: Next element with greater frequency - GFG/next-element-with-greater-frequency.java class GFG (line 5) | class GFG method main (line 7) | public static void main (String[] args) class solver (line 36) | class solver method print_next_greater_freq (line 38) | static int[] print_next_greater_freq(int arr[], int n) FILE: Noble Integer.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(ArrayList A) { FILE: Node with highest edge score.cpp class Solution (line 1) | class Solution { method edgeScore (line 3) | int edgeScore(vector& e) { FILE: Nodes at even distance - GFG/nodes-at-even-distance.java class GFG (line 6) | class GFG{ method main (line 7) | public static void main(String [] args) throws IOException{ class Solution (line 35) | class Solution method countOfNodes (line 37) | int countOfNodes(ArrayList> graph, int n) method dfs (line 53) | static void dfs(int src,ArrayList> adj,Integer[] ar... FILE: Nth item through sum - GFG/nth-item-through-sum.py class Solution (line 3) | class Solution: method nthItem (line 4) | def nthItem(self, L1, L2, A, B, N): FILE: Number Formation - GFG/number-formation.java class GfG (line 6) | class GfG { method main (line 7) | public static void main(String args[]) { class Solution (line 25) | class Solution { method getSum (line 27) | public int getSum(int X, int Y, int Z) { FILE: Number of 1 Bits.java class Solution (line 1) | public class Solution { method numSetBits (line 2) | public int numSetBits(long a) { FILE: Number of Provinces.java class Solution (line 1) | class Solution { method numProvinces (line 2) | static int numProvinces(ArrayList> adj, int V) { method dfs (line 14) | static void dfs(boolean[]vis,ArrayList> adj,int cur... FILE: Number of Sundays.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(String A, int B) { FILE: Number of Ways to Arrive at Destination gfg med sep16.cpp class Solution (line 4) | class Solution { method countPaths (line 6) | int countPaths(int n, vector>& roads) { function main (line 36) | int main() { FILE: Number of Ways to Arrive at Destination.cpp class Solution (line 1) | class Solution { method countPaths (line 3) | int countPaths(int n, vector>& roads) { FILE: Number of Ways to Arrive at Destination.java class Solution (line 1) | class Solution { method countPaths (line 4) | static int countPaths(int n, List> roads) { method dfs (line 22) | static void dfs(int node,Map> map,boolean[]vis,int... FILE: Number of distict Words with k maximum contiguous vowels.java class Solution (line 1) | class Solution{ method find (line 6) | private static int find(int N, int K){ method kvowelwords (line 30) | public int kvowelwords(int N,int K){ FILE: Number of distinct Words with k maximum contiguous vowels - GFG/number-of-distinct-words-with-k-maximum-contiguous-vowels.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String args[])throws IOException class Solution (line 28) | class Solution{ method find (line 32) | private static int find(int N, int K){ method kvowelwords (line 56) | public int kvowelwords(int N,int K){ FILE: Number of positive integral solutions - GFG/number-of-positive-integral-solutions.py class Solution (line 3) | class Solution: method posIntSol (line 5) | def posIntSol(self,s): FILE: Number of ways - GFG/number-of-ways.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 24) | class Solution{ method arrangeTiles (line 25) | static long arrangeTiles(int n){ method nCr (line 38) | static long nCr(int n,int r){ FILE: Number-of-ways-to-arrive-destination/Solution.cpp class Solution (line 3) | class Solution { method countPaths (line 5) | int countPaths(int n, vector>& roads) { FILE: Numbers-With-Same-Consecutive-Differences.cpp class Solution (line 1) | class Solution { method solve (line 5) | void solve(int idx, int n, int k, int num){ method numsSameConsecDiff (line 23) | vector numsSameConsecDiff(int n, int k) { FILE: Occurence of Each Number.java class Solution (line 1) | public class Solution { method findOccurences (line 2) | public ArrayList findOccurences(ArrayList A) { FILE: Odd Even Rule.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int[] A, int B, int C) { FILE: POTD_gfg_The_Bit_Game .py class Solution (line 3) | class Solution: method swapBitGame (line 4) | def swapBitGame (self,N): FILE: Pair With Given Difference.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int[] A, int B) { FILE: Pairs With Given Xor.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int[] A, int B) { FILE: Pairs of Non Coinciding Points - GFG/pairs-of-non-coinciding-points.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 36) | class Solution { method numOfPairs (line 37) | public int numOfPairs(int[] x, int[] y, int n) { FILE: Palindrome List.java class Solution (line 1) | public class Solution { method lPalin (line 2) | public int lPalin(ListNode A) { method check (line 20) | public int check(ListNode A,ListNode B){ FILE: Palindrome Numbers.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A, int B, int C) { method check (line 23) | boolean check(String s) FILE: Palindrome Partitioning II.java class Solution (line 1) | public class Solution { method Solution (line 3) | Solution(){ method minCut (line 7) | static public int minCut(String str) { method solve (line 11) | static int solve(String str,int i,int j){ method isPalindrome (line 38) | static boolean isPalindrome(String str,int i,int j){ FILE: Palindrome Partitioning.java class Solution (line 1) | public class Solution { method partition (line 2) | public ArrayList> partition(String a) { method helper (line 8) | void helper(String s,int index,ArrayList path,ArrayList partitionLabels(string s) { FILE: Partition List.java class Solution (line 9) | public class Solution { method partition (line 10) | public ListNode partition(ListNode A, int B) { FILE: Partition a Linked List around a given value - GFG/partition-a-linked-list-around-a-given-value.java class Node (line 7) | class Node { method Node (line 10) | Node(int key) { class Partition (line 16) | class Partition { method main (line 19) | public static void main(String[] args) { method printList (line 43) | public static void printList(Node node) { class Solution (line 67) | class Solution { method partition (line 68) | public static Node partition(Node node, int x) { FILE: Partition a number into two divisible parts - GFG/partition-a-number-into-two-divisible-parts.java class GFG (line 6) | class GFG method main (line 8) | public static void main(String args[])throws IOException class Solution (line 26) | class Solution{ method stringPartition (line 27) | static String stringPartition(String S, int a, int b){ method div (line 42) | static boolean div(String s,int a){ FILE: Partition array to K subsets - GFG/partition-array-to-k-subsets.java class Partition_Arr_To_K_Subsets (line 4) | class Partition_Arr_To_K_Subsets method main (line 6) | public static void main(String args[]) class Solution (line 30) | class Solution { method isKPartitionPossible (line 31) | public boolean isKPartitionPossible(int[] arr,int n, int k) { method dfs (line 39) | public boolean dfs(int ind,int[] arr,int[] sum, int k,int target){ FILE: Partition array to K subsets - GFG/partition-array-to-k-subsets.py class Solution (line 4) | class Solution: method isKPartitionPossible (line 5) | def isKPartitionPossible(self, nums, k): FILE: Partition array to K subsets.java class Solution (line 1) | class Solution method isKPartitionPossible (line 3) | public boolean isKPartitionPossible(int a[], int n, int k) method dfs (line 18) | boolean dfs(int[]a,int[]subsets,int ind,int target){ FILE: Party in Town - GFG/party-in-town.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 35) | class Solution{ method dfs (line 36) | static int dfs(ArrayList> adj, int start, boolean[]... method partyHouse (line 55) | static int partyHouse(int N, ArrayList> adj) FILE: Pascal's Triangle.java class Solution (line 1) | class Solution { method generate (line 2) | public List> generate(int numRows) { FILE: Path in Directed Graph.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A, int[][] B) { method solve (line 33) | public int solve(int A, int[][] B) { class Solution (line 32) | public class Solution { method solve (line 2) | public int solve(int A, int[][] B) { method solve (line 33) | public int solve(int A, int[][] B) { FILE: Path in Matrix.java class Solution (line 1) | public class Solution { method checkPath (line 2) | public int checkPath(int[][] A) { method dfs (line 12) | boolean dfs(int i,int j,int[][]A){ FILE: Path with good nodes!.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int[] type, int[][] B, int C) { method dfs (line 13) | private int dfs(int root,int[] type, int goodNodes, int par, ArrayList... FILE: Perfect Peak of Array.java class Solution (line 1) | public class Solution { method perfectPeak (line 2) | public int perfectPeak(int[] A) { FILE: Permutation in String.java class Solution (line 1) | class Solution { method checkInclusion (line 2) | public boolean checkInclusion(String s1, String s2) { method zeroCount (line 22) | private boolean zeroCount(int[] count) { method checkInclusion (line 34) | public boolean checkInclusion(String s1, String s2) { class Solution (line 33) | class Solution { method checkInclusion (line 2) | public boolean checkInclusion(String s1, String s2) { method zeroCount (line 22) | private boolean zeroCount(int[] count) { method checkInclusion (line 34) | public boolean checkInclusion(String s1, String s2) { FILE: Permutation with Spaces - GFG/permutation-with-spaces.java class GFG (line 8) | class GFG method main (line 10) | public static void main(String args[])throws IOException class Solution (line 37) | class Solution{ method permutation (line 39) | ArrayList permutation(String S){ method helper (line 44) | public void helper(String curr,String s){ FILE: Permutations.java class Solution (line 1) | public class Solution { method permute (line 3) | public ArrayList> permute(ArrayList A) { method dfs (line 10) | public void dfs(ArrayList curr,ArrayList A,boolean[]... FILE: Polynomial Addition - GFG/polynomial-addition.java class Node (line 4) | class Node{ method Node (line 8) | Node(int a,int b) class GFG2 (line 15) | class GFG2 method main (line 17) | public static void main(String args[]) class Solution (line 84) | class Solution method addPolynomial (line 86) | public static Node addPolynomial(Node p1,Node p2) FILE: Postorder Traversal (Iterative).java class Tree (line 1) | class Tree { method postOrder (line 2) | ArrayList postOrder(Node node) { FILE: Postorder Traversal.py class Solution (line 1) | class Solution: method postorderTraversal (line 4) | def postorderTraversal(self, A): FILE: Pots of Gold Game.java class GfG (line 1) | class GfG method maxCoins (line 3) | public static int maxCoins(int A[],int n) method dfs (line 9) | static int dfs(int[]A,int i,int j,int[][]dp){ FILE: Power Of 2 and Subsequences GFG/powerOf2Sub.cpp function numberOfSubsequences (line 1) | long long numberOfSubsequences(int N, long long A[]){ FILE: Power Of 2 and Subsequences.cpp function isPowerOfTwo (line 2) | bool isPowerOfTwo(long long x){ function numberOfSubsequences (line 5) | long long numberOfSubsequences(int N, long long A[]){ FILE: Power Of 2 and Subsequences.java class Solution (line 1) | class Solution{ method numberOfSubsequences (line 2) | static Long numberOfSubsequences(int N, ArrayList A){ FILE: Power Of 2 and Subsequences.py class Solution (line 1) | class Solution: method numberOfSubsequences (line 2) | def numberOfSubsequences (ob,N,A): FILE: Power of 2 and Subsequences.cpp class Solution (line 1) | class Solution{ method numberOfSubsequences (line 4) | long long numberOfSubsequences(int N, long long A[]){ FILE: Power of 2 and Subsequences.java class Solution (line 1) | class Solution{ method numberOfSubsequences (line 2) | static Long numberOfSubsequences(int N, ArrayList A){ FILE: Power-of-2-&-Subsequences/Solution.cpp class Solution (line 1) | class Solution{ method numberOfSubsequences (line 3) | long long numberOfSubsequences(int N, long long A[]){ FILE: Preorder Traversal.java class Solution (line 14) | public class Solution { method preorderTraversal (line 16) | public ArrayList preorderTraversal(TreeNode A) { method pre (line 21) | void pre(TreeNode root){ FILE: Preorder to BST.java method post_order (line 1) | public static Node post_order(int pre[], int size) method dfs (line 10) | static Node dfs(int key,Node head){ FILE: Previous number in one swap - GFG/previous-number-in-one-swap.py class Solution (line 2) | class Solution: method previousNumber (line 3) | def previousNumber (ob,S): FILE: Prim's_Algorithm.cpp function main (line 3) | int main(){ FILE: Prime Sum.java class Solution (line 1) | public class Solution { method prime (line 2) | static boolean[] prime(int n) { method primesum (line 13) | public ArrayList primesum(int A) { FILE: Print Diagonally - GFG/print-diagonally.java class GFG (line 6) | class GFG method main (line 8) | public static void main(String args[])throws IOException class Solution (line 37) | class Solution{ method downwardDigonal (line 38) | static ArrayList downwardDigonal(int N, int A[][]) FILE: Print Pattern using String.java class Solution (line 1) | class Solution{ method pattern (line 2) | static List pattern(int n){ FILE: Print the pattern gfg sep_4.cpp class Solution (line 7) | class Solution{ method pattern (line 9) | vector pattern(int n){ method pattern (line 41) | vector pattern(int n){ class Solution (line 39) | class Solution{ method pattern (line 9) | vector pattern(int n){ method pattern (line 41) | vector pattern(int n){ FILE: Print the pattern.java class Solution (line 1) | class Solution{ method pattern (line 2) | static List pattern(int n){ FILE: Probability of Knight - GFG/probability-of-knight.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 33) | class Solution method isValid (line 35) | public static boolean isValid(int ni, int nj, int n){ method findProb (line 43) | public double findProb(int N, int start_x, int start_y, int step){ FILE: Product of Digits.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A) { FILE: Product of Primes - GFG/product-of-primes.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 26) | class Solution{ method primeProduct (line 28) | static long primeProduct(long L, long R){ method isPrime (line 38) | static boolean isPrime(long n){ FILE: Profit Maximisation.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int[] A, int B) { FILE: Pythagorean Triplets.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int n) { method isTriplet (line 14) | public boolean isTriplet(int a,int b,int c){ FILE: Queries on Strings - GFG/queries-on-strings.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 37) | class Solution method SolveQueris (line 39) | public int[] SolveQueris(String str, int[][] Query) FILE: Queries on a Matrix.java class Solution (line 1) | class Solution { method solveQueries (line 2) | public int[][] solveQueries(int n, int[][] Queries) { FILE: Queue using two Stacks.java class StackQueue (line 1) | class StackQueue method Push (line 7) | void Push(int x) method Pop (line 15) | int Pop() FILE: QuickSort on Doubly Linked List.java class GfG (line 1) | class GfG method partition (line 3) | public static Node partition(Node l, Node h) method swap (line 24) | static void swap(Node a,Node b){ FILE: Rank The Permutations - GFG/rank-the-permutations.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 27) | class Solution method findRank (line 29) | public long findRank(String s){ method fact (line 46) | long fact(int n){ FILE: Rat Maze With Multiple Jumps - GFG/rat-maze-with-multiple-jumps.java class GFG (line 5) | class GFG method main (line 7) | public static void main(String[] args) throws IOException class Solution (line 34) | class Solution method ShortestDistance (line 36) | public int[][] ShortestDistance(int[][] matrix){ method solver (line 53) | public boolean solver(int[][] matrix,int[][] ans,int i,int j){ method isValid (line 70) | public boolean isValid(int x,int y,int[][] matrix){ FILE: Reaching the heights - GFG/reaching-the-heights.java class Array (line 13) | class Array { method main (line 16) | public static void main (String[] args) throws IOException{ class Complete (line 65) | class Complete{ method reaching_height (line 69) | public static ArrayList reaching_height (int n, int arr[]) { FILE: Rearrange Geek and his Classmates.java class Solution (line 1) | class Solution method prank (line 3) | void prank(long[] a, int n) method prank (line 18) | void prank(long[] a, int n) class Solution (line 16) | class Solution method prank (line 3) | void prank(long[] a, int n) method prank (line 18) | void prank(long[] a, int n) FILE: Recursively remove all adjacent duplicates - GFG/recursively-remove-all-adjacent-duplicates.java class GFG (line 7) | class GFG { method main (line 8) | public static void main (String[] args) throws IOException { class Solution (line 22) | class Solution{ method remove (line 23) | String remove(String s) { FILE: Redundant Braces.java class Solution (line 1) | public class Solution { method braces (line 2) | public int braces(String s) { FILE: Region in BinaryMatrix.java class Solution (line 1) | public class Solution { method solve (line 4) | public int solve(int[][] A) { method dfs (line 20) | public int dfs(int i,int j){ FILE: Remove Consecutive Characters.java class Solution (line 1) | public class Solution { method solve (line 2) | public String solve(String A, int B) { FILE: Remove Covered Intervals.java class Solution (line 1) | class Solution { method removeCoveredIntervals (line 2) | public int removeCoveredIntervals(int[][] nums) { FILE: Remove Duplicates from Sorted Array II.java class Solution (line 1) | class Solution { method removeDuplicates (line 2) | public int removeDuplicates(int[] nums) { method removeDuplicates (line 30) | public int removeDuplicates(int[] nums) { method removeDuplicates (line 43) | public int removeDuplicates(ArrayList a) { class Solution (line 29) | class Solution { method removeDuplicates (line 2) | public int removeDuplicates(int[] nums) { method removeDuplicates (line 30) | public int removeDuplicates(int[] nums) { method removeDuplicates (line 43) | public int removeDuplicates(ArrayList a) { class Solution (line 42) | public class Solution { method removeDuplicates (line 2) | public int removeDuplicates(int[] nums) { method removeDuplicates (line 30) | public int removeDuplicates(int[] nums) { method removeDuplicates (line 43) | public int removeDuplicates(ArrayList a) { FILE: Remove Duplicates from Sorted List II.java class Solution (line 1) | class Solution { method deleteDuplicates (line 2) | public ListNode deleteDuplicates(ListNode head) { FILE: Remove Duplicates from Sorted List.java class Solution (line 1) | public class Solution { method deleteDuplicates (line 2) | public ListNode deleteDuplicates(ListNode A) { FILE: Remove Half Nodes.java class Solution (line 1) | public class Solution { method solve (line 2) | public TreeNode solve(TreeNode A) { FILE: Remove K Digits.java class Solution (line 1) | class Solution { method removeKdigits (line 2) | public String removeKdigits(String num, int k) { FILE: Remove Nth Node from List End.java class Solution (line 1) | public class Solution { method removeNthFromEnd (line 2) | public ListNode removeNthFromEnd(ListNode A, int B) { FILE: Remove leading zeros from an IP address.java class Solution (line 1) | class Solution method newIPAdd (line 3) | public String newIPAdd(String S) FILE: Repeat and Missing Number Array.java class Solution (line 1) | public class Solution { method repeatedNumber (line 3) | public int[] repeatedNumber(final int[] A) { FILE: Repeated Character.java class Solution (line 3) | class Solution method firstRep (line 5) | char firstRep(String S) method firstRep (line 24) | char firstRep(String S) class Solution (line 22) | class Solution method firstRep (line 5) | char firstRep(String S) method firstRep (line 24) | char firstRep(String S) FILE: Replace every element with the least greater element on its right - GFG/replace-every-element-with-the-least-greater-element-on-its-right.java class IntArray (line 6) | class IntArray method input (line 8) | public static int[] input(BufferedReader br, int n) throws IOException method print (line 18) | public static void print(int[] a) method print (line 25) | public static void print(ArrayList a) class GFG (line 33) | class GFG { method main (line 34) | public static void main(String[] args) throws IOException { class Solution (line 58) | class Solution { method findLeastGreater (line 59) | public static ArrayList findLeastGreater(int n, int[] arr) { FILE: Return two prime numbers.java class Solution (line 1) | class Solution{ method primeDivision (line 4) | static List primeDivision(int n){ method isPrime (line 19) | static boolean isPrime(int n){ FILE: Reverse Level Order.java class Solution (line 15) | public class Solution { method solve (line 16) | public ArrayList solve(TreeNode node) { FILE: Reverse Spiral Form of Matrix - GFG/reverse-spiral-form-of-matrix.java class GFG (line 6) | class GFG{ method main (line 7) | public static void main(String args[])throws IOException class Solution (line 35) | class Solution method reverseSpiral (line 37) | public int[] reverseSpiral(int R, int C, int[][] a) FILE: Reverse a Stack using Recursion.cpp class Solution (line 1) | class Solution method insertAtBottom (line 4) | void insertAtBottom(stack &s,int &x) method solve (line 19) | void solve(stack &st) method Reverse (line 32) | stack Reverse(stack st) FILE: Reverse a string using Stack.java class Solution (line 1) | class Solution { method reverse (line 3) | public String reverse(String S){ FILE: Reverse a sublist of a linked list - GFG/reverse-a-sublist-of-a-linked-list.java class Node (line 7) | class Node method Node (line 11) | Node(int d) {data = d; next = null; } class insertion (line 13) | class insertion method addToTheLast (line 17) | public void addToTheLast(Node node) method printList (line 30) | void printList(Node head) method main (line 41) | public static void main(String args[])throws IOException class Solution (line 83) | class Solution method reverseBetween (line 85) | public static Node reverseBetween(Node head, int m, int n) FILE: Reverse the String.cpp function getLength (line 4) | int getLength(char ayu[]){ function reverse (line 12) | void reverse(char ayu[], int n){ function main (line 19) | int main(){ FILE: Reverse the String.java class Solution (line 1) | public class Solution { method solve (line 2) | public String solve(String s) { FILE: Reverse-Interger.java class Solution (line 1) | class Solution { method reverse (line 2) | public int reverse(int x) { FILE: Richest Customer Wealth.java class Solution (line 1) | class Solution { method maximumWealth (line 2) | public int maximumWealth(int[][] a) { method sum (line 9) | public int sum(int[][]a,int i){ FILE: Robots.java class Solution (line 1) | class Solution { method moveRobots (line 2) | public String moveRobots(String s1, String s2) { FILE: Roman To Integer.java class Solution (line 1) | public class Solution { method romanToInt (line 2) | public int romanToInt(String A) { method getValue (line 21) | int getValue(char ch){ FILE: Root to Leaf Paths With Sum.java class Solution (line 14) | public class Solution { method pathSum (line 16) | public ArrayList> pathSum(TreeNode A, int B) { method dfs (line 23) | public void dfs(TreeNode a,int b,ArrayList list,int curr){ FILE: Rotate Image.cpp class Solution (line 1) | class Solution { method rotate (line 3) | void rotate(vector>& matrix) { method transpose (line 7) | void transpose(vector>& matrix){ method reflect (line 17) | void reflect(vector>& matrix){ FILE: Rotate List.java class Solution (line 1) | class Solution { method rotateRight (line 2) | public ListNode rotateRight(ListNode head, int k) { method rotate (line 15) | public ListNode rotate(ListNode head,int k){ method rotateRight (line 36) | public ListNode rotateRight(ListNode head, int k) { method getListSize (line 58) | public int getListSize(ListNode head) { method rotateRight (line 74) | public ListNode rotateRight(ListNode A, int B) { class Solution (line 35) | class Solution { method rotateRight (line 2) | public ListNode rotateRight(ListNode head, int k) { method rotate (line 15) | public ListNode rotate(ListNode head,int k){ method rotateRight (line 36) | public ListNode rotateRight(ListNode head, int k) { method getListSize (line 58) | public int getListSize(ListNode head) { method rotateRight (line 74) | public ListNode rotateRight(ListNode A, int B) { class Solution (line 73) | public class Solution { method rotateRight (line 2) | public ListNode rotateRight(ListNode head, int k) { method rotate (line 15) | public ListNode rotate(ListNode head,int k){ method rotateRight (line 36) | public ListNode rotateRight(ListNode head, int k) { method getListSize (line 58) | public int getListSize(ListNode head) { method rotateRight (line 74) | public ListNode rotateRight(ListNode A, int B) { FILE: Rotate Matrix.java class Solution (line 1) | public class Solution { method rotate (line 2) | public void rotate(ArrayList> arr) { FILE: Salutes.java class Solution (line 1) | public class Solution { method countSalutes (line 2) | public Long countSalutes(String A) { FILE: Save Your Life - GFG/save-your-life.java class Solution (line 6) | class Solution{ method maxSum (line 7) | static String maxSum(String w,char x[],int b[], int n){ class GFG (line 38) | class GFG method main (line 40) | public static void main(String args[])throws IOException FILE: Score of Parentheses.java class Solution (line 1) | class Solution { method scoreOfParentheses (line 2) | public int scoreOfParentheses(String s) { method scoreOfParentheses (line 24) | public int scoreOfParentheses(String S) { class Solution (line 23) | class Solution { method scoreOfParentheses (line 2) | public int scoreOfParentheses(String s) { method scoreOfParentheses (line 24) | public int scoreOfParentheses(String S) { FILE: Search for a Range.java class Solution (line 1) | public class Solution { method searchRange (line 3) | public int[] searchRange(final int[] A, int B) { method dfs (line 11) | void dfs(int[]a,int b,int[]ans,int i,int j){ FILE: Search in Bitonic Array!.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(ArrayList A, int B) { FILE: Search insert position of K in a sorted array - GFG/search-insert-position-of-k-in-a-sorted-array.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 30) | class Solution method searchInsertK (line 32) | static int searchInsertK(int a[], int N, int k){ FILE: Segregate 0s and 1s in an array.java class Solution (line 1) | public class Solution { method solve (line 2) | public ArrayList solve(ArrayList arr) { FILE: Self Permutation.java class Solution (line 1) | public class Solution { method permuteStrings (line 2) | public int permuteStrings(String A, String B) { FILE: Sequential Digits.java class Solution (line 1) | class Solution { method sequentialDigits (line 4) | public List sequentialDigits(int low, int high) { method dfs (line 14) | public void dfs(int num,List list){ FILE: Serialize.java class Solution (line 1) | public class Solution { method serialize (line 2) | public String serialize(ArrayList A) { FILE: Shop in Candy Store - GFG/shop-in-candy-store.java class GFG (line 6) | class GFG method main (line 8) | public static void main(String args[])throws IOException class Solution (line 34) | class Solution{ method candyStore (line 35) | static ArrayList candyStore(int arr[],int N,int k){ FILE: Shortest Distance in a Binary Maze - GFG/shortest-distance-in-a-binary-maze.java class GFG (line 10) | class GFG { method main (line 11) | public static void main(String[] args) throws IOException { class Solution (line 46) | class Solution { class Pair (line 48) | class Pair{ method Pair (line 51) | Pair(int i,int j){ method shortestPath (line 56) | int shortestPath(int[][] grid, int[] src, int[] des) { FILE: Shortest Path Visiting All Nodes.java class Solution (line 1) | class Solution { method shortestPathLength (line 2) | public int shortestPathLength(int[][] graph) { FILE: Shortest Path between Cities - GFG/shortest-path-between-cities.java class GFG (line 6) | class GFG{ method main (line 7) | public static void main(String args[]) throws IOException { class Solution (line 23) | class Solution { method shortestPath (line 25) | int shortestPath( int x, int y){ FILE: Shortest Uncommon Subsequence - GFG/shortest-uncommon-subsequence.cpp class Solution (line 6) | class Solution { method findShortest (line 8) | int findShortest(vector> &dp, string &S, string &T, int n,... method shortestUnSub (line 31) | int shortestUnSub(string S, string T) { function main (line 41) | int main() { FILE: Shortest Uncommon Subsequence - GFG/shortest-uncommon-subsequence.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 34) | class Solution { method shortestUnSub (line 35) | static int shortestUnSub(String S, String T) { FILE: Shortest Unique prefix for every word.java class Trie (line 1) | class Trie{ method Trie (line 5) | Trie(){ method insert (line 9) | static void insert(Trie root, String s){ method searchPrefix (line 20) | static String searchPrefix(Trie root, String s){ class Solution (line 35) | class Solution { method findPrefixes (line 36) | static String[] findPrefixes(String[] arr, int n) { FILE: Shortest_distance_in_Directed_acyclic_graph.cpp function toposort (line 5) | void toposort(vector> adj[], vector &vis, stack... function sdd (line 18) | void sdd(vector> adj[], int n, int src) function main (line 53) | int main() FILE: Simplify Path.java class Solution (line 1) | class Solution { method simplifyPath (line 2) | public String simplifyPath(String path) { FILE: Single Element in Sorted Array.py class Solution (line 6) | class Solution(object): method singleNonDuplicate (line 7) | def singleNonDuplicate(self, nums): FILE: Single Number II.java class Solution (line 1) | public class Solution { method singleNumber (line 3) | public int singleNumber(final int[] A) { FILE: Single Number.java class Solution (line 1) | public class Solution { method singleNumber (line 3) | public int singleNumber(final List A) { FILE: Sliding Window Maximum.java class Solution (line 1) | public class Solution { method slidingMaximum (line 3) | public int[] slidingMaximum(final int[] arr, int B) { FILE: Smaller on Left - GFG/smaller-on-left.java class Array (line 14) | class Array { method main (line 17) | public static void main (String[] args) throws IOException{ class Complete (line 52) | class Complete{ method Smallestonleft (line 53) | public static int[] Smallestonleft (int arr[], int n) { FILE: Smallest Subset With Greater Sum.Java class Solution (line 1) | class Solution { method minSubset (line 2) | int minSubset(int[] Arr,int N) { method sumOf (line 16) | long sumOf(int[] Arr ,int beg, int end){ FILE: Smallest Subset With Greater Sum.java class Solution (line 1) | class Solution { method minSubset (line 2) | int minSubset(int[] arr,int n) { FILE: Smallest Subset with Greater Sum GFG/SmallestSubsetWithGreterSum.cpp function minSubset (line 1) | int minSubset(vector &Arr,int N){ FILE: Smallest Subset with Greater Sum gfg s15.cpp class Solution (line 3) | class Solution{ method minSubset (line 5) | int minSubset(vector &Arr,int N){ function main (line 20) | int main(){ FILE: Smallest Subset with Greater Sum.Cpp function minSubset (line 1) | int minSubset(vector &Arr,int N){ FILE: Smallest Subset with Greater Sum.java class Solution (line 1) | class Solution { method minSubset (line 2) | int minSubset(int[] Arr,int N) { FILE: Smallest Subset with Max Sum.py class Solution (line 1) | class Solution: method minSubset (line 2) | def minSubset(self, A,N): FILE: Smallest Value of the Rearranged Number.java class Solution (line 1) | class Solution { method smallestNumber (line 2) | public long smallestNumber(long num) { FILE: Smallest factorial number - GFG/smallest-factorial-number.java class GFG (line 6) | public class GFG method main (line 8) | public static void main(String args[]) class Solution (line 26) | class Solution method findNum (line 28) | int findNum(int n) FILE: Smallest greater elements in whole array - GFG/smallest-greater-elements-in-whole-array.java class Array (line 14) | class Array { method main (line 17) | public static void main (String[] args) throws IOException{ class Complete (line 59) | class Complete{ method greaterElement (line 61) | public static int[] greaterElement (int arr[], int n) { FILE: Smallest number on left gfg med.cpp class Solution (line 10) | class Solution{ method leftSmaller (line 12) | vector leftSmaller(int n, int a[]){ function main (line 31) | int main(){ FILE: Smallest number on left.cpp class Solution (line 10) | class Solution{ method leftSmaller (line 12) | vector leftSmaller(int n, int a[]){ function main (line 43) | int main(){ FILE: Smallest number on left.java class Solution (line 1) | class Solution{ method leftSmaller (line 2) | static List leftSmaller(int n, int a[]) method leftSmaller (line 26) | static List leftSmaller(int n, int a[]) class Solution (line 25) | class Solution{ method leftSmaller (line 2) | static List leftSmaller(int n, int a[]) method leftSmaller (line 26) | static List leftSmaller(int n, int a[]) FILE: Smallest number with sum of digits as N and divisible by 10^N.cpp class Solution (line 1) | class Solution{ method string (line 3) | string digitsNum(int N) FILE: Smallest number with sum of digits as N and divisible by 10^N.java class Solution (line 1) | class Solution method digitsNum (line 3) | public String digitsNum(int N) FILE: Smallest number with sum of digits as N and divisible by 10^N.py class Solution (line 1) | class Solution: method digitsNum (line 2) | def digitsNum(self, N): FILE: Smallest number with sum of digits as N and divisible by 10powerN.cpp class Solution (line 6) | class Solution{ method string (line 8) | string digitsNum(int N) function main (line 40) | int main(){ FILE: Smallest sum contiguous subarray.cpp class Solution (line 1) | class Solution{ method smallestSumSubarray (line 3) | int smallestSumSubarray(vector& a){ method smallestSumSubarray (line 31) | int smallestSumSubarray(vector& a){ class Solution (line 29) | class Solution{ method smallestSumSubarray (line 3) | int smallestSumSubarray(vector& a){ method smallestSumSubarray (line 31) | int smallestSumSubarray(vector& a){ FILE: Smallest sum contiguous subarray.java class Solution (line 2) | class Solution method smallestSumSubarray (line 4) | static int smallestSumSubarray(int a[], int size) method smallestSumSubarray (line 22) | static int smallestSumSubarray(int a[], int size) class Solution (line 20) | class Solution method smallestSumSubarray (line 4) | static int smallestSumSubarray(int a[], int size) method smallestSumSubarray (line 22) | static int smallestSumSubarray(int a[], int size) FILE: Smallest sum contiguous subarray.py function smallestSumSubarray (line 1) | def smallestSumSubarray(A): FILE: Smallest window containing 0, 1 and 2.java class Solution (line 1) | class Solution { method smallestSubstring (line 2) | public int smallestSubstring(String S) { FILE: SmallestNumberWithSumOfDigitsAsNAndDivisbileBy10ToThePowerN.java class SmallestNumberWithSumOfDigitsAsNAndDivisbileBy10ToThePowerN (line 33) | public class SmallestNumberWithSumOfDigitsAsNAndDivisbileBy10ToThePowerN { method main (line 35) | public static void main(String[] args) { method digitsNum (line 44) | public String digitsNum(int N) { FILE: Solve-the-Sudoku - GFG/Solve-the-Sudoku.java class Driver_class (line 5) | class Driver_class method main (line 7) | public static void main(String args[]) class Solution (line 34) | class Solution method isValid (line 36) | static boolean isValid(int grid[][],int i, int j, int k){ method solve (line 52) | static boolean solve(int grid[][],int i,int j){ method SolveSudoku (line 78) | static boolean SolveSudoku(int grid[][]){return solve(grid,0,0);} method printGrid (line 80) | static void printGrid (int grid[][]) FILE: Sort Binary Linked List.java class Solution (line 1) | public class Solution { method solve (line 2) | public ListNode solve(ListNode A) { FILE: Sort Even and Odd Indices Independently.java class Solution (line 1) | class Solution { method sortEvenOdd (line 2) | public int[] sortEvenOdd(int[] nums) { FILE: Sort List.java class Solution (line 2) | class Solution { method sortList (line 3) | public ListNode sortList(ListNode head) { method sortList (line 35) | public ListNode sortList(ListNode head) { method merge (line 44) | ListNode merge(ListNode list1, ListNode list2) { method getMid (line 62) | ListNode getMid(ListNode head) { method merge (line 77) | public ListNode merge(ListNode A,ListNode B){ method sortList (line 93) | public ListNode sortList(ListNode A) { method getMiddle (line 105) | public ListNode getMiddle(ListNode A){ class Solution (line 34) | class Solution { method sortList (line 3) | public ListNode sortList(ListNode head) { method sortList (line 35) | public ListNode sortList(ListNode head) { method merge (line 44) | ListNode merge(ListNode list1, ListNode list2) { method getMid (line 62) | ListNode getMid(ListNode head) { method merge (line 77) | public ListNode merge(ListNode A,ListNode B){ method sortList (line 93) | public ListNode sortList(ListNode A) { method getMiddle (line 105) | public ListNode getMiddle(ListNode A){ class Solution (line 75) | public class Solution { method sortList (line 3) | public ListNode sortList(ListNode head) { method sortList (line 35) | public ListNode sortList(ListNode head) { method merge (line 44) | ListNode merge(ListNode list1, ListNode list2) { method getMid (line 62) | ListNode getMid(ListNode head) { method merge (line 77) | public ListNode merge(ListNode A,ListNode B){ method sortList (line 93) | public ListNode sortList(ListNode A) { method getMiddle (line 105) | public ListNode getMiddle(ListNode A){ FILE: Sort by Set Bit Count.java class Compute (line 1) | class Compute method sortBySetBitCount (line 3) | static void sortBySetBitCount(Integer arr[], int n) method countSetBits (line 13) | static int countSetBits(int n) class Compute (line 23) | class Compute method sortBySetBitCount (line 25) | static void sortBySetBitCount(Integer arr[], int n) FILE: Sorted Array To Balanced BST.java class Solution (line 1) | public class Solution { method sortedArrayToBST (line 3) | public TreeNode sortedArrayToBST(final int[] A) { method makeTree (line 6) | public TreeNode makeTree(int[]a,int start,int end){ FILE: Sorted Insert Position.java class Solution (line 1) | public class Solution { method searchInsert (line 2) | public int searchInsert(ArrayList a, int b) { FILE: Special Matrix.java class Solution (line 1) | class Solution{ method FindWays (line 3) | public int FindWays(int n, int m, int[][] bl){ FILE: Spidey Sense.java class Solution (line 1) | class Solution{ method add (line 5) | public static void add(char mat[][], int i, int j, boolean visited[][]... method bfs (line 13) | public static int bfs(char mat[][], int i, int j){ method findDistance (line 33) | public static int[][] findDistance(char mat[][], int n,int m){ FILE: Spiral Matrix.java class Solution (line 1) | public class Solution { method solve (line 2) | public int[][] solve(int[] A, int B, int C) { FILE: Spiral Order Matrix II.java class Solution (line 1) | public class Solution { method generateMatrix (line 2) | public int[][] generateMatrix(int n) { FILE: Split_Array_Into_Consecutive_subsequence.java class Solution (line 2) | class Solution { method isPossible (line 3) | public boolean isPossible(int[] nums) { FILE: Square Root of Integer.java class Solution (line 1) | public class Solution { method sqrt (line 2) | public int sqrt(int A) { FILE: Stack Permutation med gfg sep7.cpp class Solution (line 4) | class Solution{ method isStackPermutation (line 6) | int isStackPermutation(int N,vector &A,vector &B){ function main (line 29) | int main(){ FILE: Stack Permutations [GFG POTD(07-09-22)].java class Solution (line 1) | class Solution { method isStackPermutation (line 2) | public static int isStackPermutation(int n, int[] ip, int[] op) { FILE: Stack Permutations.java class Solution (line 1) | class Solution { method isStackPermutation (line 2) | public static int isStackPermutation(int n, int[] ip, int[] op) { FILE: Stack Permutations.py function isStackPermutation (line 1) | def isStackPermutation(N, A, B): FILE: Step by Step.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A) { FILE: Stepping Numbers - GFG/stepping-numbers.java class GFG (line 10) | class GFG method main (line 12) | public static void main(String args[])throws IOException class Solution (line 37) | class Solution{ method steppingNumbers (line 38) | int steppingNumbers(int n, int m){ FILE: Stock buy and sell - GFG/Stock buy and sell.cpp function stockBuySell (line 6) | void stockBuySell(int price[], int n) { FILE: Stone Game IV.java class Solution (line 1) | class Solution { method winnerSquareGame (line 2) | public boolean winnerSquareGame(int n) { FILE: String And Its Frequency.java class Solution (line 1) | public class Solution { method solve (line 2) | public String solve(String A) { FILE: String formation from substring - GFG/string-formation-from-substring.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 26) | class Solution { method isRepeat (line 27) | int isRepeat(String s) { FILE: String to Integer (atoi).java class Solution (line 1) | class Solution { method myAtoi (line 2) | public int myAtoi(String s) { FILE: Subarray Sum Equals K.java class Solution (line 1) | public class Solution { method subarraySum (line 2) | public int subarraySum(int[] nums, int k) { FILE: Subarray with equal occurences!.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int[] A, int B, int C) { FILE: Subarray with given sum - GFG/Subarray with given sum.cpp class Solution (line 7) | class Solution method subarraySum (line 10) | vector subarraySum(int arr[], int n, long long s) function main (line 84) | int main() FILE: Subset.java class Solution (line 1) | public class Solution { method subsets (line 7) | public ArrayList> subsets(ArrayList A) { method subset (line 35) | private void subset(int index, ArrayList arr) { FILE: Subsets II.java class Solution (line 1) | public class Solution { method subsetsWithDup (line 3) | public ArrayList> subsetsWithDup(ArrayList... method dfs (line 10) | public void dfs(int idx,ArrayList a,ArrayList curr){ FILE: Subsets with XOR value - GFG/subsets-with-xor-value.java class Solution (line 11) | class Solution{ method subsetXOR (line 12) | static int subsetXOR(int arr[], int N, int K) { class GFG (line 38) | class GFG method main (line 40) | public static void main(String args[])throws IOException FILE: Subsets.java class Solution (line 1) | class Solution { method subsets (line 2) | public List> subsets(int[] nums) { method backtrack (line 8) | private void backtrack(List> list , List tempLi... FILE: Sum Of k smallest elements in BST.java class Tree (line 1) | class Tree { method fun (line 3) | public static void fun(Node root,ArrayListaa){ method sum (line 23) | int sum(Node root, int k) { FILE: Sum Root to Leaf Numbers.java class Solution (line 14) | public class Solution { method dfs (line 16) | public void dfs(TreeNode a,int num){ method sumNumbers (line 27) | public int sumNumbers(TreeNode A) { FILE: Sum of 7's Multiple.java class Solution (line 1) | public class Solution { method solve (line 2) | public long solve(int A, int B) { method apSum (line 12) | public long apSum(long n){ FILE: Sum of K smallest elements in BST.cpp function inorder (line 1) | void inorder(Node* node,int &k,int &sum) function sum (line 15) | int sum(Node* root, int k) FILE: Sum of Root To Leaf Binary Numbers.java class Solution (line 5) | class Solution { method sumRootToLeaf (line 6) | public int sumRootToLeaf(TreeNode root) { method sumRootToLeaf (line 61) | public int sumRootToLeaf(TreeNode root) { method pathSumRootToLeaf (line 42) | private int pathSumRootToLeaf(TreeNode root, int parentNodeSum){ class Solution (line 60) | class Solution { method sumRootToLeaf (line 6) | public int sumRootToLeaf(TreeNode root) { method sumRootToLeaf (line 61) | public int sumRootToLeaf(TreeNode root) { FILE: Sum of elements between k1'th and k2'th smallest elements - GFG/sum-of-elements-between-k1th-and-k2th-smallest-elements.java class GFG (line 8) | class GFG { method main (line 9) | public static void main(String[] args) throws IOException class Solution (line 38) | class Solution { method sumBetweenTwoKth (line 39) | public static long sumBetweenTwoKth(long A[], long N, long K1, long K2) FILE: Sum of k smallest elements in BST.cpp function sum (line 3) | int sum(Node* root, int k) FILE: Sum of k smallest elements in BST.java class Tree (line 2) | class Tree { method sum (line 5) | int sum(Node root, int k) { method dfs (line 12) | void dfs(Node root,int k){ FILE: Sum of nodes within k distance from target - GFG/sum-of-nodes-within-k-distance-from-target.java class Node (line 7) | class Node{ method Node (line 11) | Node(int data){ class GfG (line 18) | class GfG { method buildTree (line 20) | static Node buildTree(String str){ method main (line 77) | public static void main (String[] args) throws IOException{ class solver (line 117) | class solver{ method sum_at_distK (line 121) | static int sum_at_distK(Node root, int target, int k){ method bfs (line 133) | static void bfs(Node curr,Setset,int dis,int k){ method addAll (line 142) | static void addAll(Node root){ FILE: Sum of two large numbers.cpp class Solution (line 1) | class Solution { method string (line 3) | string findSum(string X, string Y) { FILE: Sum of two large numbers.java class Solution (line 1) | class Solution { method findSum (line 2) | String findSum(String X, String Y) { FILE: Sum of two numbers without using arithmetic operators - GFG/sum-of-two-numbers-without-using-arithmetic-operators.java class GFG (line 8) | class GFG method main (line 10) | public static void main(String[] args) throws NumberFormatException, I... class Solution (line 30) | class Solution{ method sum (line 31) | int sum(int a , int b){ FILE: Summary Ranges.java class Solution (line 1) | class Solution { method summaryRanges (line 2) | public List summaryRanges(int[] nums) { FILE: Super Primes - GFG/super-primes.java class GFG (line 7) | class GFG { method main (line 8) | public static void main(String args[]) throws IOException { class Solution (line 24) | class Solution { method superPrimes (line 25) | int superPrimes(int n) { FILE: Swap Bits.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int n, int p, int q) { FILE: Swap Kth nodes from ends - GFG/swap-kth-nodes-from-ends.java class Node (line 8) | class Node method Node (line 13) | Node(int data) class LinkedList (line 20) | class LinkedList method addToTheLast (line 25) | public static void addToTheLast(Node node) method main (line 41) | public static void main(String args[]) method check (line 80) | static boolean check(Node before[], Node after[], int num, int K) method addressstore (line 90) | static void addressstore(Node arr[], Node head) class GFG (line 118) | class GFG{ method swapkthnode (line 120) | Node swapkthnode(Node head, int num, int k){ FILE: Swap Nodes in Pairs.java class Solution (line 1) | class Solution { method swapPairs (line 2) | public ListNode swapPairs(ListNode head) { FILE: Swap bits - GFG/swap-bits.java class GFG (line 9) | class GFG method main (line 11) | public static void main(String args[])throws IOException class Solution (line 36) | class Solution{ method swapBits (line 38) | int swapBits(int x, int p1, int p2, int n){ FILE: Symmetric Binary Tree.java class Solution (line 1) | public class Solution { method isSymmetric (line 2) | public int isSymmetric(TreeNode A) { method isMirrorUtil (line 8) | public static boolean isMirrorUtil(TreeNode root1, TreeNode root2){ FILE: The Bit Game easy s24.cpp class Solution (line 3) | class Solution{ method swapBitGame (line 5) | int swapBitGame(long long N){ function main (line 17) | int main() FILE: The bit Game.cpp class Solution (line 1) | class Solution{ method swapBitGame (line 3) | int swapBitGame(long long N){ FILE: Theft at World Bank - GFG/theft-at-world-bank.java class GFG (line 7) | class GFG method main (line 9) | public static void main(String[] args) throws IOException class Pair (line 39) | class Pair{ method Pair (line 43) | Pair(long weight, long profit, double ratio){ class Solution (line 49) | class Solution method isPerfect (line 51) | public boolean isPerfect(long num){ method maximumProfit (line 55) | public double maximumProfit(int n, long c, long w[], long p[]) FILE: Topo_sort.cpp function funct (line 3) | void funct(vector adj[],vector &vis,stack&st,int node){ function topo (line 13) | void topo(int n, vector adj[]){ function main (line 32) | int main(){ FILE: Total Moves For Bishop!.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A, int B) { FILE: Towers_CSES.cpp function solve (line 4) | void solve(){ function main (line 23) | int main() FILE: Trailing Zeroes.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(int A) { FILE: Transfiguration.java class Solution (line 1) | class Solution method transfigure (line 3) | int transfigure (String A, String B) FILE: Tree Path Sum.java class Solution (line 1) | public class Solution { method hasPathSum (line 2) | public int hasPathSum(TreeNode A, int B) { FILE: Triangle and Square - GFG/triangle-and-square.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String [] args) throws IOException{ class Solution (line 23) | class Solution{ method countSquare (line 24) | int countSquare(int B){ FILE: Tricky Subset Problem - GFG/tricky-subset-problem.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 34) | class Solution{ method isPossible (line 35) | static int isPossible(long S, int N, long X, long A[]) FILE: Two Sum.java class Solution (line 1) | class Solution { method twoSum (line 2) | public int[] twoSum(int[] nums, int target) { FILE: Two Sum.py class Solution (line 1) | class Solution: method twoSum (line 2) | def twoSum(self, nums: List[int], target: int) -> List[int]: FILE: UTF-8-Validation med lc.cpp class Solution (line 5) | class Solution { method validUtf8 (line 7) | bool validUtf8(vector& data) { FILE: Union-Find - GFG/union-find.java class GFG (line 6) | public class GFG { method main (line 7) | public static void main(String[] args) throws IOException { class Solution (line 66) | class Solution method findPar (line 68) | public int findPar(int node,int par[]){ method union_ (line 73) | public void union_(int a, int b, int par[], int rank[]) method isConnected (line 88) | public Boolean isConnected(int a, int b, int par[], int rank[]) FILE: Unique Subsets - GFG/unique-subsets.java class GFG (line 6) | class GFG { method main (line 9) | public static void main (String[] args) { class solve (line 40) | class solve{ method AllSubsets (line 41) | public static ArrayList > AllSubsets(int arr[], in... method check (line 50) | public static void check(int arr[], int n,int index,ArrayList> &grid , int i , int j , int n , int m ,... method findMaxArea (line 24) | int findMaxArea(vector>& grid) FILE: Unit Area of largest region of 1's.java class Solution (line 1) | class Solution method findMaxArea (line 4) | public int findMaxArea(int[][] grid) method dfs (line 18) | int dfs(int[][]grid,int i,int j,boolean[][]vis){ method valid (line 32) | boolean valid(int[][]grid,int i,int j,boolean[][]vis){ method isSafe (line 44) | static boolean isSafe(int[][] grid,int row,int col,boolean[][] visited... method DFS (line 52) | void DFS(int[][] grid,int row,int col,boolean[][] visited,int ROW,int ... method findMaxArea (line 69) | public int findMaxArea(int[][] grid) class Solution (line 41) | class Solution method findMaxArea (line 4) | public int findMaxArea(int[][] grid) method dfs (line 18) | int dfs(int[][]grid,int i,int j,boolean[][]vis){ method valid (line 32) | boolean valid(int[][]grid,int i,int j,boolean[][]vis){ method isSafe (line 44) | static boolean isSafe(int[][] grid,int row,int col,boolean[][] visited... method DFS (line 52) | void DFS(int[][] grid,int row,int col,boolean[][] visited,int ROW,int ... method findMaxArea (line 69) | public int findMaxArea(int[][] grid) FILE: Valid Binary Search Tree.java class Solution (line 1) | public class Solution { method check (line 2) | int check(TreeNode a,int min,int max){ method isValidBST (line 7) | public int isValidBST(TreeNode root) { FILE: Valid Mountain Array.java class Solution (line 1) | class Solution { method validMountainArray (line 2) | public boolean validMountainArray(int[] A) { FILE: Valid Parentheses.java class Solution (line 1) | class Solution { method isValid (line 2) | public boolean isValid(String s) { FILE: Valid Password.java class Solution (line 1) | public class Solution { method solve (line 2) | public int solve(String A) { FILE: Validate Stack Sequences.java class Solution (line 1) | class Solution { method validateStackSequences (line 2) | public boolean validateStackSequences(int[] a, int[] b) { method validateStackSequences (line 30) | public boolean validateStackSequences(int[] arr, int[] pop) { class Solution (line 29) | class Solution { method validateStackSequences (line 2) | public boolean validateStackSequences(int[] a, int[] b) { method validateStackSequences (line 30) | public boolean validateStackSequences(int[] arr, int[] pop) { FILE: Verify Prime.java method prime (line 1) | static boolean prime(int n) FILE: Vertical Sum of a Binary Tree.java class Solution (line 14) | public class Solution { method verticalSum (line 17) | public ArrayList verticalSum(TreeNode A) { method dfs (line 29) | public void dfs(TreeNode a,Map map,int curr){ FILE: Villain Con - GFG/villain-con.java class GFG (line 7) | class GFG{ method main (line 8) | public static void main(String args[])throws IOException class Solution (line 32) | class Solution{ method minColour (line 33) | static int minColour(int N, int M, int mat[][]) { FILE: Vowel and Consonant Substrings!.java class Solution (line 1) | public class Solution { method solve (line 3) | public int solve(String A) { method vowel (line 20) | public boolean vowel(char c){ FILE: Wave Array.java class Solution (line 1) | public class Solution { method wave (line 2) | public ArrayList wave(ArrayList arr) { FILE: Ways to Decode.java class Solution (line 1) | public class Solution { method numDecodings (line 3) | public int numDecodings(String s) { FILE: Window String.java class Solution (line 1) | public class Solution { method minWindow (line 2) | public String minWindow(String A, String B) { FILE: Word Break - Part 2 - GFG/word-break-part-2.java class GFG (line 8) | class GFG{ method main (line 9) | public static void main(String args[])throws IOException class Solution (line 39) | class Solution{ method wordBreak (line 40) | static List wordBreak(int n, List dict, String s) method dfs (line 47) | static void dfs(List dict,String s,String sentence,List& wordDict){ method wordBreak (line 19) | vector wordBreak(string s, vector& wordDict) { FILE: Word Break II.java class Solution (line 1) | public class Solution { method wordBreak (line 3) | public ArrayList wordBreak(String A, ArrayList B) { method wordBreak (line 14) | public ArrayList wordBreak(String A, Set set, int i) { FILE: Word Break.java class Solution (line 1) | public class Solution { method wordBreak (line 2) | public int wordBreak(String A, String[] B) { method wordBreak (line 11) | private int wordBreak(String s, Set set, int start, Boolean[] ... FILE: Word Count.py class Solution (line 1) | class Solution: method solve (line 4) | def solve(self, A): FILE: Word Ladder I.cpp class Solution (line 1) | class Solution { method count (line 3) | int count(string a, string b){ method wordLadderLength (line 12) | int wordLadderLength(string startWord, string targetWord, vector... method bfs (line 19) | public int bfs(HashSet st, HashSet ed, HashSet... FILE: Word Pattern.java class Solution (line 1) | class Solution { method wordPattern (line 2) | public boolean wordPattern(String pattern, String s) { FILE: Word Wrap - GFG/word-wrap.java class GFG (line 5) | class GFG method main (line 7) | public static void main(String[] args) throws IOException class Solution (line 27) | class Solution{ method solveWordWrap (line 28) | public int solveWordWrap (int[] nums, int k){ method solveWordWrapRec (line 32) | public int solveWordWrapRec (int[] nums, int k, int idx, Map> zigzagLevelOrder(TreeNode root) { FILE: Zigzag String.java class Solution (line 1) | public class Solution { method convert (line 2) | public String convert(String input, int num) { FILE: alternate positive and negative.cpp function rearrange (line 1) | void rearrange(int arr[], int n) { FILE: check if array is sorted and rotated/check-if-array-is-rotated-and-sorted.cpp class Solution (line 1) | class Solution { method check (line 3) | bool check(vector& nums) { FILE: depth first search.cpp function dfs (line 5) | void dfs(vector* adj,int node,vector& visited) function main (line 18) | int main() FILE: rotate-array/rotate-array.cpp class Solution (line 1) | class Solution { method rotate (line 3) | void rotate(vector& nums, int k) { FILE: sorting-characters-by-frequency/sorting-characters-by-frequency.cpp function compare (line 1) | bool compare(const string& a, const string &b){ class Solution (line 4) | class Solution { method string (line 6) | string frequencySort(string s) { FILE: split array into consecutive subsequences/split-array-into-consecutive-subsequences.cpp class Solution (line 1) | class Solution { method isPossible (line 3) | bool isPossible(vector& nums) { FILE: string-to-integer(atoi)/string-to-integer(atoi).cpp class Solution (line 2) | class Solution { method myAtoi (line 4) | int myAtoi(string str) { FILE: sum of k smallest elements in BST.cpp function inorder (line 1) | void inorder(Node* node,vector &ans) function sum (line 10) | int sum(Node* root, int k) FILE: valid parenthesis.java class Solution (line 1) | class Solution { method isValid (line 2) | public boolean isValid(String s) {