Skip to content

Interviews

Forloop

Initializing search

samitmohan/interviews

Interviews

samitmohan/interviews

index.md
Neetcode 150
Neetcode 150
- Advanced Graphs
  Advanced Graphs
- Arrays & Hashing
  Arrays & Hashing
- Backtracking
  Backtracking
- Binary Search
  Binary Search
- Bit Manipulation
  Bit Manipulation
- Dp
  Dp
- Graphs
  Graphs
- Greedy
  Greedy
- Heap
  Heap
- Intervals
  Intervals
- Linked List
  Linked List
- Math
  Math
  - Detect Squares
  - Is Happy
  - Multiply Strings
  - My Pow
  - Plus One
  - Rotate
  - Set Zeroes
  - Spiral Order
  - Xor
- Sliding Window
  Sliding Window
- Stack
  Stack
- Trees
  Trees
- Tries
  Tries
- Two Pointers
  Two Pointers
Practice Problems
Practice Problems
- Array
  Array
- Dp
  Dp
- Design Dsa
  Design Dsa
- Graphs
  Graphs
- Greedy
  Greedy
  - Get Longest Subsequence
  - Max Removal
- Hashing
  Hashing
- Heaps
  Heaps
  - Ipo
- Linked List
  Linked List
- Math
  Math
- Queues
  Queues
  - Queue Using Stack
- Recursion
  Recursion
- Searching & Sorting
  Searching & Sorting
- Sliding
  Sliding
- Stack
  Stack
- String
  String
- Trees
  Trees
- Union Find
  Union Find
  - Smallest Equivalent String
DSA Implementations
DSA Implementations
- Algorithms
  Algorithms
  - Boyer Moore
  - Dijkstra
  - Floyd Warshall
  - Kadane
  - Kmp
  - Kruskal
  - Prefix Sum
  - Prims
  - Slidingwindow
  - Slow Fast
  - Two Pointer
  - Union Find
- Graph
  Graph
- Hash Tables
  Hash Tables
- Heap
  Heap
  - Max Heap
  - Min Heap
- Linked List
  Linked List
- Searching Sorting
  Searching Sorting
- Stack Queue
  Stack Queue
- Travelling Salesman
  Travelling Salesman
- Tree
  Tree
- Trie
  Trie
  - Trie Implementation
Striver Sheet
Striver Sheet
- Arrays
  Arrays
- Dp
  Dp
  - Min Path Sum
- Graph
  Graph
  - Floodfill
- Ll
  Ll
  - Delete Node
  - Rotate Right
- String
  String
  - Repeated String Match
- Trees
  Trees
  - Build Tree
  - Width Of Bt
Company Questions
Company Questions
- Epi Fi Prep
  Epi Fi Prep
- Data Insights Prep
  Data Insights Prep
Python
Python
- Misc
  Misc
  - Function Overloading
  - Pretty Recursion
- Oops
  Oops
- Python Tricks
  Python Tricks
  - Blog
Operating Systems
Operating Systems
- Prerequisite
  Prerequisite
  - B
  - Bankers
  - Dp
  - Exec
  - Fcfs
  - Forkbasics
  - Pc
  - Peterson Soln
  - Reader Writer
  - Semaphore
  - Sjfs
  - Threading
Design Patterns
Design Patterns
- Singleton
Time Complexity
Time Complexity
- Complexity

Forloop¶

lst = [1, 42, 14, 29, 244]
for i, _ in enumerate(lst):
    print(i)

Made with Material for MkDocs