×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

Kartheesh Reddy Koripelli

11 posts •
String Algorithms

Find all anagrams of a given string

In this article, we have explained efficient algorithms to Find all anagrams of a given string. This involve techniques like sliding window approach.

Kartheesh Reddy Koripelli
Interview Problems on Array

Maximum consecutive ones when at most k zeros can be flipped

In this article, we have explored algorithms to Find the longest sequence of consecutive ones when at most k zeros can be altered to 1. This involve techniques like Sliding Window approach.

Kartheesh Reddy Koripelli
Algorithms

Max path sum between two nodes in Binary Tree

In this article, we have explored algorithms to find the Max path sum between two nodes in Binary Tree along with time and space complexity.

Kartheesh Reddy Koripelli
Python

Python Function Arguments

In this article, Python Function Arguments are explored in detail with examples including Positional argument, keyword argument, default argument and variable length argument.

Kartheesh Reddy Koripelli
backtracking

Backtracking Algorithm for Sudoku

In this article, we have covered the Backtracking Algorithm for Sudoku and compared with the Brute Force approach. We have presented the Time and Space Complexity for various cases.

Kartheesh Reddy Koripelli
Algorithms

Fractional Knapsack problem

In this article, we have explored fractional knapsack problem with examples. We have covered multiple approaches to solve this.

Kartheesh Reddy Koripelli
Algorithms

Maximum size square submatrix with all 1s

In this article, we have explored various ways to solve the problem of finding maximum size square submatrix with all 1s. This can be solved using Dynamic Programming.

Kartheesh Reddy Koripelli
Data Structures

Circular Doubly Linked List

In this article, we have explored Circular Doubly Linked List and operations that can be performed on it. It is a combination to two Data Structures namely Circular Linked List and Doubly Linked List.

Kartheesh Reddy Koripelli
Algorithms

Detect Cycle in Undirected Graph using Union Find algorithm

In this article, we've explored the approach to detect a cycle in undirected graph using union-find algorithm. This takes O(VE) Time Complexity.

Kartheesh Reddy Koripelli
Time Complexity

Amortized Time Complexity

In this article, we have explored the concept of Amortized Time Complexity by taking an example and compared it with a related concept: Average Case Time Complexity.

Kartheesh Reddy Koripelli
Python

Random module in Python

In this article, we have explored the Random module in Python in depth and explored the different functions like seed, getrandbits, randrange, choice and much more with Python code examples.

Kartheesh Reddy Koripelli
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship