Cracking-Interview

Data Structures and Algorithms
Arrays
Linked List
Strings
Binary Tree
Stack and Queue
- Problems
  1.Min Stack
  2. Max Stack
  3.Valid Parentheses
  4.Evaluate Reverse Polish Notation
  5.Infix And Prefix and Postfix Conversions
  6.Next Greater Element I
  7.Next Greater Element II
  8.Sliding Window Maximum
  9.Gas Station (Circular Tour Problem)
  10.Daily Temperatures
  11.Decode String
  12. Largest Rectangle in Histogram
  13. Maximal Rectangle
  14. Minimum Remove to Make Valid Parentheses
  15. Map of Highest Peak
  16. Longest Valid Parentheses
  17. Online Stock Span
  18. Score of Parentheses
  19. Remove K Digits(imp)
  20. Design a Stack With Increment Operation
  21. Final Prices With a Special Discount in a Shop
  22. Valid Parenthesis String
  23. Reveal Cards In Increasing Order
  24. Remove All Adjacent Duplicates In String
  25. Number of Visible People in a Queue
  26.Number following a pattern
- Implementation
  Implementation of Queue
  Implementation of Stack
  Implementation of Circular Queue
  Implement Queue using Stacks
  Implement Stack using Queues
Hash Table
- Designing and Definitions
  Techniques of hashing and collision resolution
  Design HashSet
  Design HashMap
- Problems
  1.Intersection of Two Arrays
  2.Happy Number
  3.Contains Duplicate
  4.Find the Duplicate Number
  5. Find All Duplicates in an Array
  6. Isomorphic Strings
  7. Group Anagrams
  8. Single Number
  9.Valid Sudoku
  10.Jewels and Stones
  11.First Missing Positive
  12. LRU Cache (V.IMP)
  13. Encode and Decode TinyURL
  14. Alphabet Board Path
Binary Search
Binary Search Tree
Bit manipulation
Graph
Disjoint Sets(Union-Find)
Heap and Priority Queue
Trie
Dynamic Programming
Greedy Algorithms
Backtracking
Sub Array and Sliding Window Problems
Design
Maths
Sorting-Algorithms
Expected Interview MCQ and Questions c++
Concepts in C++
System Design Questions
💾DBMS
🖥️OS
🚙OOPS
- Introduction and Definitions
📨COMPUTER-NETWORKS

Powered by GitBook

On this page

Was this helpful?

Arrays

Two Pointer Method

PreviousMoore’s Voting Algorithm NextLinked List

Last updated 4 years ago

Two Pointer Method

This method is quite helpful in array's to do in-place operations and help us to save an extra space of O(n).

This technique can also be used to solve:

Slow-pointer and fast-pointer problem in Linked List
Sliding Window Problem

Iterate the array from two ends to the middle. One slow-runner and one fast-runner at the same time.