sameerkali / dsa_75

javascript interview questions by topic

DSA_75 Repository </title>-->

Description

Welcome to the DSA_75 repository! This repository is dedicated to learning and practicing data structures and algorithms using JavaScript. The goal of this repository is to provide a comprehensive collection of 75 common data structure and algorithm problems, along with their solutions, explanations, and test cases.

Contents

The repository contains the following:

1. Problem Statements: A collection of 75 problem statements that cover various data structures and algorithmic concepts. Each problem statement provides a clear description of the problem to be solved.
2. Solutions: Solutions to the 75 problems are implemented in JavaScript. The solutions aim to provide efficient and optimized approaches to solve the problems.
3. Explanations: Detailed explanations accompany each solution, helping you understand the underlying logic and reasoning behind the code. The explanations also provide insights into the time and space complexity of the solutions.
4. Test Cases: For each problem, a set of test cases is provided to validate the correctness of the solutions. These test cases cover different scenarios and edge cases to ensure the solutions handle a variety of inputs correctly.

Getting Started

To get started with the DSA_75 repository, follow these steps:

1. Clone the repository to your local machine using the following command:
   git clone https://github.com/sameerkali/DSA_75.git
2. Navigate to the cloned repository directory:
   cd DSA_75
3. Choose a problem of your choice from the problem statements.
4. Implement your solution in JavaScript.
5. Test your solution using the provided test cases to verify its correctness.
6. If needed, refer to the explanation provided for each solution to gain insights into the approach and optimize it further.
7. Repeat the process for other problems to enhance your understanding of data structures and algorithms.

Contribution Guidelines

Contributions to the DSA_75 repository are welcome! If you would like to contribute, please follow these guidelines:

1. Fork the repository to your own GitHub account.
2. Create a new branch with a descriptive name for your feature or fix.
3. Implement your changes or additions.
4. Test your changes thoroughly.
5. Submit a pull request with a clear description of your changes and their purpose.
6. Ensure your code adheres to the repository's coding standards and conventions.

Starting Date

The DSA_75 repository was initiated on 1st June 2023. Feel free to join and start your DSA journey with us!

Happy coding and mastering data structures and algorithms!

Here all the good questions

- 🔭 if yor're Passionate [DSA_75] (https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/htmlview)

Two Sum

Best Time to Buy and Sell Stock

Contains Duplicate

Product of Array Except Self

Maximum Subarray

Maximum Product Subarray

Find Minimum in Rotated Sorted Array

Search in Rotated Sorted Array

3Sum

Container With Most Water

Sum of Two Integers

Number of 1 Bits

Counting Bits

Missing Number

Reverse Bits

Climbing Stairs

Coin Change

Longest Increasing Subsequence

Longest Common Subsequence

Word Break Problem

Combination Sum

House Robber

House Robber II

Decode Ways

Unique Paths

Jump Game

Clone Graph

Course Schedule

Pacific Atlantic Water Flow

Number of Islands

Longest Consecutive Sequence

Alien Dictionary (Leetcode Premium)

Graph Valid Tree (Leetcode Premium)

Number of Connected Components in an Undirected Graph (Leetcode Premium)

Insert Interval

Merge Intervals

Non-overlapping Intervals

Meeting Rooms

Meeting Rooms II

Reverse a Linked List

Detect Cycle in a Linked List

Merge Two Sorted Lists

Merge K Sorted Lists

Remove Nth Node From End Of List

Reorder List

Set Matrix Zeroes

Spiral Matrix

Rotate Image

Word Search

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Minimum Window Substring

Valid Anagram

Group Anagrams

Valid Parentheses

Valid Palindrome

Longest Palindromic Substring

Palindromic Substrings

Encode and Decode Strings (Leetcode Premium)

Maximum Depth of Binary Tree

Same Tree

Invert/Flip Binary Tree

Binary Tree Maximum Path Sum

Binary Tree Level Order Traversal

Serialize and Deserialize Binary Tree

Subtree of Another Tree

Construct Binary Tree from Preorder and Inorder Traversal

Validate Binary Search Tree

Kth Smallest Element in a BST

Lowest Common Ancestor of BST

Implement Trie (Prefix Tree)

Add and Search Word

Word Search II

Merge K Sorted Lists

Top K Frequent Elements

Thanks & tegards

😮‍💨 i dont know tree structure