Lexicographical concatenation of all substrings of a string | GeeksforGeeks

preview_player
Показать описание

This video is contributed by Ishmeet Kaur

Please Like, Comment and Share the Video among your friends.

Install our Android App:

Follow us on Facebook:

And Twitter:

Also, Subscribe if you haven't already! :)
  1. GeeksforGeeks
  2. GeeksforGeeks
  3. Programming
  4. Algorithms
  5. Data Structures
  6. Coding
Рекомендации по теме
Lexicographical concatenation of 0:02:03

Lexicographical concatenation of all substrings of a string | GeeksforGeeks

Lexicographical Maximum substring 0:02:51

Lexicographical Maximum substring of string | GeeksforGeeks

leetCode 30 Substring 0:24:01

leetCode 30 Substring with Concatenation of All Words | JavaScript & Algorithm

Substring with Concatenation 0:07:18

Substring with Concatenation of All Words ( algorithm problem solving )

leetcode 30 substring 0:02:03

leetcode 30 substring with concatenation of all words

Leetcode 30 Substring 0:16:03

Leetcode 30 Substring with Concatenation of All Words

Leetcode 30. Substring 0:19:37

Leetcode 30. Substring with Concatenation of All Words - Again two-pointer sliding window

1362 · Substring 0:07:15

1362 · Substring with Concatenation of All Words | LeetCode | C++

30. Substring with 0:27:45

30. Substring with Concatenation of All Words (Leetcode Hard)

Lexicographic Orderings 0:03:45

Lexicographic Orderings

[ru] LeetCode - 0:08:11

[ru] LeetCode - 30. Substring with Concatenation of All Words

Leetcode 30: Substring 0:21:49

Leetcode 30: Substring with Concatenation of All Words

Lexi String problem 0:19:12

Lexi String problem | TCS CodeVita 2023-2024 | TCS CodeVita Preparation series

Shortest String That 0:09:56

Shortest String That Contains Three Strings - LEETCODE WEEKLY CONTEST 356 (Explanation in details)

what is lexicographic 0:01:22

what is lexicographic ordering

Google Coding Question-Maximum 0:45:19

Google Coding Question-Maximum Length of a Concatenated String with Unique Characters -Leetcode 1239

Power Set | 0:17:45

Power Set | Find All Subset of a String | Bit Manipulation | Algorithms Coding Interview Question

1239 Maximum Length 0:06:19

1239 Maximum Length of a Concatenated String with Unique Characters

The k-th Lexicographical 0:11:36

The k-th Lexicographical String of All Happy Strings of Length n (Leetcode 1415)

LeetCode :Number of 0:23:48

LeetCode :Number of Pairs of Strings With Concatenation Equal to Target |Java

Leetcode Weekly contest 0:09:33

Leetcode Weekly contest 349 - Medium - Lexicographically Smallest String After Substring Operation

LeetCode 1163. Last 0:23:56

LeetCode 1163. Last Substring in Lexicographical Order

Fundamentals of Stringology 1:00:42

Fundamentals of Stringology III: Suffix Tress and Suffix Arrays

Mastering Strings in 0:10:21

Mastering Strings in C++: A Comprehensive Guide

Комментарии
Автор

Thanks Igor Carpanese for pointing out that the time complexity in worst case would be O(n³).
As for substr, even though time complexity is not specified, depends upon the length of substring requested. And substr is called inside code with complexity O(n²).

GeeksforGeeksVideos
Автор


Correct me If m wrong we don't need sorting to get the desired result as the O/P shown at 0:27 seconds.

jaatharsh
Автор

The time complexity of std::string::substr method is O(n). [1]

You call std::string::substr O(n²) times, so the final time complexity should be O(n³), shouldn't it?

carpanese
visit shbcf.ru