---
title: "Vineeth Chivukula (@vineethchivukula) | Hashnode"
description: "Developer && Video editor. Read the latest articles by Vineeth Chivukula on Hashnode."
url: "https://hashnode.com/@vineethchivukula"
---

@vineethchivukula

# Vineeth Chivukula

@vineethchivukula · Andhra Pradesh, India · Joined June 2024

Developer && Video editor

### [Solving Fibonacci Number](https://vineethchivukula.hashnode.dev/solving-fibonacci-number?utm_source=hashnode&utm_medium=feed)

To see the question, click here. Naive Approach The idea is to use a recursive approach to compute the Fibonacci sequence. If n is 0 or 1, return n directly, as these are the base cases for the Fibonacci sequence. For any other value of n, recursivel...

4 min read · [vineethchivukula.hashnode.dev](https://vineethchivukula.hashnode.dev/solving-fibonacci-number?utm_source=hashnode&utm_medium=feed)

[Jul 14, 2024](https://hashnode.com/posts/solving-fibonacci-number/6693c4e2a5ffb34f27eb731b)

### [Solving Next Greater Element I](https://vineethchivukula.hashnode.dev/solving-next-greater-element-i?utm_source=hashnode&utm_medium=feed)

To see the question, click here. Naive Approach The idea is to iterate through each element in nums1 and then search for this element in nums2. Once found, look for the next greater element in nums2 by scanning the elements following the found elemen...

5 min read · [vineethchivukula.hashnode.dev](https://vineethchivukula.hashnode.dev/solving-next-greater-element-i?utm_source=hashnode&utm_medium=feed)

[Jul 13, 2024](https://hashnode.com/posts/solving-next-greater-element-i/669273793066c67c274b215d)

### [Solving Merge k Sorted Lists](https://vineethchivukula.hashnode.dev/solving-merge-k-sorted-lists?utm_source=hashnode&utm_medium=feed)

To see the question, click here. Naive Approach The idea is to store all the values of the list nodes in an array, sort them using the Arrays.sort method, and then construct the linked list to return it as the answer. // TC: O(nlogn) // SC: O(n) imp...

6 min read · [vineethchivukula.hashnode.dev](https://vineethchivukula.hashnode.dev/solving-merge-k-sorted-lists?utm_source=hashnode&utm_medium=feed)

[Jul 12, 2024](https://hashnode.com/posts/solving-merge-k-sorted-lists/669121ce83cea100418ff4b6)

### [Solving Find Median from Data Stream](https://vineethchivukula.hashnode.dev/solving-find-median-from-data-stream?utm_source=hashnode&utm_medium=feed)

To see the question, click here. Naive Approach The idea is to store the elements in a list. At each stage of adding an element, we will sort the list because the elements may not be added to the list in a sorted fashion. // TC: O(nlogn) for addNum a...

5 min read · [vineethchivukula.hashnode.dev](https://vineethchivukula.hashnode.dev/solving-find-median-from-data-stream?utm_source=hashnode&utm_medium=feed)

[Jul 11, 2024](https://hashnode.com/posts/solving-find-median-from-data-stream/668fd0796d466b1a2fd58982)

### [Solving Kth Largest Element in an Array](https://vineethchivukula.hashnode.dev/solving-kth-largest-element-in-an-array?utm_source=hashnode&utm_medium=feed)

To see the question, click here. Naive Approach To find the kth largest element, we can first sort the array and then return the nums.length - k th element. // TC: O(nlogn) // SC: O(1) import java.util.Arrays; class KthLargestElement { public ...

5 min read · [vineethchivukula.hashnode.dev](https://vineethchivukula.hashnode.dev/solving-kth-largest-element-in-an-array?utm_source=hashnode&utm_medium=feed)

[Jul 10, 2024](https://hashnode.com/posts/solving-kth-largest-element-in-an-array/668e7ef451333a704ec21b3f)
