Types & classes — github.com/FazeelUsmani/Amazon-SDE-Preparation

CodeHub MCPcopy Create free account

hub / github.com/FazeelUsmani/Amazon-SDE-Preparation / types & classes

Types & classes18 in github.com/FazeelUsmani/Amazon-SDE-Preparation

⨍ Functions 216◇ Types & classes 18

07 Linked List/04_reverseLinkedList.cpp:6

07 Linked List/01_middleElement.cpp:6

Code 2020/Linked list/josephus problem.cpp:4

Code 2020/Linked list/josephus problem.cpp:6

Code 2020/Linked list/Linked List Fundamentals.cpp:3

10 Trees/Print_left_view_of_binary_tree.cpp:5

10 Trees/Print_left_view_of_binary_tree.cpp:8

04 Matrix/02 spiralMatrix.cpp:1

04 Matrix/03 boundaryTraversalMatrix.cpp:4

07 Linked List/reverse_Linked_List.cpp:1

Dp approach Top Down /Memoization

15 Dynamic Programming/Longest_common_Subsequence.cpp:6

Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4 Explanation

15 Dynamic Programming/Longest_Increasing_Subsequence.cpp:14

Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1:

15 Dynamic Programming/Maximum_product_Subarray.cpp:18

15 Dynamic Programming/Matrix_chain_Multiplication.cpp:6

Structure for storing starting time, finishing time and position of meeting.

Greedy/N meeting in One room.cpp:7

Declaring a node

07 Linked List/03_InsertInSortedLinkedList.cpp:5

08 Stack/Special Stack.cpp:16

08 Stack/Special Stack.cpp:4