Skip to content
CodeMarvels
All's the Code !
  • Home
  • Privacy Policy
  • About

Tag: subarray

Algorithms

Largest Sum Contiguous Subarray

Posted on July 7, 2013 by saurabh / 1 Comment

We have a sequence of integers and we need the maximum sum from the continuous sub-sequences. Example- Let the sequence of integers be (3,-4,5,-7,8,-6,21,-14,-9...

Algorithms

Subarray with given sum

Posted on July 7, 2013 by saurabh / 0 Comment

Given a list of integers,our task is to find if a sub-sequence which adds to a given number exists or not. Example- The given list is (1,4,20,5,5) and the given...

Categories

  • Algorithms
  • Android Development
  • BoshServlet
  • C++ projects
  • Code Philosophies
  • Conversational AI
  • Machine Learning
  • Miscellaneous
  • Notes
  • Society
  • Technology
  • Tutorial / Run-book
  • Uncategorized

Recent Posts

  • SSH without running .bashrc
  • Migrate data from one Cassandra server to another using medusa
  • A JS assistant to remind us to exercise during WFH days
  • Flush DNS cache in Ubuntu 20.xx and above
  • Change the datacenter set in cassandra-rackdc on Ubuntu

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org
© 2022 CodeMarvels
Powered by WordPress | Theme: Graphy by Themegraphy