Types & classes — github.com/codedecks-in/LeetCode-Solutions

CodeHub MCPcopy Create free account

hub / github.com/codedecks-in/LeetCode-Solutions / types & classes

Types & classes171 in github.com/codedecks-in/LeetCode-Solutions

⨍ Functions 283◇ Types & classes 171

↓ 3 callersClassListNode

Python/LRUCache.py:1

↓ 1 callersClassSolution

Python/group_anagram.py:11

ClassArmstrongNum

1134. Armstrong Number The k-digit number N is an Armstrong number if and only if the kth power of each digit sums to N. Given a positive integer N, r

Java/Armstrong-Number.java:10

ClassCBTInserter

Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }

Java/complete-binary-tree-inserter.java:10

ClassCustomStack

Java/Design-a-Stack-With-Increment-Operation.java:1

Problem Name : Redundant Connection Concept Involved : Trees, Union Find Execution Time : 1 ms Memory Consumed : 39 mb

Java/Redundant-Connection/redundant-connection.java:9

Java/graph_connectivity_with_threshold.java:10

ClassHappyNumber

Java/Happy-Number.java:1

ClassIntegerToRoman

Java/integer-to-roman.java:1

Python/LRUCache.py:8

Here I am using a hashmap to store a node pointer by a key. It will give us O(1) for all operations.

C++/LRU-Cache.cpp:2

LRU Cache Logic : maintain doubly linked List for insertion at head and deletion from tail and maintain hashmap of key as key and value as

Java/LRU-Cache.java:9

C++/merge-k-sorted-lists.cpp:14

ClassMyCircularDeque

Java/design-circular-deque.java:5

ClassMyCircularQueue

Python/622-Design-Circular-Queue.py:22

C++/LRU-Cache.cpp:4

Java/LRU-Cache.java:78

Your NumArray object will be instantiated and called as such: NumArray obj = new NumArray(nums); obj.update(i,val); int param_2 = obj.sumRange(i,j);

Java/Range-Sum-Query-Mutable.java:13

ClassNumberOfIslands

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen

Java/NumberOfIslands.java:18

Problem Name : Path with Minimum Effort Concept Involved : Graphs, Dijkstra's Shortest Path Execution Time : 1229 ms Memory Consumed : 39.4 mb

Java/path-with-minimum-effort.java:9

ClassRecentCounter

C++/Number-of-Recent-Calls.cpp:2

ClassRomanToInteger

Java/roman-to-integer.java:1

Python/decode-ways.py:6

Python/5_LongestPalindromicSubstring.py:22

Python/100.SameTree.py:13

Python/single-number-iii.py:55

Python/1_TwoSum.py:31

Python/reorganize-string.py:9

Python/single-number-ii.py:1

Python/find-minimum-in-rotated-sorted-array.py:6

Python/search-in-rotated-sorted-array.py:9

Python/pascals-triangle-ii.py:6

Python/single-number.py:1

Python/496_nextgreaterelement.py:1

Python/35.SearchInsertPosition.py:6

Python/rotate-array.py:1

Python/56_MergeIntervals.py:20

Python/edit-distance.py:6

Python/longest-valid-parentheses.py:7

Python/container_with_most_water.py:1

The Brute Force Solution Time Complexity: O(N^3) Space Complexity: O(1)

Python/count-good-triplets.py:1

Python/wildcard-matching.py:9

Python/trapping_rain.py:1

Python/1042_FlowerPlantingwithNoAdjacent.py:17

Python/150.EvaluateReversePolishNotation.py:6

Python/maximum-depth-of-binary-tree.py:12

Python/word-break-1.py:8

Python/best-time-to-buy-and-sell-stock-ii.py:6

Python/binary-tree-inorder-traversal.py:12

Python/divisor-game.py:6

Python/621-Task-Scheduler.py:20

Python/20_ValidParentheses.py:22

Python/Iterative-Inorder-tree-traversal.py:7

Python/detect-capital.py:22

Python/101.SymmetricTree.py:6

Python/50.Powxn.py:6

Python/994_Rotting_Oranges.py:4

Time Complexity: O(N) Space Complexity: O(1)

Python/split-a-string-in-balanced-strings.py:1

Python/contains-duplicate.py:6

C++/Reverse-Integer.cpp:1

C++/Largest-Rectangle-in-Histogram.cpp:5

CPP BFS solution Time complexity O(V+E) Space Complexity O(V)

C++/Is-Graph-Bipartite.cpp:4

I am using here backtracking with memoization (look at 'used').

C++/Unique-Paths-III.cpp:2

C++/Baseball-Game.cpp:1

C++/Count-Different-Palindromic-Subsequences.cpp:27

CPP BFS solution Time complexity O(V+E) Space Complexity O(V)

C++/Course-Schedule-II.cpp:4

Time complexity O(V+E) Space Complexity O(V)

C++/Network-delay-time.cpp:3

C++/k-closest-points-to-origin.cpp:9

C++/Find-The-Difference.cpp:10

C++/Number-Complement.cpp:7

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

C++/Recover-a-Tree-From-Preorder-Traversal.cpp:12

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

C++/Binary-Tree-Cameras.cpp:12

C++/Cherry-Pickup-II.cpp:1

C++/decode-string.cpp:1

C++/Crawler-Log-Folder.cpp:1

C++/remove-all-adjacent-duplicates-in-string.cpp:1

C++/Best-Time-to-Buy-and-Sell-Stock-II.cpp:5

C++/Course-Schedule.cpp:13

Solved using backtracking

C++/combination-sum.cpp:2

C++/Critical-Connections-in-a-Network.cpp:5

C++/Single-Number-III.cpp:7

C++/Single-Number-II.cpp:7

C++/maximum-subarray.cpp:7

C++/Count-Primes.cpp:1

C++/Single-Number.cpp:8

C++/Time-Needed-To-Inform-All-Employees.cpp:5

C++/Shortest-Bridge.cpp:5

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

C++/Binary-Tree-Maximum-Path-Sum.cpp:17

C++/Linked-List-Cycle-II.cpp:2

C++/teemo-attacking.cpp:8

* Runtime - 56ms * Memory - 6.8 * LOGIC - described in functions * */

C++/Sudoku-Solver.cpp:7

C++/minimum-add-to-make-parentheses-valid.cpp:3

C++/Defanging an IP Address.cpp:8

* * * Runtime : 80ms * Memory : 9.6 MB * Logic : 0/1 knapsack concept used to calculate subsetSum */

C++/Partition-Equal-Subset-Sum.cpp:8

The main algorithm in this problem is Breadth First Search.

C++/Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix.cpp:2

* * Runtime : 12ms, faster than 98.40% * Memory : 10.7MB, faster than 85.57% * prerequisite : least common subsequence in string */

C++/Shortest-Common-Supersequence.cpp:7

C++/minimum-remove-to-make-valid-parentheses.cpp:1

CPP DFS solution Time complexity O(V+E) Space Complexity O(V)

C++/Path-Sum-II.cpp:4

C++/Degree-of-an-Array.cpp:10

next →1–100 of 171, ranked by callers