Skip to content

Krishnaaa10/LeetCode_Solutions

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

47 Commits
.vscode
.vscode
 
 
1013-fibonacci-number
1013-fibonacci-number
 
 
17-letter-combinations-of-a-phone-number
17-letter-combinations-of-a-phone-number
 
 
46-permutations
46-permutations
 
 
78-subsets
78-subsets
 
 
.gitattributes
.gitattributes
 
 
1. Two Sum.java
1. Two Sum.java
 
 
1072. Flip Columns For Maximum Number of Equal Rows.java
1072. Flip Columns For Maximum Number of Equal Rows.java
 
 
1123. Lowest Common Ancestor of Deepest Leaves.java
1123. Lowest Common Ancestor of Deepest Leaves.java
 
 
1317. Convert Integer to the Sum of Two No-Zero Integers.java
1317. Convert Integer to the Sum of Two No-Zero Integers.java
 
 
1346. Check If N and Its Double Exist.java
1346. Check If N and Its Double Exist.java
 
 
1399. Count Largest Group.java
1399. Count Largest Group.java
 
 
1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.java
1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.java
 
 
171. Excel Sheet Column Number.java
171. Excel Sheet Column Number.java
 
 
1758. Minimum Changes To Make Alternating Binary String.java
1758. Minimum Changes To Make Alternating Binary String.java
 
 
1760. Minimum Limit of Balls in a Bag.java
1760. Minimum Limit of Balls in a Bag.java
 
 
1861. Rotating the Box.cs
1861. Rotating the Box.cs
 
 
1863. Sum of All Subset XOR Totals.java
1863. Sum of All Subset XOR Totals.java
 
 
1922. Count Good Numbers.java
1922. Count Good Numbers.java
 
 
1975. Maximum Matrix Sum.java
1975. Maximum Matrix Sum.java
 
 
2033. Minimum Operations to Make a Uni-Value Grid
2033. Minimum Operations to Make a Uni-Value Grid
 
 
2053. Kth Distinct String in an Array.java
2053. Kth Distinct String in an Array.java
 
 
2054. Two Best Non-Overlapping Events.java
2054. Two Best Non-Overlapping Events.java
 
 
2089. Find Target Indices After Sorting Array.java
2089. Find Target Indices After Sorting Array.java
 
 
2097. Valid Arrangement of Pairs.java
2097. Valid Arrangement of Pairs.java
 
 
2108. Find First Palindromic String in the Array.java
2108. Find First Palindromic String in the Array.java
 
 
2109. Adding Spaces to a String.java
2109. Adding Spaces to a String.java
 
 
2145. Count the Hidden Sequences.java
2145. Count the Hidden Sequences.java
 
 
2176. Count Equal and Divisible Pairs in an Array.java
2176. Count Equal and Divisible Pairs in an Array.java
 
 
2179. Count Good Triplets in an Array.java
2179. Count Good Triplets in an Array.java
 
 
2290. Minimum Obstacle Removal to Reach Corner.groovy
2290. Minimum Obstacle Removal to Reach Corner.groovy
 
 
2337. Move Pieces to Obtain a String.java
2337. Move Pieces to Obtain a String.java
 
 
2338. Count the Number of Ideal Arrays.java
2338. Count the Number of Ideal Arrays.java
 
 
2444. Count Subarrays With Fixed Bounds.java
2444. Count Subarrays With Fixed Bounds.java
 
 
2503. Maximum Number of Points From Grid Queries.java
2503. Maximum Number of Points From Grid Queries.java
 
 
2537. Count the Number of Good Subarrays.java
2537. Count the Number of Good Subarrays.java
 
 
2554. Maximum Number of Integers to Choose From a Range I.java
2554. Maximum Number of Integers to Choose From a Range I.java
 
 
2563. Count the Number of Fair Pairs.java
2563. Count the Number of Fair Pairs.java
 
 
257. Binary Tree Paths.java
257. Binary Tree Paths.java
 
 
2577. Minimum Time to Visit a Cell In a Grid.java
2577. Minimum Time to Visit a Cell In a Grid.java
 
 
2600. K Items With the Maximum Sum.cs
2600. K Items With the Maximum Sum.cs
 
 
2779. Maximum Beauty of an Array After Applying Operation.java
2779. Maximum Beauty of an Array After Applying Operation.java
 
 
2780. Minimum Index of a Valid Split
2780. Minimum Index of a Valid Split
 
 
2824. Count Pairs Whose Sum is Less than Target.java
2824. Count Pairs Whose Sum is Less than Target.java
 
 
2825. Make String a Subsequence Using Cyclic Increments.java
2825. Make String a Subsequence Using Cyclic Increments.java
 
 
2924. Find Champion II.java
2924. Find Champion II.java
 
 
2937. Make Three Strings Equal.java
2937. Make Three Strings Equal.java
 
 
2981. Find Longest Special Substring That Occurs Thrice I.groovy
2981. Find Longest Special Substring That Occurs Thrice I.groovy
 
 
3131. Find the Integer Added to Array I.java
3131. Find the Integer Added to Array I.java
 
 
3151. Special Array I.java
3151. Special Array I.java
 
 
3152. Special Array II.java
3152. Special Array II.java
 
 
3243. Shortest Distance After Road Addition Queries I.java
3243. Shortest Distance After Road Addition Queries I.java
 
 
3272. Find the Count of Good Integers.java
3272. Find the Count of Good Integers.java
 
 
3375. Minimum Operations to Make Array Values Equal to K.java
3375. Minimum Operations to Make Array Values Equal to K.java
 
 
3392. Count Subarrays of Length Three With a Condition.java
3392. Count Subarrays of Length Three With a Condition.java
 
 
3396. Minimum Number of Operations to Make Elements in Array Distinct.java
3396. Minimum Number of Operations to Make Elements in Array Distinct.java
 
 
368. Largest Divisible Subset.java
368. Largest Divisible Subset.java
 
 
38. Count and Say.java
38. Count and Say.java
 
 
416. Partition Equal Subset Sum.java
416. Partition Equal Subset Sum.java
 
 
50 Days of Code.png
50 Days of Code.png
 
 
763. Partition Labels.java
763. Partition Labels.java
 
 
766. Toeplitz Matrix.java
766. Toeplitz Matrix.java
 
 
773. Sliding Puzzle.dart
773. Sliding Puzzle.dart
 
 
Add Two Numbers
Add Two Numbers
 
 
Badge - LeetCode.html
Badge - LeetCode.html
 
 
Check if Grid can be Cut into Sections
Check if Grid can be Cut into Sections
 
 
README.md
README.md
 
 
Shift 2D Grid.java
Shift 2D Grid.java
 
 
Solution.java
Solution.java
 
 
count subarrays.java
count subarrays.java
 
 
loops.java
loops.java
 
 

Repository files navigation

LeetCode Solutions

This repository contains all my solutions to LeetCode problems. The solutions cover a wide range of topics including data structures, algorithms, dynamic programming, graph theory, and more.

Structure

File Naming: Each file is named according to the problem name or ID from LeetCode.

Languages Used: Most solutions are written in Java, but other languages may also be included.

Features

Consistently updated with new problems and solutions.

Organized for quick reference and review.

Includes a mix of beginner-friendly and advanced-level problems.

Contact

Feel free to reach out if you have any questions or suggestions to improve the solutions.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages