Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews

Public

Several Coding Patterns for Solving Data Structures and Algorithms Problems during Interviews

  • Stars5.3k+491 tuần này
  • Forks1.4k
  • Watchers32
  • Issues10
  • Ngày tạo25/03/2022
  • Cập nhật gần nhất20/08/2024
  • Ngôn ngữ—
  • Giấy phép—
README.md28.0 KBRaw

Several Coding Patterns for Solving Data Structures and Algorithms Problems during Interviews

These are my notes in Javascript from a course that categorizes coding interview problems into a set of 16 patterns.

Pattern 1: Sliding Window Pattern 9: Two Heaps
Pattern 2: Two Pointer Pattern 10: Subsets
Pattern 3: Fast & Slow pointers Pattern 11: Modified Binary Search
Pattern 4: Merge Intervals Pattern 12: Bitwise XOR
Pattern 5: Cyclic Sort Pattern 13: Top 'K' Elements
Pattern 6: In-place Reversal of a LinkedList Pattern 14: K-way merge
Pattern 7: Tree Breadth First Search Pattern 15: 0/1 Knapsack (Dynamic Programming)
Pattern 8: Depth First Search (DFS) Pattern 16: Topological Sort (Graph)

Additional Resources

Here are a few other resources that I found helpful when learning Data Structures and Algorithms using JavaScript

🌟 Challenge Questions

👩🏽‍🦯 Questions from Blind 75

😐📖 Questions tagged FaceBook/Meta

🌴 Questions tagged Amazon

🔎 Questions tagged Google

In many problems dealing with an array (or a LinkedList), we are asked to find or calculate something among all the contiguous subarrays (or sublists) of a given size. For example, take a look at this problem:

Given an array, find the average of all contiguous subarrays of size K in it.

Lets understand this problem with a real input:

Nội dung README thuộc về Chanda-Abdul và cộng đồng đóng góp, giấy phép Không có giấy phép. Nguồn: github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews