- Maximum Subarray Problem using Kadene's Algorithm
- Rotate Array
- O(2n) implementation instead of O(n2)
- https://practice.geeksforgeeks.org/problems/rotate-array-by-n-elements/0
- Add one To number
- Converting Array of digits of number to another array of digits by adding 1
- Removing leading zeros if present
- If direcly converted from array to number -> may lead to overlflow for large array
- https://www.interviewbit.com/problems/add-one-to-number/
- Minimum steps in an infinite grid
- You are in an infinite 2D grid where you can move in any of the 8 directions
- You are given a sequence of points and the order in which you need to cover the points. Give the minimum number of steps in which you can achieve it. You start from the first point.
- https://www.interviewbit.com/problems/min-steps-in-infinite-grid/
- Kth row of Pascal's triangle
- Maximum sub array sum using divide and conquer
- Find the single non-repeating number
- https://leetcode.com/explore/other/card/30-day-leetcoding-challenge/528/week-1/3283/ (look for solution in the solution section)
- Find if the number is happy number
- Product of array except self
- Finding an element in a rotated sorted array
- Is BST symmetric (Left and right halves are mirror images)
- Construct BST from PRE-ORDER
- Bitwise AND of the range of given numbers
- Median of two sorted arrays
- Maxiumal Square
-
Notifications
You must be signed in to change notification settings - Fork 0
bhaver11/fundamentals
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Fundamental programs in Algorithms and Data structures.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published