Functions — github.com/FazeelUsmani/Amazon-SDE-Preparation

CodeHub MCPcopy Create free account

hub / github.com/FazeelUsmani/Amazon-SDE-Preparation / functions

Functions216 in github.com/FazeelUsmani/Amazon-SDE-Preparation

⨍ Functions 216◇ Types & classes 18

↓ 20 callersMethodpush

08 Stack/Special Stack.cpp:27

↓ 15 callersMethodfind

05 Hashing/firstNonRepeatingCharacter.java:1

↓ 14 callersFunctionsort

03 Sorting/Bitonic Sort.py:35

↓ 13 callersMethodpop

08 Stack/Special Stack.cpp:40

↓ 8 callersFunctionnewNode

A utility function to create a new Binary Tree Node

10 Trees/Print_left_view_of_binary_tree.cpp:13

↓ 6 callersFunctioninsertAtTail

Inserting at tail

07 Linked List/03_InsertInSortedLinkedList.cpp:19

↓ 5 callersFunctionprint

07 Linked List/04_reverseLinkedList.cpp:35

↓ 4 callersFunctiondisplay

displaying all the elements in the linked list

07 Linked List/03_InsertInSortedLinkedList.cpp:39

↓ 3 callersFunctioninsertInSortedLinkedList

Inserting a new node in sorted linked list

07 Linked List/03_InsertInSortedLinkedList.cpp:51

↓ 3 callersFunctionpush

Method to add element to stack

08 Stack/Stack_USing_Array.cpp:6

↓ 2 callersFunctioncheck

05 Hashing/04 matchSpecificPattern.cpp:1

↓ 2 callersFunctioninsert

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

↓ 2 callersFunctionlengthlist

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

↓ 2 callersFunctionmaxheap

Code 2020/Heap/makingheap.cpp:4

↓ 2 callersFunctionremoveDuplicates

01 Arrays/26 unionTwoSortedArrays.cpp:1

↓ 1 callersFunctionEratosthenes

Code 2020/Arrays/Arrangement and Rearrangement/try.cpp:6

↓ 1 callersFunctionFindKthLargest

Function to find the K'th largest element in the array using min-heap

Code 2020/Arrays/Order statistics/kth largest using minheap.cpp:8

↓ 1 callersFunctionLongest_common_Subsequence_BU_s

Dp approach without Dynamic memory

15 Dynamic Programming/Longest_common_Subsequence.cpp:95

↓ 1 callersMethodMatrix

15 Dynamic Programming/Matrix_chain_Multiplication.cpp:9

↓ 1 callersFunctionMaxSum

15 Dynamic Programming/Maxium_Subarray_Sum.cpp:5

↓ 1 callersFunctionMaxSum_II

Kadane's Algorithm O(n) O(1)

15 Dynamic Programming/Maxium_Subarray_Sum.cpp:28

↓ 1 callersFunctionMinstepBU

15 Dynamic Programming/Minimum_Steps_to-One.cpp:37

↓ 1 callersFunctionaddafter

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

↓ 1 callersFunctionbitonicMerge

(a, low, cnt, dire)

03 Sorting/Bitonic Sort.py:15

↓ 1 callersFunctionbitonicSort

(a, low, cnt,dire)

03 Sorting/Bitonic Sort.py:26

↓ 1 callersFunctionbuildheap

Code 2020/Heap/makingheap.cpp:27

↓ 1 callersFunctioncompAndSwap

(a, i, j, dire)

03 Sorting/Bitonic Sort.py:7

↓ 1 callersFunctionfind

05 Hashing/07 firstNonRepeatingCharacter.cpp:1

↓ 1 callersFunctionfindno

Code 2020/Arrays/Array rotation/find_element_at_index.cpp:4

↓ 1 callersFunctionfun

Code 2020/Arrays/Array rotation/pointer_call_fuction.cpp:3

↓ 1 callersFunctionfun1

Code 2020/Arrays/Arrangement and Rearrangement/min swaps for less than or equal to k.cpp:4

↓ 1 callersFunctionfun2

Code 2020/Arrays/Arrangement and Rearrangement/min swaps for less than or equal to k.cpp:20

↓ 1 callersFunctiongcd

01 Arrays/05 rotateArray.cpp:8

↓ 1 callersFunctiongetMiddle

07 Linked List/01_middleElement.cpp:18

↓ 1 callersMethodisIsomorphic

(String s, String t)

05 Hashing/matchSpecificPattern.java:1

↓ 1 callersFunctionisMajority

02 Searching/01 majorityElement.cpp:2

↓ 1 callersFunctionjosephus

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

↓ 1 callersFunctionleftView

A wrapper over leftViewUtil()

10 Trees/Print_left_view_of_binary_tree.cpp:45

↓ 1 callersFunctionleftViewUtil

Recursive function to print left view of a binary tree.

10 Trees/Print_left_view_of_binary_tree.cpp:24

↓ 1 callersFunctionleftrotate

Code 2020/Arrays/Array rotation/array_llrotation.cpp:4

↓ 1 callersMethodlengthOfLIS

15 Dynamic Programming/Longest_Increasing_Subsequence.cpp:16

↓ 1 callersFunctionmain

01 Arrays/19 trappingRainWater.py:27

↓ 1 callersFunctionmaxMeeting

Function for finding maximum meeting in one room

Greedy/N meeting in One room.cpp:22

↓ 1 callersMethodmaxProduct

15 Dynamic Programming/Maximum_product_Subarray.cpp:21

↓ 1 callersFunctionmaxsum

Code 2020/Hash/Maxsum subarray.cpp:4

↓ 1 callersFunctionmerge

Code 2020/Heap/merge.cpp:4

↓ 1 callersFunctionmergesort

Code 2020/Heap/merge.cpp:40

↓ 1 callersFunctionmidelement

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

↓ 1 callersFunctionoverlappedInterval

01 Arrays/21_OverlappingIntervals.cpp:10

↓ 1 callersFunctionoverlappedInterval

01 Arrays/21[optimized]OverlappingIntervals.cpp:9

↓ 1 callersFunctionpair_check

Code 2020/Arrays/Array rotation/Find_pair_with_givn_sum.cpp:4

↓ 1 callersFunctionpop

Method to delete the element from Stack

08 Stack/Stack_USing_Array.cpp:11

↓ 1 callersFunctionprint3largest

Code 2020/Arrays/Order statistics/first three largest no in O(n).cpp:3

↓ 1 callersFunctionprintlist

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

↓ 1 callersFunctionrev

Code 2020/Arrays/Arrangement and Rearrangement/Reverse words.cpp:4

↓ 1 callersFunctionreverseList

07 Linked List/04_reverseLinkedList.cpp:18

↓ 1 callersFunctionrotateArr

01 Arrays/05 rotateArray.cpp:17

↓ 1 callersFunctionsearch

Code 2020/Arrays/Array rotation/find_min_in_sorted_rotated_array.cpp:4

↓ 1 callersFunctionsearch

Code 2020/Arrays/Array rotation/Find_element_in_array.cpp:4

↓ 1 callersFunctionsolve

Code 2020/Arrays/Arrangement and Rearrangement/try.cpp:22

↓ 1 callersFunctionsolve

Code 2020/Hash/water bucket.cpp:4

↓ 1 callersFunctionsolve

Code 2020/Linked list/maximised partition amazon.cpp:4

↓ 1 callersFunctionsolve

Code 2020/Linked list/substring of k length and k distinct k letters.cpp:4

↓ 1 callersFunctiontogetnode

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

↓ 1 callersFunctiontogetnodefromend

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

↓ 1 callersFunctiontrappingWater

01 Arrays/19 trappingRainWater.py:2

07 Linked List/04_reverseLinkedList.cpp:11

07 Linked List/01_middleElement.cpp:11

MethodLongestSubsequence_TD

15 Dynamic Programming/Longest_common_Subsequence.cpp:9

FunctionLongest_common_Subsequence_BU

Dp approach with Dynamic memory

15 Dynamic Programming/Longest_common_Subsequence.cpp:72

FunctionMissingNumber

02 Searching/03 missingNuminArr.cpp:1

FunctionNumberofElementsInIntersection

Given two arrays A and B and their sizes N and M respectively

01 Arrays/27 intersectionTwoArrays.cpp:2

MethodRecursive

15 Dynamic Programming/Longest_common_Subsequence.cpp:28

FunctionSortBinaryArray

01 Arrays/28 binaryArraySorting.cpp:1

FunctionSteps_toOne

minimum steps to one

15 Dynamic Programming/Minimum_Steps_to-One.cpp:6

Functionarrange

01 Arrays/24 rearrangeArray.py:1

06 String/06 atoi.cpp:1

FunctionbinarySubstring

06 String/07 binaryString.cpp:1

MethodboundaryTraversal

04 Matrix/03 boundaryTraversalMatrix.cpp:40

MethodboundaryTraversalNew

04 Matrix/03 boundaryTraversalMatrix.cpp:7

FunctioncircularSubarraySum

01 Arrays/23 maxCircularSubarray.cpp:1

FunctioncombineParts

exam/1_amazon_fullfillment_builder.cpp:8

Functioncomparator

Comparator function which can compare the second element of structure used to sort pairs in increasing order of second value.

Greedy/N meeting in One room.cpp:16

FunctionconvertFive

you are required to complete this method*/

01 Arrays/01 Replace0with5.cpp:3

FunctionconvertToRoman

06 String/03 convertToRomanNumber.cpp:1

FunctionconvertToWave

01 Arrays/12 waveArray.cpp:1

FunctioncountDistinct

05 Hashing/05 countDistinctElements.cpp:1

MethodcountDistinct

(int a[], int n, int k)

05 Hashing/countDistinctElementInEveryWindow.java:1

Functiondeletelist

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

Functionduplicates

01 Arrays/10 find_duplicates_in_array.cpp:1

FunctionequilibriumPoint

01 Arrays/13 equilibriumPoint.cpp:1

Functionfind3Numbers

01 Arrays/09 sortedSubsequence3.cpp:1

04 Matrix/04 nthEleSpiralMatrix.cpp:3

FunctionfindMatchedWords

05 Hashing/04 matchSpecificPattern.cpp:21

MethodfindMatchedWords

(ArrayList<String> dict, String pattern)

05 Hashing/matchSpecificPattern.java:18

FunctionfindPairs

05 Hashing/08 positiveNegativePair.cpp:1

FunctionfindUnion

01 Arrays/26 unionTwoSortedArrays.cpp:17

FunctionfloorSqrt

Function to find square root x: element to find square root

02 Searching/02 squareRoot.cpp:4

Functionfrequencycount

01 Arrays/25 freqOfLimitedRangeArrEle.cpp:4

08 Stack/Special Stack.cpp:65

next →1–100 of 216, ranked by callers