Home Courses Interview Preparation Course Critical Connections in a Network: Approach 1 [Leetcode]

Critical Connections in a Network: Approach 1 [Leetcode]

Instructor: admin Duration: 6 mins

This content is restricted. Please Login

Prev
Next
Critical Connections in a Network: Problem Statement [Leetcode]
Bridges and Articulation points
1.1
Find Missing Number
16 min
1.2
Find Missing Number [Python Code]
5 min
1.3
Find Majority Element in an array
17 min
1.4
Rotate Array
18 min
1.5
Single Number
13 min
1.6
How Many Numbers Are Smaller Than the Current Number: Problem Statement [Leetcode]
5 min
1.7
How Many Numbers Are Smaller Than the Current Number: Approach1 [Leetcode]
5 min
1.8
How Many Numbers Are Smaller Than the Current Number: Approach2 [Leetcode]
8 min
1.9
How Many Numbers Are Smaller Than the Current Number: Appraoch2 (Python Code): [Leetcode]
5 min
1.10
How Many Numbers Are Smaller Than the Current Number: Approach3 [Leetcode]
9 min
1.11
How Many Numbers Are Smaller Than the Current Number: Approach3(Python Code) [Leetcode]
5 min
1.12
Sort Array by Parity: Problem Statement [Leetcode]
4 min
1.13
Sort Array by Parity: Approach1 [Leetcode]
4 min
1.14
Sort Array by Parity: Approach2 and Python Code [Leetcode]
9 min
1.15
Create Target Array in the Given Order: Problem Statement[Leetcode]
6 min
1.16
Create Target Array in the Given Order: Explanation & Python Code [Leetcode]
6 min
1.17
Replace Elements with Greatest Element on Right Side: Problem Statement [Leetcode]
4 min
1.18
Replace Elements with Greatest Element on Right Side: Approach 1 [Leetcode]
4 min
1.19
Replace Elements with Greatest Element on Right Side: Approach 2 [Leetcode]
6 min
1.20
Replace Elements with Greatest Element on Right Side: Approach 2 (Python Code) [Leetcode]
4 min
1.21
Shortest Unsorted Continuous Subarray: Problem Statement [Leetcode]
5 min
1.22
Shortest Unsorted Continuous Subarray: Approach 1 [Leetcode]
12 min
1.23
Shortest Unsorted Continuous Subarray: Python Code [Leetcode]
5 min
1.24
Shortest Unsorted Continuous Subarray: Approach2 [Leetcode]
6 min
1.25
Shortest Unsorted Continuous Subarray: Python Code [Leetcode]
4 min
1.26
Shortest Unsorted Continuous Subarray: Approach 3 [Leetcode]
9 min
1.27
Shortest Unsorted Continuous Subarray: Python Code [Leetcode]
8 min
1.28
Find Leaders in an array
15 min
1.29
Search in Rotated Sorted Array
23 min
1.30
Sort Colors
19 min
1.31
Inversions in an array
24 min
1.32
Increasing Triplet Subsequence
19 min
1.33
Partition Equal Subset Sum
11 min
1.34
Array Product Problem
16 min
1.35
Find two Missing Numbers in a Sequence of Consecutive Numbers
20 min
1.36
Find two reapting elements in an array
26 min
1.37
Merge Overlapping Intervals
20 min
1.38
Rotate Matrix by 90 degrees
12 min
1.39
3 Sum : Problem Statement [Leetcode]
3 min
1.40
3 Sum: Brute Force Approach: [Leetcode]
5 min
1.41
3 Sum: Two pointer Approach: [Leetcode]
9 min
1.42
3 Sum: Two pointer Approach[Python code]: [Leetcode]
5 min
1.43
Set Matrix Zeros: Problem statement [Leetcode]
3 min
1.44
Set Matrix Zeros: Approach 1 [Leetcode]
8 min
1.45
Set Matrix Zeros: Approach 1(Python Code) [Leetcode]
5 min
1.46
Set MatriX Zeros: Approach 2 [Leetcode]
7 min
1.47
Set Matrix Zeros: Approach 2 (Python Code) [Leetcode]
6 min
1.48
Count Negative numbers in a sorted matrix: Problem statement [Leetcode]
4 min
1.49
Count Negative Numbers in a Sorted Matrix: Approach1[Leetcode]
3 min
1.50
Count Negative Numbers in a Sorted Matrix: Approach 2 [Leetcode]
6 min
1.51
Count Negative Numbers in a Sorted Matrix: Python code [Leetcode]
5 min
1.52
The K Weakest Rows in a Matrix: Problem Statement [Leetcode]
6 min
1.53
The K Weakest Rows in a Matrix: Approach 1 [Leetcode]
8 min
1.54
The K Weakest Rows in a Matrix: Python code [Leetcode]
4 min
1.55
The K Weakest Rows in a Matrix: Approach 2 [Leetcode]
7 min
1.56
The K Weakest Rows in a Matrix: Python code [Leetcode]
5 min
1.57
The K Weakest Rows in a Matrix: Approach 3 [Leetcode]
8 min
1.58
Median Of two sorted arrays
34 min
1.59
First Missing Positive: Problem Statement [Leetcode]
3 min
1.60
First Missing Positive: Approach 1 [Leetcode]
4 min
1.61
First Missing Positive: Python Code [Leetcode]
5 min
1.62
First Missing Positive: Approach 2 [Leetcode]
14 min
1.63
First Missing Positive: Python Code [Leetcode]
6 min
1.64
Find Numbers with Even Number of Digits: Problem Statement [Leetcode]
3 min
1.65
Find Numbers with Even Number of Digits: Exaplnation [Leetcode]
7 min
1.66
Game of Life: Problem Statement [Leetcode]
8 min
1.67
Game of Life: Approach 1[Leetcode]
9 min
1.68
Game of Life: Approach 1(Python Code)[Leetcode]
9 min
1.69
Game of Life: Approach 2[Leetcode]
10 min
1.70
Game of Life: Approach 2(Python Code)[Leetcode]
8 min
2.1
Sort an array of 0's, 1's and 2's
19 min
2.2
K’th Smallest/Largest Element in Unsorted Array
20 min
2.3
Wiggle Sort: Problem Statement [Leetcode]
5 min
2.4
Wiggle Sort : Approach 1 [Leetcode]
4 min
2.5
Wiggle Sort: Python code [Leetcode]
2 min
2.6
Wiggle Sort: Approach 2 [Leetcode]
6 min
2.7
Wiggle Sort: Python code [Leetcode]
5 min
2.8
Find Peak Element: Problem statement [Leetcode]
4 min
2.9
Find Peak Element: Approach 1 and Python code [Leetcode]
8 min
2.10
Find Peak Element: Approach 2 and Python code [Leetcode]
15 min
2.11
Sort a nearly sorted (or K sorted) array
1 min
3.1
Find Kth Node from end of linked list

15 min
3.2
Linked List Cycle

40 min
3.3
Remove Nth node from End of a linked list
23 min
3.4
Assignment Problem 3 on kth node of the linked list from the end of the list
1 min
3.5
Assignment Problem 1 on detect loop in the linked list
1 min
3.6
Assignment Problem 2 on detect loop in the linked list
1 min
3.7
Palindrome Linked List
40 min
3.8
Assingment Problem 1 on Palindrome linked list
1 min
3.9
Intersection point of Two Linked Lists

25 min
3.10
Assignment problem 1 on Intersection of two linked list
1 min
3.11
Alternative split of singly Linked list
20 min
3.12
Assignment problem 1 Alternating split of Linked list
1 min
3.13
Assignment problem 2 Alternating split of linked list
1 min
3.14
Assignment problem 3 Alternating split of linked list
1 min
3.15
Clone List with Random Pointer
34 min
3.16
XOR Linked List - A Memory Efficient Doubly Linked List
30 min
3.17
Add Two numbers
16 min
3.18
Assignment Problem 1 on Add two linked list
1 min
3.19
Split a Circular Linked List into two halves
12 min
3.20
Reverse K alternative nodes in a linked list
19 min
3.21
Assignment Problem 1 on Reverse alternate k nodes
1 min
3.22
Assignment problem 2 on Reverse Alternative K nodes
1 min
3.23
Merge Two Sorted Linked Lists
19 min
3.24
Assignment Problem 1 on Merge Two sorted Linked lists
1 min
3.25
Assignment Problem 2 on Merge Two sorted Linked lists
1 min
3.26
Flattening a Linked List
13 min
3.27
Merge sort for Linked List
12 min
3.28
Assignment problem 1 on Merge sort
1 min
3.29
Union and Intersection of two Linked Lists
24 min
3.30
Assignment problem 1 on Union and intersection
1 min
3.31
Swap Nodes in pairs (practice)
1 min
3.32
Assignment Problem 1 on Swap Nodes in a pairs
1 min
3.33
Find Next Greater Node In a Linked List(practice)
1 min
3.34
Rotate Linked List(practice)
1 min
3.35
Assignment problem 1 on remove duplicates from sorted linked list.
1 min
3.36
Find Middle Element in a linked list
22 min
3.37
Reverse a linked list (Iterative Approach)
14 min
3.38
Remove Duplicates from Sorted linked list
19 min
3.39
Odd Even Linked list
18 min
3.40
Inserted Into a sorted circular linked list
25 min
4.1
Design a stack such that getMinium() should be O(1) time and O(1) space
22 min
4.2
Print Next Greater Element
28 min
4.3
Design and Implement Special Stack Data Structure. push(), pop(), getMinimum(), findMiddleElement(), deleteMiddleElement()
24 min
4.4
Check if parenthesis are balanced or not
16 min
4.5
Stock Span Problem
24 min
4.6
The Celebrity Problem
26 min
4.7
Reverse a stack using recursion
21 min
4.8
Implement two stacks in single array
16 min
4.9
Petrol Filling Problem

24 min
4.10
Implement stack using Queues
15 min
4.11
Largest Rectangle in Histogram: Problem Statement [Leetcode]
4 min
4.12
Largest Rectangle in Histogram: Approach1 [Leetcode]
9 min
4.13
Largest Rectangle in Histogram: Approach 1 (Python Code) [Leetcode]
9 min
4.14
Largest Rectangle in Histogram: Approach 2 [Leetcode]
15 min
4.15
Largest Rectangle in Histogram: Python code [Leetcode]
8 min
4.16
Write a Program for Implement Queue using Stacks
1 min
4.17
Trapping Rain Water: Problem Statement [Leetcode]
4 min
4.18
Trapping Rain Water: Approach 1 [Leetcode]
7 min
4.19
Trapping Rain Water: Approach 1 (Python code)[Leetcode]
6 min
4.20
Trapping Rain Water: Approach 2 [Leetcode]
6 min
4.21
Trapping Rain Water: Approach 2 (Python code)[Leetcode]
5 min
4.22
Trapping Rain Water: Approach 3 [Leetcode]
14 min
4.23
Trapping Rain Water: Approach 3 (Python code)[Leetcode]
6 min
4.24
Trapping Rain Water: Approach 4 [Leetcode]
11 min
4.25
Asteroid Collision: Problem Statement [Leetcode]
5 min
4.26
Asteroid Collision: Approach 1[Leetcode]
10 min
4.27
Asteroid Collision: Approach 1 (Python code)[Leetcode]
6 min
4.28
Asteroid Collision: Approach 2 and Python code[Leetcode]
10 min
5.1
Count number of nodes in the binary tree
12 min
5.2
Check if two trees are identical or not
9 min
5.3
Level Order Tree Traversal
16 min
5.4
Print Level order traversal in spiral form

37 min
5.5
Convert a Binary Tree into its Mirror Tree
15 min
5.6
Print Ancestors of a given node in Binary Tree
20 min
5.7
Find Lowest Common Ancestor in a Binary Search Tree
22 min
5.8
Children sum property in a binary tree
25 min
5.9
Print Lowest Common Ancestor in a Binary Tree
11 min
5.10
count leaf nodes in a binary tree
10 min
5.11
Construct a binary tree from inorder and postorder traversals
26 min
5.12
Convert a given tree to its Sum Tree
12 min
5.13
Find the maximum sum leaf to root path in a Binary Tree
14 min
5.14
Find Diameter of a Binary Tree
20 min
5.15
Convert a given Binary Tree to Doubly Linked List
14 min
5.16
Vertical Traversal of binary tree
14 min
5.17
Inorder Tree Traversal without recursion and without stack (Threaded binary tree)
21 min
5.18
Serialize and deserialize of a binay tree
23 min
5.19
Boundary Traversal of a Binary Tree
22 min
5.20
Merge Two binary trees [Leetcode]
16 min
5.21
Range Sum of Binary Search Tree [Leetcode]
19 min
5.22
Trim a BInary Search Tree (Practice Problem)
1 min
5.23
Search in a Binary Search Tree [Leet code]
19 min
5.24
Print Right View of a Binary Tree
1 min
5.25
Invert Binary Tree [Leetcode]
17 min
5.26
Given a binary tree, find its maximum depth. [Leetcode]
17 min
5.27
Path Sum [Leetcode]
16 min
5.28
Leaf-Similar Trees
1 min
5.29
Find the sum of all left leaves in a given binary tree. [Leetcode]
14 min
5.30
Given two binary trees, write a function to check if they are the same or not [Leetcode]
15 min
5.31
All Elements in Two Binary Search Trees [Leetcode]
33 min
5.32
Maximum Binary Tree: Problem Statement [Leetcode]
5 min
5.33
Maximum Binay Tree: Explanation: [LeetCode]
10 min
5.34
Maximum Binay Tree: Python Code: [LeetCode]
5 min
5.35
Binary Tree Pruning: Problem Statement [Leetcode]
4 min
5.36
Binary Tree Pruning: Explanation: [Leetcode]
7 min
5.37
Binary Tree Pruning: Python Code[Leetcode]
6 min
5.38
Validate Binary Search Tree: Problem Statement [Leetcode]
5 min
5.39
Validate Binary Search Tree: Explanation[Part1] : [Leetcode]
2 min
5.40
Validate Binary Search Tree: Explanation[Part2] : Leetcode
10 min
5.41
Validate Binary Search Tree: Python Code : [Leetcode]
6 min
5.42
Validate Binary Search Tree: Iterative Approach: [Leetcode]
7 min
5.43
Binary Tree Zigzag Level Order Traversal: Problem Statement [Leetcode]
4 min
5.44
Binary Tree Zigzag Traversal : Explanation [Leetcode]
8 min
5.45
Binary Tree Zigzag Traversal: Python code [Leetcode]
11 min
5.46
Populating Next Right Pointers in Each Node: Problem Statement [Leetcode]
5 min
5.47
Populating Next Right Pointers in Each Node: Explanation [Leetcode]
10 min
5.48
Populating Next Right Pointers in Each Node: Python code [Leetcode]
5 min
5.49
Binary Tree Right Side View: Problem Statement [Leetcode]
3 min
5.50
Binary Tree Right Side View: Explanation [Leetcode]
7 min
5.51
Binary Tree Right Side View: Python Code [Leetcode]
7 min
5.52
Kth Smallest Element in a BST: Problem Statement [Leetcode]
5 min
5.53
Kth Smallest Element in a BST: Approach 1 [Leetcode]
7 min
5.54
Kth Smallest Element in a BST: Approach 1 (python code) [Leetcode]
5 min
5.55
Kth Smallest Element in a BST: Approach 2 [Leetcode]
10 min
5.56
Kth Smallest Element in a BST: Approach 3[Leetcode]
3 min
6.1
K’th Largest/Smallest Element in an array
20 min
6.2
K’th largest element in a stream
15 min
6.3
Find Median in a stream of integers (running integers) (Practice Problem)
1 min
6.4
Connect n ropes with minimum cost
16 min
6.5
Convert min heap to max heap
9 min
6.6
Finding K-Most frequent words in a text-file
12 min
6.7
K Closest points to origin: Problem Statement [Leetcode]
5 min
6.8
K Closest points to origin: Approach1 [Leetcode]
7 min
6.9
K Closest Points to Origin: Approach 2 [Leetcode]
7 min
6.10
K Closest Points to Origin: Python code [Leetcode]
8 min
6.11
Top K Frequent Elements: Problem Statment [Leetcode]
4 min
6.12
Top K Frequent Elements: Approach 1 [Leetcode]
6 min
6.13
Top K Frequent Elements: Python Code [Leetcode]
4 min
6.14
Top K Frequent Elements: Approach 2 [Leetcode]
5 min
6.15
Top K Frequent Elements: Python code [Leetcode]
3 min
6.16
Sort a nearly sorted (or K sorted) array
1 min
6.17
Merge k sorted arrays
1 min
7.1
Remove all duplicates from the input string.
22 min
7.2
Reverse words in a given string

15 min
7.3
Run Length Encoding
13 min
7.4
Remove all adjacent duplicate characters in a string
23 min
7.5
First Non-repeating character in a string
12 min
7.6
Find first non-repeating character in a stream
21 min
7.7
Find the smallest window in a string containing all characters of another string
31 min
7.8
Print all anagrams in a list of words
14 min
7.9
Rearrange Characters to form a palindrome
16 min
7.10
Reorder Data In log files
15 min
7.11
Decode Ways: Problem Statement [Leetcode]
4 min
7.12
Decode Ways: Approach 1 [Leetcode]
11 min
7.13
Decode Ways: Python Code [Leetcode]
6 min
7.14
Decode Ways: Approach 2 [Leetcode]
5 min
7.15
Longest Common Prefix: Problem Statement [Leetcode]
3 min
7.16
Longest Common Prefix: Approach 1 [Leetcode]
6 min
7.17
Longest Common Prefix: Python code [Leetcode]
8 min
7.18
Longest Common Prefix: Approach 2[Leetcode]
4 min
7.19
Longest Common Prefix: Python Code[Leetcode]
6 min
7.20
Longest Common Prefix: Approach 3[Leetcode]
7 min
7.21
Longest Common Prefix: Python code [Leetcode]
9 min
7.22
Longest Common Prefix: Approach 4 [Leetcode]
5 min
7.23
Longest Common Prefix: Python code [Leetcode]
4 min
7.24
Reorganize String: Problem Statement [Leetcode]
4 min
7.25
Reorganize String: Approach 1 [Leetcode]
6 min
7.26
Reorganize String: Approach 1 (Python code) [Leetcode]
7 min
7.27
Reorganize String: Approach 2 [Leetcode]
13 min
7.28
Reorganize String: Approach 2 (Python code) [Leetcode]
9 min
7.29
Group Anagrams: Problem Statement [Leetcode]
3 min
7.30
Group Anagrams: Approach1 [Leetcode]
6 min
7.31
Group Anagrams: Approach1 (Python Code)[Leetcode]
4 min
7.32
Group Anagrams: Approach2 [Leetcode]
6 min
7.33
Group Anagrams: Approach2 (Python Code)[Leetcode]
4 min
7.34
Sort Characters By Frequency
1 min
7.35
check if strings are rotations of each other or not
1 min
7.36
Find all distinct palindromic sub strings of a given string
1 min
7.37
Find a excel column name from a given column number.
1 min
7.38
Write a Program for String matching where one string contains wildcard characters
1 min
8.1
Naive Pattern Matching Algorithm
16 min
8.2
KMP Algorithm - Part 1
14 min
8.3
KMP Algorithm
25 min
8.4
Rabin Karp Algorithm- part 1
15 min
8.5
Rabin Karp Algorithm - Part2
9 min
9.1
Find the missing number in Arithmetic Progression
15 min
9.2
Write a Program for Median of two sorted arrays
34 min
9.3
Write a Program for Find a peak element
1 min
9.4
Write a Program for Count Inversions in an array
1 min
9.5
The skyline problem
1 min
10.1
Given weights and values of n items, we need to put these items in a knapsack of capacity W to get the maximum total value in the knapsack.
30 min
10.2
Minimum Swaps for Bracket Balancing
22 min
10.3
Given an array of jobs with different time intervals. Find the minimum time to finish all jobs.

40 min
10.4
Given a universe of n elements, collection of subsets. Find a minimum cost sub collection that covers all elements.
1 min
10.5
Water Connection Problem
1 min
10.6
Minimum Number of Arrows to Burst Balloons: Problem Statement [Leetcode]
6 min
10.7
Minimum Number of Arrows to Burst Balloons: Explanation[Leetcode]
10 min
10.8
Minimum Number of Arrows to Burst Balloons: Python Code[Leetcode]
5 min
10.9
Partition Labels: Problem Statement [Leetcode]
4 min
10.10
Partition Labels: Explanation [Leetcode]
11 min
10.11
Partition Labels: Python code[Leetcode]
6 min
11.1
Largest sum contiguous sub array
46 min
11.2
Longest Palindromic sub sequence
50 min
11.3
climbing stairs problem
16 min
11.4
nth ugly number
38 min
11.5
Rod cutting Problem
25 min
11.6
Count all possible paths in a Grid
17 min
11.7
Coin Change Problem
25 min
11.8
Minimum Cost path Problem
19 min
11.9
Fill a N*4 wall with 1*4 bricks problem
23 min
11.10
Levenstein/Edit Distance Problem
29 min
11.11
Egg dropping Problem
34 min
11.12
Word Break Problem

21 min
11.13
Longest Increasing Subsequence

20 min
11.14
Longest Increasing Subsequence (O(nlogn))
27 min
11.15
Subset Sum Problem
20 min
11.16
Unique Paths: Problem Statment [Leetcode]
5 min
11.17
Unique Paths: Approach 1 [Leetcode]
9 min
11.18
Unique Paths: Python Code[Leetcode]
3 min
11.19
Unique Paths: Approach 2 [Leetcode]
6 min
11.20
Unique Paths: Python code[Leetcode]
4 min
11.21
Unique Binary Search Trees: Problem Statement [Leetcode]
4 min
11.22
Unique Binary Search Trees: Explanation [Leetcode]
17 min
11.23
Unique Binary Search Trees: Python code [Leetcode]
6 min
11.24
House Robber: Problem Statment [Leetcode]
6 min
11.25
House Robber: Approach 1 [Leetcode]
13 min
11.26
House Robber: Python code [Leetcode]
8 min
11.27
House Robber: Approach 2 [Leetcode]
9 min
11.28
House Robber: Python code [Leetcode]
6 min
11.29
House Robber: Approach 3 & Python code [Leetcode]
9 min
11.30
Longest Palindromic Substring: Problem Statement [Leetcode]
3 min
11.31
Longest Palindromic Substring: Approach 1 [Leetcode]
4 min
11.32
Longest Palindromic Substring: Approach 2 [Leetcode]
11 min
11.33
Longest Palindromic Substring: Approach 2(Python code) [Leetcode]
11 min
11.34
Longest Palindromic Substring: Approach 3 [Leetcode]
9 min
11.35
Longest Palindromic Substring: Approach 3(Python code) [Leetcode]
13 min
11.36
Write a Program for Maximum size square sub-matrix with all 1s
1 min
11.37
Longest Valid Parentheses
1 min
11.38
Binary Tree Cameras
1 min
11.39
Write a Program for Partition problem
1 min
11.40
Write a Program for Maximum sum rectangle in a 2D matrix
1 min
12.1
Write a Program for N Queen Problem
16 min
12.2
Write a Program for Sudoku
35 min
12.3
Write a Program for Rat in a Maze
25 min
12.4
Letter Combinations of a phone number: Problem Statement [Leetcode]
4 min
12.5
Letter combinations of a phone number: Explanation [Leetcode]
8 min
12.6
Letter combinations of a phone number: Python Code [Leetcode]
7 min
12.7
Permutations: Problem Statement [Leetcode]
3 min
12.8
Permutations: Backtracting Introduction [Leetcode]
6 min
12.9
Permutations: Explanation [Leetcode]
6 min
12.10
Permutations: Python code [Leetcode]
6 min
12.11
Word Search: Problem Statement [leetcode]
5 min
12.12
Word Search: Explanation [Leetcode]
12 min
12.13
Word Search: Python code[ Leetcode]
11 min
12.14
Generate Parenthesis: Problem Statement [Leetcode]
3 min
12.15
Generate Parenthesis: Explanation[Leetcode]
14 min
12.16
Generate Parenthesis: Python code[Leetcode]
5 min
12.17
Knight Probability in Chessboard: Practice Problem
1 min
12.18
Subsets
1 min
14.1
Single Number 11: Problem Statement [Leetcode]
4 min
14.2
Single Number 11: Approach 1 [Leetcode]
5 min
14.3
Single Number 11: Python code [Leetcode]
5 min
14.4
Single Number 11: Approach 2 [Leetcode]
12 min
14.5
Single Number 11: Python code [Leetcode]
3 min
14.6
Number of 1 Bits: Problem Statement [Leetcode]
3 min
14.7
Number of 1 Bits: Approach1 [Leetcode]
7 min
14.8
Number of 1 Bits: Approach 2 [Leetcode]
8 min
14.9
Counting Bits: Problem Statement [Leetcode]
5 min
14.10
Counting Bits: Approach 1 [Leetcode]
8 min
14.11
Counting Bits: Approach 2 [Leetcode]
9 min
14.12
Counting Bits: Python code [Leetcode]
3 min
14.13
Counting Bits: Approach 3 [Leetcode]
3 min
14.14
Maximum Product of Word Lengths: Problem Statment [Leetcode]
5 min
14.15
Maximum Product of Word Lengths: Approach 1 [Leetcode]
5 min
14.16
Maximum Product of word Lengths: Python Code [Leetcode]
5 min
14.17
Maximum Product of word lengths: Approach 2 [Leetcode]
10 min
14.18
Maximum product of word lengths: Python Code [Leetcode]
4 min
14.19
Total Hamming distance: Problem Statement [Leetcode]
4 min
14.20
Total Hamming Distance: Approach 1 [Leetcode]
8 min
14.21
Total Hamming Distance: Approach 2 [Leetcode]
7 min
14.22
Total Hamming Distance: Python code[Leetcode]
4 min
14.23
pow(x, n) : problem statement [Leetcode]
3 min
14.24
pow(x, n) : Approach 1 and Python code [Leetcode]
5 min
14.25
pow(x, n) : Approach 2 and Python code [Leetcode]
6 min
14.26
pow(x, n) : Iterative Approach [leetcode]
4 min
15.1
1. Single Number
13 min
15.2
2. Happy Number: Problem Statement
4 min
15.3
2. Happy Number: Approach 1
16 min
15.4
2. Happy Number: Approach 1 [Python Code]
6 min
15.5
2. Happy Number: Approach 2 & Python code
8 min
15.6
3. Maximum Sub Array

46 min
15.7
4. Move Zeros [Problem Statement]
4 min
15.8
4. Move Zeros: Approch 1 & Python code
6 min
15.9
4. Move Zeros: Approch 2 & Python code
13 min
15.10
5. Best Time to Buy and Sell Stock II : Problem Statement
5 min
15.11
5. Best Time to Buy and Sell Stock II: Approach 1
14 min
15.12
5. Best Time to Buy and Sell Stock II : Approach 2
11 min
15.13
5. Best Time to Buy and Sell Stock II : Approach 3
5 min
15.14
6. Group Anagrams: Problem Statement [Leetcode]
3 min
15.15
6. Group Anagrams: Approach1 [Leetcode]
6 min
15.16
6. Group Anagrams: Approach1 (Python Code)[Leetcode]
4 min
15.17
6. Group Anagrams: Approach2 [Leetcode]
6 min
15.18
6. Group Anagrams: Approach2 (Python Code)[Leetcode]
4 min