Skip to content

Commit 9fd5908

Browse files
authored
Create README.md
1 parent df8b273 commit 9fd5908

File tree

1 file changed

+19
-0
lines changed
  • 20 - Hashmap Data Structure Problems

1 file changed

+19
-0
lines changed
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
<h1 align='center'>HASHMAP - DATA STRUCTURE - PROBLEMS</h1>
2+
3+
This repository contains solutions to various problems based on the Hashmap data structure, sourced from LeetCode and GeeksforGeeks (GFG). The problems are organized to help you understand and practice Hashmap-related concepts, which are fundamental for many coding interviews and competitive programming challenges.
4+
5+
The problems cover a range of difficulty levels and can be used to deepen your understanding of how Hashmaps work, including concepts like counting frequencies, managing keys and values, and implementing more complex algorithms.
6+
7+
## Repository Content
8+
9+
<p>
10+
<img src="https://img.shields.io/badge/problems%20count-02-orange?logo=leetcode" alt="LeetCode">
11+
<img src="https://img.shields.io/badge/problems%20count-00-darkgreen?logo=geeksforGeeks" alt="GeeksforGeeks">
12+
<img src="https://img.shields.io/badge/total%20problems%20count-03-blue" alt="Problem Count">
13+
</p>
14+
15+
| No | Problem Name | Description | LeetCode | GFG |
16+
|----|--------------|-------------|----------|---------------|
17+
| 01 | [Example](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/20%20-%20Hashmap%20Data%20Structure%20Problems/01%20-%20Example) | This is a basic example problem demonstrating the use of Hashmaps for simple operations. | Non | Non |
18+
| 02 | [Count Elements With Maximum Frequency](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/20%20-%20Hashmap%20Data%20Structure%20Problems/02%20-%20Count%20Elements%20With%20Maximum%20Frequency) | Find the element with the highest frequency in a Hashmap. | [Link](https://leetcode.com/problems/count-elements-with-maximum-frequency/) | Non |
19+
| 03 | [N - Queens](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/20%20-%20Hashmap%20Data%20Structure%20Problems/03%20-%20N%20-%20Queens) | A famous problem solved using Hashmap for tracking safe positions of queens on a chessboard. | [Link](https://leetcode.com/problems/n-queens/) | Non |

0 commit comments

Comments
 (0)