GitHub - Indiana-S-coder/SDE-sheet-ArshGoyal: Guaranteed Internship and Placement Roadmap

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 180 Commits
Add two numbers II		Add two numbers II
Aggressive cows		Aggressive cows
Allocate minimum number of pages		Allocate minimum number of pages
Balanced binary tree		Balanced binary tree
Basic Calculator II		Basic Calculator II
Beautiful Arrangement		Beautiful Arrangement
Best time to buy and sell stock IV		Best time to buy and sell stock IV
Binary Search tree iterator		Binary Search tree iterator
Binary tree Inorder traversal		Binary tree Inorder traversal
Binary tree right side view		Binary tree right side view
Binary tree zigzag level order traversal		Binary tree zigzag level order traversal
Burst balloons		Burst balloons
Ceiling in a sorted array		Ceiling in a sorted array
Check whether BST contains dead end		Check whether BST contains dead end
Circular tour		Circular tour
Climbing Stairs		Climbing Stairs
Clone linked list with random pointers		Clone linked list with random pointers
Coin Change		Coin Change
Combination sum II		Combination sum II
Combinations		Combinations
Construct binary tree from preorder and postorder		Construct binary tree from preorder and postorder
Convert binary number in a linked list to integer		Convert binary number in a linked list to integer
Count BST nodes that lie in a given range		Count BST nodes that lie in a given range
Count different palindromic subsequences		Count different palindromic subsequences
Count of smaller numbers after self		Count of smaller numbers after self
Count square submatrices with all ones		Count square submatrices with all ones
Counting bits		Counting bits
Decode ways		Decode ways
Delete and Earn		Delete and Earn
Delete without head pointer		Delete without head pointer
Deque Implementations		Deque Implementations
Distance of nearest cell having 1		Distance of nearest cell having 1
Distinct Subsequences		Distinct Subsequences
Evaluation of postfix expression		Evaluation of postfix expression
Excel Sheet column title		Excel Sheet column title
Find Number of islands		Find Number of islands
Find pair given difference		Find pair given difference
Find peak element		Find peak element
Find the most competative subssequence		Find the most competative subssequence
Flatten a multilayer linked list		Flatten a multilayer linked list
Flatten binary tree to linked list		Flatten binary tree to linked list
Flatten nested list iterator		Flatten nested list iterator
Flattening a linked list		Flattening a linked list
Frog Jump		Frog Jump
Furthest building you can reach		Furthest building you can reach
Gas Station		Gas Station
Given a linked list of 0's, 1's, and 2's sort it		Given a linked list of 0's, 1's, and 2's sort it
Group Anagrams		Group Anagrams
Happy Number		Happy Number
Implement queue using stack		Implement queue using stack
Implement stack using queue		Implement stack using queue
Implement two stacks in an array		Implement two stacks in an array
Integer to English		Integer to English
Intersection of two linked lists		Intersection of two linked lists
Job sequencing problem		Job sequencing problem
K closest points to origin		K closest points to origin
Knight dialer		Knight dialer
Kth smallest element		Kth smallest element
Kth smallest element in a bst		Kth smallest element in a bst
LRU cache		LRU cache
Largest number in K swaps		Largest number in K swaps
Largest subarray with zero sum		Largest subarray with zero sum
Linked list cycle		Linked list cycle
Linked list in zig-zag fashion		Linked list in zig-zag fashion
Longest common Substring		Longest common Substring
Lowest common ancestor in BST		Lowest common ancestor in BST
Lowest common ancestor in a binary tree		Lowest common ancestor in a binary tree
M-coloring problem		M-coloring problem
Make Array elements equal		Make Array elements equal
Max points on a line		Max points on a line
Max size rectangle with 1's		Max size rectangle with 1's
Maximal rectangle		Maximal rectangle
Maximal square		Maximal square
Maximize the counting bits		Maximize the counting bits
Maximum depth of binary tree		Maximum depth of binary tree
Maximum length of repeated subarray		Maximum length of repeated subarray
Maximum of minimum for every window size		Maximum of minimum for every window size
Maximum product of three numbers		Maximum product of three numbers
Maximum product subarray		Maximum product subarray
Maximum width of binary tree		Maximum width of binary tree
Merge k sorted list		Merge k sorted list
Merge sort for linked list		Merge sort for linked list
Merge two sorted linked list		Merge two sorted linked list
Middle of linked list		Middle of linked list
Min number of swaps required to sort an array		Min number of swaps required to sort an array
Min sum formed by digits		Min sum formed by digits
Minimum Window Substring		Minimum Window Substring
Minimum absolute difference in BST		Minimum absolute difference in BST
Minimum cost to cut a board		Minimum cost to cut a board
Minimum cost to merge stones		Minimum cost to merge stones
Minimum cost tree from leaf values		Minimum cost tree from leaf values
Minimum deletions to make character frequencies unique		Minimum deletions to make character frequencies unique
Minimum given distance between two given nodes of binary tree		Minimum given distance between two given nodes of binary tree
Minimum insertion steps to make string palindrom		Minimum insertion steps to make string palindrom
Minimum number of moves to make an array equal		Minimum number of moves to make an array equal
Minimum number of refulling stops		Minimum number of refulling stops
Minimum path sum		Minimum path sum
Minimum time to make rope colorful		Minimum time to make rope colorful
Minimum wages to hire K workers		Minimum wages to hire K workers
Minimum window substring		Minimum window substring