#TitleSolutionTimeSpaceDifficultyPointsNote Solve Me First Java C# O(1) O(1) Easy 1 Simple Array Sum Java C# O(n) O(1) Easy 10 Compare the Triplets Java C# O(1) O(1) Easy 10 A Very Big Sum Java C# O(n) O(1) Easy 10 Diagonal Difference Java C# O(n) O(1)...
Print the Elements of a Linked List C++ O(n) O(1) Easy 5 Reverse a Linked List Java O(n) O(1) Easy 5 Compare Two Linked Lists C++ O(n) O(1) Easy 5 Delete a node C++ O(n) O(1) Easy 5 Trees#TitleSolutionTimeSpaceDifficultyPointsNote Tree: Preorder Traversal C++ O(n)...
#TitleSolutionTimeSpaceDifficultyPointsNote Solve Me First Java C# O(1) O(1) Easy 1 Simple Array Sum Java C# O(n) O(1) Easy 10 Compare the Triplets Java C# O(1) O(1) Easy 10 A Very Big Sum Java C# O(n) O(1) Easy 10 Diagonal Difference Java C# O(n) O(1)...
#TitleSolutionTimeSpaceDifficultyPointsNote Solve Me First Java C# O(1) O(1) Easy 1 Simple Array Sum Java C# O(n) O(1) Easy 10 Compare the Triplets Java C# O(1) O(1) Easy 10 A Very Big Sum Java C# O(n) O(1) Easy 10 Diagonal Difference Java C# O(n) O(1)...
Print the Elements of a Linked List C++ O(n) O(1) Easy 5 Reverse a Linked List Java O(n) O(1) Easy 5 Compare Two Linked Lists C++ O(n) O(1) Easy 5 Delete a node C++ O(n) O(1) Easy 5 Trees#TitleSolutionTimeSpaceDifficultyPointsNote Tree: Preorder Traversal C++ O(n)...
Print the Elements of a Linked List C++ O(n) O(1) Easy 5 Reverse a Linked List Java O(n) O(1) Easy 5 Compare Two Linked Lists C++ O(n) O(1) Easy 5 Delete a node C++ O(n) O(1) Easy 5 Trees#TitleSolutionTimeSpaceDifficultyPointsNote Tree: Preorder Traversal C++ O(n)...
Insert - O(log(n)), Delete - O(n), Print - O(1) Insert - O(1), Delete - O(1), Print - O(1) Easy 25 Disjoint Set #TitleSolutionTimeSpaceDifficultyPointsNote Spaceholder C# O(1) O(1) Easy 1 Multiple Choice #TitleSolutionTimeSpaceDifficultyPointsNote Data Structures MCQ 1 ...
Language Independent NA NA Hard 5 Data Structures MCQ 3 Language Independent NA NA Hard 5 Trie#TitleSolutionTimeSpaceDifficultyPointsNote Contacts C# Add - O(L), Find - O(L) Add - O(L), Find - O(1) Medium 40 L = Length of a contact nameAdvanced#...
Insert - O(log(n)), Delete - O(n), Print - O(1) Insert - O(1), Delete - O(1), Print - O(1) Easy 25 Disjoint Set #TitleSolutionTimeSpaceDifficultyPointsNote Spaceholder C# O(1) O(1) Easy 1 Multiple Choice #TitleSolutionTimeSpaceDifficultyPointsNote Data Structures MCQ 1 Lan...
Language Independent NA NA Hard 5 Data Structures MCQ 3 Language Independent NA NA Hard 5 Trie#TitleSolutionTimeSpaceDifficultyPointsNote Contacts C# Add - O(L), Find - O(L) Add - O(L), Find - O(1) Medium 40 L = Length of a contact nameAdvanced...