main

BranchesTags

Go to file

Code

Open more actions menu

Latest commit

 

History

446 Commits

446 Commits

Folders and files

Name		Name	Last commit message	Last commit date
01 Matrix		01 Matrix
3Sum		3Sum
4 types of Deletion of DLL		4 types of Deletion of DLL
4 types of deleting node from Singly Linked List		4 types of deleting node from Singly Linked List
4 types of inserting a node to Singly LinkedList		4 types of inserting a node to Singly LinkedList
4 types of insertion of DLL		4 types of insertion of DLL
4Sum		4Sum
Accounts Merge		Accounts Merge
Add Digits		Add Digits
Add One To Number		Add One To Number
Add Two Numbers in SLL		Add Two Numbers in SLL
Add binary		Add binary
Aggressive Cows		Aggressive Cows
Alien dictionary		Alien dictionary
All Paths From Source to Target		All Paths From Source to Target
Apple Redistribution into Boxes		Apple Redistribution into Boxes
Array Partition		Array Partition
Assign Cookies		Assign Cookies
Asteroid Collision		Asteroid Collision
BFS of graph		BFS of graph
Balance a Binary Search Tree		Balance a Binary Search Tree
Balanced Binary Tree		Balanced Binary Tree
Bellman-Ford (shortest path)		Bellman-Ford (shortest path)
Best Time to Buy and Sell Stock		Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II		Best Time to Buy and Sell Stock II
Best Time to Buy and Sell Stock with Transaction Fee		Best Time to Buy and Sell Stock with Transaction Fee
Binary Gap		Binary Gap
Binary Number with Alternating Bits		Binary Number with Alternating Bits
Binary Search		Binary Search
Binary Subarrays With Sum		Binary Subarrays With Sum
Binary Tree Inorder Traversal		Binary Tree Inorder Traversal
Binary Tree Level Order Traversal		Binary Tree Level Order Traversal
Binary Tree Maximum Path Sum		Binary Tree Maximum Path Sum
Binary Tree Paths		Binary Tree Paths
Binary Tree Postorder Traversal		Binary Tree Postorder Traversal
Binary Tree Preorder Traversal		Binary Tree Preorder Traversal
Binary Tree Right Side View		Binary Tree Right Side View
Binary Tree Zigzag Level Order Traversal		Binary Tree Zigzag Level Order Traversal
Binary search -realworld eg		Binary search -realworld eg
Bit Manipulation		Bit Manipulation
Bitwise OR of Even Numbers in an Array		Bitwise OR of Even Numbers in an Array
Boundary Traversal of a Binary Tree		Boundary Traversal of a Binary Tree
Build an Array With Stack Operations		Build an Array With Stack Operations
Can Place Flowers		Can Place Flowers
Can You Match the Matrix? 90° Rotation Challenge		Can You Match the Matrix? 90° Rotation Challenge
Capacity To Ship Packages Within D Days		Capacity To Ship Packages Within D Days
Ceil in BST		Ceil in BST
Cheapest Flights Within K Stops		Cheapest Flights Within K Stops
Check If N and Its Double Exist		Check If N and Its Double Exist
Check Sorted Array		Check Sorted Array
Check if Array Is Sorted and Rotated		Check if Array Is Sorted and Rotated
Check if Strings Can be Made Equal With Operations I		Check if Strings Can be Made Equal With Operations I
Check if there exists a subsequence with sum K		Check if there exists a subsequence with sum K
Check if two trees are identical		Check if two trees are identical
Climbing Stairs		Climbing Stairs
Combination Sum		Combination Sum
Combination Sum II		Combination Sum II
Combination Sum III		Combination Sum III
Combinations		Combinations
Concatenation of Array		Concatenation of Array
Connected Components in an Undirected Graph		Connected Components in an Undirected Graph
Construct Binary Search Tree from Preorder Traversal		Construct Binary Search Tree from Preorder Traversal
Construct Binary Tree from Inorder and Postorder Traversal		Construct Binary Tree from Inorder and Postorder Traversal
Construct Binary Tree from Preorder and Inorder Traversal		Construct Binary Tree from Preorder and Inorder Traversal
Container With Most Water		Container With Most Water
Contains Duplicate		Contains Duplicate
Convert Sorted Array to Binary Search Tree		Convert Sorted Array to Binary Search Tree
Convert array to s LinkedList		Convert array to s LinkedList
Count Subarray Sum Equals K		Count Subarray Sum Equals K
Count Complete Tree Nodes		Count Complete Tree Nodes
Count Dominant Indices		Count Dominant Indices
Count Good Numbers		Count Good Numbers
Count Negative Numbers in a Sorted Matrix		Count Negative Numbers in a Sorted Matrix
Count Number of Nice Subarrays		Count Number of Nice Subarrays
Count Occurrences in Sorted Array		Count Occurrences in Sorted Array
Count Pairs Of Similar Strings		Count Pairs Of Similar Strings
Count Subarrays with given XOR		Count Subarrays with given XOR
Count the Number of Special Characters I		Count the Number of Special Characters I
CountDigits		CountDigits
Counting Bits		Counting Bits
Course Schedule		Course Schedule
Course Schedule II		Course Schedule II
Cycle Detection in Directed Graph (BFS)		Cycle Detection in Directed Graph (BFS)
DFS of Graph		DFS of Graph
DI String Match		DI String Match
DLL create, convert array to DLL, traverse		DLL create, convert array to DLL, traverse
Delete Columns to Make Sorted		Delete Columns to Make Sorted
Delete Columns to Make Sorted II		Delete Columns to Make Sorted II
Delete Columns to Make Sorted III		Delete Columns to Make Sorted III
Delete Node in a BST		Delete Node in a BST
Delete Node in a Linked List		Delete Node in a Linked List
Delete the Middle Node of a Linked List		Delete the Middle Node of a Linked List
Detect Cycle in an Undirected Graph (using BFS)		Detect Cycle in an Undirected Graph (using BFS)
Detect Cycle in an Undirected Graph (using DFS)		Detect Cycle in an Undirected Graph (using DFS)
Diameter of Binary Tree		Diameter of Binary Tree
Diamond shaped pattern		Diamond shaped pattern
Dijkstra Algorithm using priority queue		Dijkstra Algorithm using priority queue
Dijkstra Algorithm using set data structure		Dijkstra Algorithm using set data structure
Directed Graph Cycle(DFS)		Directed Graph Cycle(DFS)
Divide Two Integers		Divide Two Integers
View all files

About

No description, website, or topics provided.

Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks

Report repository

Releases

Packages

Contributors