This repository contains solutions to coding exercises from the Udemy course: "100+ DSA Interview Questions for Cracking FAANG with Animated Examples for Deeper Understanding and Faster Learning" by Elshad Karimov.
- Solutions are implemented in Python.
- Focuses on key data structures and algorithms essential for FAANG interviews.
- Each solution includes problem descriptions and example inputs/outputs.
.
├── 01_Array
│ ├── 1_Missing_Number.py
│ ├── 2_Max_Product_of_Two_Integers.py
│ ├── 3_Middle_Function.py
│ ├── 4_2D_Lists.py
│ ├── 5_Best_Score.py
│ ├── 6_Duplicate_Number.py
│ ├── 7_Pairs.py
│ ├── 8_Contains_Duplicate.py
│ └── 9_Rotate_Matrix_or_Image.py
├── 02_Dictionary
│ ├── 10_Count_Word_Frequency.py
│ ├── 11_Common_Keys.py
│ ├── 12_Key_with_the_Highest_Value.py
│ ├── 13_Reverse_Key_Value_Pairs.py
│ ├── 14_Conditional_Filter.py
│ └── 15_Same_Frequency.py
├── 03_Tuple
│ ├── 16_Sum_and_Product.py
│ ├── 17_Elementwise_Sum.py
│ ├── 18_Insert_at_the_Beginning.py
│ ├── 19_Concatenate.py
│ ├── 20_Diagonal.py
│ └── 21_Common_Elements.py
├── 04_Linked_List
│ ├── 01_Singly_Linked_List
│ │ ├── 22_Create_Simple_Singly_Linked_List.py
│ │ ├── 23_Insertion_at_the_Beginning_of_a_Singly_Linked_List.py
│ │ ├── 24_Insertion_at_the_End_of_a_Singly_Linked_List.py
│ │ ├── 25_Deletion_from_a_Singly_Linked.py
│ │ ├── 26_Reverse_a_Singly_Linked_List.py
│ │ ├── 27_Middle_of_a_Singly_Linked_List.py
│ │ ├── 28_Remove_Duplicates_from_a_Singly_Linked_List.py
│ │ ├── 29_Merge_Two_Sorted_Linked_List.py
│ │ └── 30_Remove_Duplicates.py
│ ├── 02_Circular_Singly_Linked_List
│ ├── 03_Doubly_Linked_List
│ ├── 04_Circular_Doubly_Linked_List
│ ├── Linked_List.py
│ └── README.md
├── Greedy_Algorithms
│ └── Activity_Selection_Problem.py
├── README.md
└── directory_layout_script.py