Data structure and algorithms for interviews

Description

Covers round 20+ hottest coding interview issues starting from quite a lot of matters   ( may have 200+ issues as 4 issues are being added each week)

• Merge Intervals

  • Thought of Merge Intervals

  • Merge Intervals

  • Intervals Intersection ( coming quickly)

  • Conflicting Appointments ( coming quickly)

• Two Pointers

  • Thought of Two pointers and kinds of two pointers options

  • Two Sum

  • Take away Duplicates from Sorted Array

  • 3 Sum

  • Pair with Goal Sum  ( coming quickly)

  • Squaring a Sorted Array  ( coming quickly)

  • Triplet Sum to Zero   ( coming quickly)

  • Triplet Sum Near Goal   ( coming quickly)

  • Triplets with Smaller Sum   ( coming quickly)

  • Subarrays with Product Lower than a Goal  ( coming quickly)

  • Dutch Nationwide Flag Downside  ( coming quickly)

• Quick & Gradual Pointers

  • Linked Listing Cycle utilizing Floyd’s Cycle Detection Algorithm

  • Joyful Numbers

  • Ugly quantity  ( coming quickly)

  • Center of the LinkedList ( coming quickly)

  • LinkedList Cycle  ( coming quickly)

  • Begin of LinkedList Cycle ( coming quickly)

• Bitwise Manipulation

  • Single Numbers 

  • Flipping an Picture

  • Single Quantity II ( coming quickly)

  • Single Quantity III ( coming quickly)

• Grasping Method

  • What are Grasping Algorithms ?

  • Bulbs

  • Highest Product

  • Disjoint Units

  • Largest Permutation ( coming quickly)

  • Assembly rooms ( coming quickly)

  • Distribute Sweet ( coming quickly)

  • Seats ( coming quickly)

  • Assign Mice to Holes ( coming quickly)

  • Majority Component ( coming quickly)

  • Gasoline Station ( coming quickly)

• Island Patterns

  • Intro to Matrix

  • Variety of Islands Rationalization

  • Variety of Islands Code

  • Variety of distinct Islands Rationalization

  • Variety of distinct island coding

  • Rely sub islands   

  • Max Space of an island   ( coming quickly)

  • Island Perimeter  ( coming quickly)

  • Flood fill  ( coming quickly)

  • Wall and Fates   ( coming quickly)

  • Minesweeper   ( coming quickly)

  • Surrounded Areas   ( coming quickly)

  • Discover all teams of a farm land   ( coming quickly)

• Graphs

  • Introduction to Graph Issues 

  • Topological Kind

  • Kahn’s Algorithm

Upcoming Additions  (3-4 issues are added each week)

• Sliding Window

  • Simple

    • Most Sum Subarray of Measurement Okay

    • Smallest Subarray With a Larger Sum

  • Medium

    • Longest Substring with most Okay Distinct Characters 

    • Fruits into Baskets

  • Laborious

    • Longest Substring with Distinct Characters

    • Longest Substring with Identical Letters after Alternative

    • Longest Subarray with Ones after Alternative

• Arrays

  • Medium

    • Group Anagrams

  • Laborious

    • Trapping Rain Water

• Merge Intervals

  • Medium

    • Intervals Intersection

    • Conflicting Appointments

• Linked Listing

  • Simple

    • Reverse a Linked Listing

  • Medium

    • Reverse a sub listing

    • Reverse a k-element sub listing

• Two Heaps

  • Medium

    • Discover the median of a quantity stream

  • Laborious

    • Most Capital

    • Sliding Window Median 

• Prime ok components

  • Simple

    • Prime ‘Okay’ Numbers

    • Kth Smallest Quantity

    • ‘Okay’ Closest Factors to the Origin

    • Join Ropes

  • Medium

    • Prime ‘Okay’ Frequent Numbers

    • Frequency Kind

    • Kth Largest Quantity in a Stream

    • ‘Okay’ Closest Numbers

    • Most Distinct Components

    • Sum of Components

  • Laborious

    • Rearrange String

• Okay-way merge

• Binary Search

• Backtracking

• 1D Dynamic programing

• 2D Dynamic programing

• Cyclic Kind

• Topological Kind

• Stacks

• Queues

• Depth First Search

• Breadth First Search

• Trie

• Hash Maps

• Math Tips

• Miscellaneous