https://github.com/monamobeen/coding

100+ Challenges Data Structures & Algorithms. As this repo designed to help you prepare for technical interviews at top tech companies like Meta (Facebook), Amazon, Apple, Netflix, and Google (MAANG). The focus is on building a strong foundation in clean code, data structures, and algorithms.
https://github.com/monamobeen/coding

data-structures geometry hashmap leetcode-practice mathematics matrix

Last synced: 2 days ago
JSON representation

100+ Challenges Data Structures & Algorithms. As this repo designed to help you prepare for technical interviews at top tech companies like Meta (Facebook), Amazon, Apple, Netflix, and Google (MAANG). The focus is on building a strong foundation in clean code, data structures, and algorithms.

• Host: GitHub
• URL: https://github.com/monamobeen/coding
• Owner: MonaMobeen
• Created: 2024-05-06T11:44:05.000Z (8 months ago)
• Default Branch: main
• Last Pushed: 2024-08-28T10:19:02.000Z (4 months ago)
• Last Synced: 2025-01-05T23:16:53.586Z (2 days ago)
• Topics: data-structures, geometry, hashmap, leetcode-practice, mathematics, matrix
• Language: C++
• Homepage:
• Size: 134 KB
• Stars: 2
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
**MAANG Interview Preparation**

You should start with:

- Clean code

- Data structures

- Algorithms

**For data structures**, look at reviewing:

- Array

- LinkedList

- Stack

- Queue

- HashMap

- Tree

- Graph

**For algorithms**, look at reviewing:

- Sort algorithms — merge sort, quick sort, bucket sort, heap sort

- Search algorithms — binary, depth-first, breadth-first

- Greedy algorithms — Kruskal’s, Dijkstra’s

**Coding Considerations**   

1. Fundamentals:

Grasp the basics: Master variables, data types (int, float, char, etc.), operators (+, -, *, /), control flow (if, else, for, while), and functions. Understand object-oriented programming (OOP): Learn about classes, objects, inheritance, polymorphism, and encapsulation.

2. Data Structures & Algorithms:

Choose appropriate data structures: Arrays, pointers, structures, unions, linked lists, stacks, queues, trees, and graphs each have their strengths and weaknesses. Learn their uses and trade-offs. Design efficient algorithms: Strive for algorithms that solve problems in an optimal way (e.g., sorting algorithms like bubble sort vs. quick sort).