Competitive Programming Day 03??

Competitive Programming Day 03??

Welcome to day 03 of coding adventure. Today is another exciting day of my coding journey i am thrilled to share my experience with you. I spent 3 hours exploring advanced array techniques. There are so many edge cases in each problem i solved today.

Today i solved medium level questions to push my understanding of arrays to next level. Here is what i worked on today:

  • I used the two-pointer technique to find the maximum area by moving the pointers inward from both ends.
  • For solving sum challenges i used two pointers technique and used hash mapping techniques.
  • I learnt how important it is to solve a problem by checking all edge cases.

Today exploration of advanced arrays techniques has been both challenging and rewarding and I'm eager to see how these incremental steps shape my overall coding journey.

Hoping for the best, see you all in other day. Until then take care and keep pushing forward!??

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

Meghana Manchala的更多文章

  • Competitive Programming 61??

    Competitive Programming 61??

    Day 61: Counting the Number of Islands in an Image, Top K Frequent Words, Permutations II, LRU Cache Dear Developers!…

  • Competitive Programming 60??

    Competitive Programming 60??

    Day 60: Permutations,subsets,letter combi Hi everyone! ?? Today, I dedicated time to work on some exciting coding…

  • Competitive Programming 54??

    Competitive Programming 54??

    Day 54: Binary Search,Search in Rotated Sorted Array, Kth Largest Element in an Array, First Bad Version Dear…

  • Competitive Programming 53??

    Competitive Programming 53??

    Day 53: Counting the Number of Islands in an Image, Top K Frequent Words, Permutations II, LRU Cache Dear Developers!…

  • Competitive Programming 52??

    Competitive Programming 52??

    Day 52: Cookie Handout, Lemonade Change, Maximum Units on a Truck, Two-City Scheduling and Jump Game Hello Developers!…

  • Competitive Programming 56??

    Competitive Programming 56??

    Day 56: Square of Sorted Array, Remove Element, Reverse Only Letters, Pivot Index and Check If Array Is Sorted and…

  • Competitive Programming 50??

    Competitive Programming 50??

    Day 50: Implement Queue using Stacks, Design Circular Queue, Counting Bits, Partition Labels and Candy Dear Developers!…

  • Competitive Programming 49??

    Competitive Programming 49??

    Day 49: Binary Search,Search in Rotated Sorted Array, Kth Largest Element in an Array, First Bad Version Dear…

  • Competitive Programming 48??

    Competitive Programming 48??

    Day 48: Binary Search,Search in Rotated Sorted Array, Kth Largest Element in an Array, First Bad Version Dear…

  • Competitive Programming 47??

    Competitive Programming 47??

    Day 47: Binary Search,Search in Rotated Sorted Array, Kth Largest Element in an Array, First Bad Version Dear…

社区洞察

其他会员也浏览了