Week 01 , Day 02

Week 01 , Day 02


Let's deep dive into hashing , Sliding Window and Two Pointers.


  1. Fruits Into Baskets

Techniques involved :

2. Snake in Matrix

Techniques Involved

3 . Binary Subarrays With Sum

Techniques Involved : Hashing with two pointers.


4.

Techniques Involved : Hashing with two pointers. Approach is Similar to Solution of no: 1 Problem of this article.


Conclusion : Hashing and Sliding Windows are becoming interesting here.

要查看或添加评论,请登录

Diwanshu Baskota的更多文章

  • Fundamentals of Project Management

    Fundamentals of Project Management

    What is Project Management? Project Management is the structured way of planning, organizing, and executing tasks to…

  • Week 01, Day 03

    Week 01, Day 03

    I solved problems going from backtracking to stack. Backtracking is really a nice concept in Computer Science.

  • Week 01 , Day 01

    Week 01 , Day 01

    Let's be Greedy , hashed this week . The two Pointer and Sliding window will add door to leetcode Streaks.

社区洞察

其他会员也浏览了