GT Notes
Search
CTRL + K
GT Notes
Search
CTRL + K
01. Coding Practice
01. Leetcode Problems
01. Practice
01. Programming Skills
Programming Skills I
0104
0191
0202
0217
0232
0242
0283
0303
0389
0404
0496
0566
0589
0709
0876
0953
0976
1232
1281
1290
1309
1356
1491
1502
1523
1572
1588
1603
1672
1678
1768
1779
1790
1822
Programming Skills II
0002
0028
0043
0048
0049
0054
0058
0061
0066
0067
0110
0138
0143
0150
0155
0173
0304
0341
0380
0429
0438
0445
0459
0503
0556
0622
0707
0713
0729
0739
0860
0896
0910
0973
0989
1367
1376
1630
1797
1845
1886
Programming Skills III
0008
0023
0065
0146. LRU Cache
0148. Sort List
0208. Implement Trie (Prefix Tree)
0209. Minimum Size Subarray Sum
0211. Design Add and Search Words Data Structure
0214. Shortest Palindrome
0224. Basic Calculator
0227. Basic Calculator II
0241. Different Ways to Add Parentheses
0244. Shortest Word Distance II
0251. Flatten 2D Vector
0255. Verify Preorder Sequence in Binary Search Tree
0281. Zigzag Iterator
0282. Expression Add Operators
0295. Find Median from Data Stream
0297. Serialize and Deserialize Binary Tree
0307. Range Sum Query - Mutable
0325. Maximum Size Subarray Sum Equals k
0348. Design Tic-Tac-Toe
0353. Design Snake Game
0369. Plus One Linked List
0381. Insert Delete GetRandom O(1) - Duplicates allowed
0426. Convert Binary Search Tree to Sorted Doubly Linked List
0431. Encode N-ary Tree to Binary Tree
0449. Serialize and Deserialize BST
0460. LFU Cache
0525. Contiguous Array
0535. Encode and Decode TinyURL
0631. Design Excel Sum Formula
0635. Design Log Storage System
0641. Design Circular Deque
0642. Design Search Autocomplete System
0708. Insert into a Sorted Circular Linked List
0715. Range Module
0772. Basic Calculator III
0855. Exam Room
0895. Maximum Frequency Stack
0901. Online Stock Span
1166. Design File System
1244. Design A Leaderboard
1352. Product of the Last K Numbers
1396. Design Underground System
1570. Dot Product of Two Sparse Vectors
1586. Binary Search Tree Iterator II
1597. Build Binary Expression Tree From Infix Expression
1622. Fancy Sequence
1628. Design an Expression Tree With Evaluate Function
1634. Add Two Polynomials Represented as Linked Lists
1798. Maximum Number of Consecutive Values You Can Make
1804. Implement Trie II (Prefix Tree)
1836. Remove Duplicates From an Unsorted Linked List
05. Dynamic Programming
Dynamic Programming I
0509. Fibonacci Number
02. Interview Preparation
01. Blind 75
01. Arrays
01. Two Sum
02. Valid Anagram
03. Product of Array Except Self
04. Contains Duplicate
05. Group Anagrams
06. Encode and Decode Strings
07. Tok K Frequent Elements
02. Striver SDE Sheet
01. Arrays
01. Set Matrix Zeros
02. Pascal's Triangle
03. Next Permutation
04. Kadane's Algorithm
05. Sort an array of 0s, 1s and 2s
06. Best Time to Buy and Sell Stock
02. Arrays Part-II
01. Rotate Matrix
02. Merge Overlapping SubIntervals
03. Merge Sorted Arrays
04. Duplicate in an array of N+1 Ints
05. Repeat and Missing Number
06. Inversions of an Array
03. Arrays Part-III
01. Search in a 2D Matrix
02. Pow(x, n)
03. Moore Voting Algorithm
04. Generalized Boyer Moore Voting Algorithm
05. Grid Unique Paths
06. Reverse Pairs
04. Arrays Part-IV
01. 2Sum Problem
02. 4Sum Problem
03. Longest Consecutive Sequence
04-A. Largest Subarray with 0 Sum
04-B. Subarray Sum Equals K
05. Subarray with Given XOR
05. Linked List-I
01. Reverse a Linked List
02. Middle of a Linked List
03. Merge Two Sorted Lists
04. Remove Nth Node From End of List
05. Add Two Numbers
06. Delete Node in a Linked List
06. Linked List-II
01. Intersection of Two Linked Lists
02. Linked List Cycle
03. Reverse Nodes in k-Group
04. Palindrome Linked List
05. Linked List Cycle II
06. Flatten a Linked List
07. Linked List and Arrays
01. Rotate a Linked List
02. Copy List with Random Pointer
03. 3Sum
05. Remove Duplicates from Sorted Array
06. Max Consecutive Ones
09. Recursion
01. Subset Sums
02. Subsets II
03. Combination Sum
02. DeepML Problems
01. Matrix times Vector
02. Transpose of a Matrix
03. Reshape Matrix
04. Calculate Mean by Row or Column
05. Scalar Multiplication of a Matrix
06. Calculate Eigenvalues of a Matrix
07. Matrix Transformation
08. Calculate 2x2 Matrix Inverse
09. Matrix times Matrix
10. Calculate Covariance Matrix
Welcome to GT Notes!
Implement strStr()
class Solution: def strStr(self, haystack: str, needle: str) -> int: return haystack.find(needle)