We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • Practice
  • Certification
  • Compete
  • Career Fair
  • Hiring developers?
  1. Practice
  2. Data Structures
  3. Arrays
  4. Array Manipulation
  5. Discussions

Array Manipulation

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • Kanahaiya 2 years ago+ 0 comments

    Hi,

    Most of the peope solved this problem but time complexity of solution is O(n*m) (due to two nested for loops)which can not be used to solve this problem for given time constraint, so you need better approach which beats O(n*m)

    I have created a video tutorial for you and uploaded the same on youtube with complete explanation along with code complexity analysis.

    Here is the video tutorial for my solution O(n+m) complexity passed all test cases.

    https://youtu.be/hDhf04AJIRs

    Would really appreciate your feedback like, dislike , comment etc. on my video.

    -4|
    ParentPermalink
  • Contest Calendar
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature