This repository contains a collection of coding problems categorized by company. Each problem is implemented in Java and is structured for easy navigation. Below is the detailed categorization:
6Companies30Days Challenge
A 30-day challenge designed to improve your DSA skills and prepare you for interviews. Solve the DSA Sheet by Arsh by tackling 15 questions every 5 days, and update your progress in a GitHub repository named #6Companies30days.
| Problem Name | Problem Description | Code Link | Date Solved |
|---|---|---|---|
| Bulls and Cows | Problem Link | Code | 2025-01-03 |
| Circle and Rectangle Overlapping | Problem Link | Code | 2025-01-03 |
| Count Number of Nice Subarrays | Problem Link | Code | 2025-01-02 |
| Count the Number of Incremovable Subarrays II | Problem Link | Code | 2025-01-02 |
| Find the Winner of the Circular Game | Problem Link | Code | 2025-01-02 |
| Image Smoother | Problem Link | Code | 2025-01-01 |
| Minimum Cost to Convert String I | Problem Link | Code | 2025-01-07 |
| Minimum Moves to Equal Array Elements II | Problem Link | Code | 2025-01-02 |
| Random Point in Non-Overlapping Rectangles | Problem Link | Code | 2025-01-04 |
| Repeated DNA Sequences | Problem Link | Code | 2025-01-04 |
| Wiggle Sort II | Problem Link | Code | 2025-01-04 |
| Problem Name | Problem Description | Code Link | Date Solved |
|---|---|---|---|
| Delete N Nodes After M Nodes of a Linked List | Problem Link | Code | 2025-01-05 |
| Excel Sheet Column Title | Problem Link | Code | 2025-01-05 |
| Find Number of Ways to Reach the Kth Stair | Problem Link | Code | 2025-01-10 |
| First Unique Character in a String | Problem Link | Code | 2025-01-07 |
| K-Sized Subarray Maximum | Problem Link | Code | 2025-01-06 |
| Longest Mountain in Array | Problem Link | Code | 2025-01-06 |
| Maximum Sum of Distinct Subarrays with Length K | Problem Link | Code | 2025-01-06 |
| Nuts and Bolts Problem | Problem Link | Code | 2025-01-08 |
| Rotting Oranges | Problem Link | Code | 2025-01-05 |
| Valid Sudoku | Problem Link | Code | 2025-01-09 |
| Problem Name | Problem Description | Code Link | Date Solved |
|---|---|---|---|
| Find in Mountain Array | Problem Link | Code | 2025-01-11 |
| Destroying Asteroid | Problem Link | Code | 2025-01-12 |
| Maximum Product After K Increments | Problem Link | Code | 2025-01-12 |
| Problem Name | Problem Description | Code Link | Date Solved |
|---|---|---|---|
| Missing and Repeating | Problem Link | Code | 2025-01-11 |
| Letter Combinations of a Phone Number | Problem Link | Code | 2025-01-13 |
| Problem Name | Problem Description | Code Link | Date Solved |
|---|---|---|---|
| Find Subsequence of Length K | Problem Link | Code | 2025-01-11 |
| K-diff Pairs in an Array | Problem Link | Code | 2025-01-14 |
| Friends Of Appropriate Ages | Problem Link | Code | 2025-01-14 |
| Problem Name | Problem Description | Code Link | Date Solved |
|---|---|---|---|
| Assign Cookies | Problem Link | Code | 2025-01-12 |
| Construct the Longest New String | Problem Link | Code | 2025-01-13 |
| Find the Distance Value Between Two Arrays | Problem Link | Code | 2025-01-13 |
- Fork the repository.
- Create a branch for your contribution.
- Add or modify problems in the respective company category.
- Create a pull request with a detailed description.
This project is licensed under the MIT License. See the LICENSE file for details.