Skip to content
/ DSA-LEETCODE Public

Practised Dsa based problems from leetcode .Language used is JAVA.

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

1610ayushi/DSA-LEETCODE

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

189 Commits
1048. Longest String Chain.java
1048. Longest String Chain.java
 
 
1209.Remove All Adjacent Duplicates in String II.java
1209.Remove All Adjacent Duplicates in String II.java
 
 
1268. Search Suggestions System.java
1268. Search Suggestions System.java
 
 
128. Longest Consecutive Sequence.java
128. Longest Consecutive Sequence.java
 
 
1332. Remove Palindromic Subsequences.java
1332. Remove Palindromic Subsequences.java
 
 
1342. Number of Steps to Reduce a Number to Zero.java
1342. Number of Steps to Reduce a Number to Zero.java
 
 
1354. Construct Target Array With Multiple Sums.java
1354. Construct Target Array With Multiple Sums.java
 
 
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.java
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree.java
 
 
1396. Design Underground System.java
1396. Design Underground System.java
 
 
1423. Maximum Points You Can Obtain from Cards..java
1423. Maximum Points You Can Obtain from Cards..java
 
 
1480. Running Sum of 1d Array.java
1480. Running Sum of 1d Array.java
 
 
1584. Min Cost to Connect All Points.java
1584. Min Cost to Connect All Points.java
 
 
1641. Count Sorted Vowel Strings.java
1641. Count Sorted Vowel Strings.java
 
 
1642. Furthest Building You Can Reach.java
1642. Furthest Building You Can Reach.java
 
 
1679. Max Number of K-Sum Pairs.java
1679. Max Number of K-Sum Pairs.java
 
 
1695. Maximum Erasure Value.java
1695. Maximum Erasure Value.java
 
 
17. Letter Combinations of a Phone Number.java
17. Letter Combinations of a Phone Number.java
 
 
173. Binary Search Tree Iterator.java
173. Binary Search Tree Iterator.java
 
 
191. Number of 1 Bits.java
191. Number of 1 Bits.java
 
 
230. Kth Smallest Element in a BST.java
230. Kth Smallest Element in a BST.java
 
 
284. Peeking Iterator.java
284. Peeking Iterator.java
 
 
289. Game of Life.java
289. Game of Life.java
 
 
304. Range Sum Query 2D - Immutable.java
304. Range Sum Query 2D - Immutable.java
 
 
32. Longest Valid Parentheses.java
32. Longest Valid Parentheses.java
 
 
322. Coin change.java
322. Coin change.java
 
 
329. Longest Increasing Path in a Matrix.java
329. Longest Increasing Path in a Matrix.java
 
 
347. Top K Frequent Elements.java
347. Top K Frequent Elements.java
 
 
354. Russian Doll Envelopes.java
354. Russian Doll Envelopes.java
 
 
399. Evaluate Division.java
399. Evaluate Division.java
 
 
4 SumlI .java
4 SumlI .java
 
 
456. 132 Pattern.java
456. 132 Pattern.java
 
 
474. Ones and Zeroes.java
474. Ones and Zeroes.java
 
 
538. Convert BST to Greater Tree.java
538. Convert BST to Greater Tree.java
 
 
581. Shortest Unsorted Continuous Subarray.java
581. Shortest Unsorted Continuous Subarray.java
 
 
583. Delete Operation for Two Strings.java
583. Delete Operation for Two Strings.java
 
 
59. Spiral Matrix II.java
59. Spiral Matrix II.java
 
 
630. Course Schedule III.java
630. Course Schedule III.java
 
 
647. Palindromic Substrings.java
647. Palindromic Substrings.java
 
 
653. Two Sum IV - Input is a BST.java
653. Two Sum IV - Input is a BST.java
 
 
669. Trim a Binary Search Tree.JAVA
669. Trim a Binary Search Tree.JAVA
 
 
700. Search in a Binary Search Tree.java
700. Search in a Binary Search Tree.java
 
 
703. Kth Largest Element in a Stream.java
703. Kth Largest Element in a Stream.java
 
 
785. Is Graph Bipartite?.java
785. Is Graph Bipartite?.java
 
 
81. Search in Rotated Sorted Array II.java
81. Search in Rotated Sorted Array II.java
 
 
867. Transpose Matrix.java
867. Transpose Matrix.java
 
 
88. Merge Sorted Array.java
88. Merge Sorted Array.java
 
 
897. Increasing Order Search Tree.java
897. Increasing Order Search Tree.java
 
 
905. Sort Array By Parity.java
905. Sort Array By Parity.java
 
 
923. 3Sum With Multiplicity.java
923. 3Sum With Multiplicity.java
 
 
968. Binary Tree Cameras.java
968. Binary Tree Cameras.java
 
 
99. Recover Binary Search Tree.java
99. Recover Binary Search Tree.java
 
 
Best TimetoBuyandSellStock.java
Best TimetoBuyandSellStock.java
 
 
Binary-Tree-Inorder-Traversal.java
Binary-Tree-Inorder-Traversal.java
 
 
Candy.java
Candy.java
 
 
Check if string contain all binary code of size k.java
Check if string contain all binary code of size k.java
 
 
Clone Graph.java
Clone Graph.java
 
 
Combination sum III.java
Combination sum III.java
 
 
Container With Most Water.java
Container With Most Water.java
 
 
Contains-Duplicate.java
Contains-Duplicate.java
 
 
Copy List with Random Pointer.java
Copy List with Random Pointer.java
 
 
Counting Bits.java
Counting Bits.java
 
 
Critical connection in a network.java
Critical connection in a network.java
 
 
Deepest leaves sum.java
Deepest leaves sum.java
 
 
Delete and Earn.java
Delete and Earn.java
 
 
Design hashset.java
Design hashset.java
 
 
Divide two numbers.java
Divide two numbers.java
 
 
Excel Sheet Column Number.java
Excel Sheet Column Number.java
 
 
Fibonacci numbers.java
Fibonacci numbers.java
 
 
First-Unique-Character-in-a-String.java
First-Unique-Character-in-a-String.java
 
 
Flatten nested list iterator.java
Flatten nested list iterator.java
 
 
Given a string array words, return the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. If no such two words exist, return 0. Example 1: Input: words = ["abcw","baz","foo","bar","xtfn","abcdef"] Output: 16 Explanation: The two words can be "abcw", "xtfn". Example 2: Input: words = ["a","ab","abc","d","cd","bcd","abcd"] Output: 4 Explanation: The two words can be "ab", "cd". Example 3: Input: words = ["a","aa","aaa","aaaa"] Output: 0 Explanation: No such pair of words.java
Given a string array words, return the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. If no such two words exist, return 0. Example 1: Input: words = ["abcw","baz","foo","bar","xtfn","abcdef"] Output: 16 Explanation: The two words can be "abcw", "xtfn". Example 2: Input: words = ["a","ab","abc","d","cd","bcd","abcd"] Output: 4 Explanation: The two words can be "ab", "cd". Example 3: Input: words = ["a","aa","aaa","aaaa"] Output: 0 Explanation: No such pair of words.java
 
 
Intersection-of-Arrays.java
Intersection-of-Arrays.java
 
 
Is subsequence.java
Is subsequence.java
 
 
Leetcode-streak.java
Leetcode-streak.java
 
 
LinkedList Cycle II.java
LinkedList Cycle II.java
 
 
LinkedList-Cycle.java
LinkedList-Cycle.java
 
 
Longest sub string without repeating charchters.java
Longest sub string without repeating charchters.java
 
 
March leetcode 6march.java
March leetcode 6march.java
 
 
Maximum Depth of Binary Tree.java
Maximum Depth of Binary Tree.java
 
 
Maximum Width of Binary Tree.java
Maximum Width of Binary Tree.java
 
 
Maximum frequency stack.java
Maximum frequency stack.java
 
 
Minimize Deviation in Array.java
Minimize Deviation in Array.java
 
 
Minimum operations to reduce X to zero.java
Minimum operations to reduce X to zero.java
 
 
N QUEENS.JAVA
N QUEENS.JAVA
 
 
N-Queens.java
N-Queens.java
 
 
Network delay time.java
Network delay time.java
 
 
Pascal's Triangle.java
Pascal's Triangle.java
 
 
Path with minimum effort.javaa
Path with minimum effort.javaa
 
 
Permutations II.java
Permutations II.java
 
 
Populating next right pointer in each node.java
Populating next right pointer in each node.java
 
 
README. md
README. md
 
 
RanSomeNote.java
RanSomeNote.java
 
 
Remove Duplicates from Sorted Array II.java
Remove Duplicates from Sorted Array II.java
 
 
Remove duplicate from sorted list II.java
Remove duplicate from sorted list II.java
 
 
Reshape-the-Matrix.java
Reshape-the-Matrix.java
 
 
Reverse Linked List.java
Reverse Linked List.java
 
 
Reverse nodes in k-group.java
Reverse nodes in k-group.java
 
 
SIMPLIFY PATH .JAVA
SIMPLIFY PATH .JAVA
 
 
Search a 2D Matrix.java
Search a 2D Matrix.java
 
 
Shift 2D Grid.java
Shift 2D Grid.java
 
 

Repository files navigation

# DSA-LEETCODE
Practised Dsa based problems from leetcode .Language used is JAVA.

In computer science, a data structure is a way to store and organize data.

During the computer programming process, identifying and using the appropriate data structure is an important task as it can improve the overall efficiency of the algorithm. In large-scale systems, choosing the most suitable data structure directly impacts the difficulty of program design and the final quality and performance.
Daily new solutions are updated.

About

Practised Dsa based problems from leetcode .Language used is JAVA.

Topics

github java programming-language programming leetcode data-structures leetcode-solutions leetcode-questions leetcode-java dailypractise

Resources

Readme
Activity

Stars

1 star

Watchers

2 watching

Forks

0 forks
Report repository

Releases 1

dailypractise Latest
Jan 14, 2022

Packages

No packages published

Languages