--- title: "khushaalan (@khushaalan) | Hashnode" description: "Software Dev. Read the latest articles by khushaalan on Hashnode." url: "https://hashnode.com/@khushaalan" --- @khushaalan # khushaalan @khushaalan · San Francisco · Joined September 2024 Software Dev ### [What is Heap](https://khushaalan.hashnode.dev/what-is-heap?utm_source=hashnode&utm_medium=feed) There are two types of heaps. Min heap and max heap. Height of a heap is O(log n) Max Heap Max heap is used for heapsort. Value of i <= Value of parent Can be represented as this array : \[21, 17, 15, 14, 9, 12, 13, 8, 5, 1\] Root of the tree is a... 1 min read · [khushaalan.hashnode.dev](https://khushaalan.hashnode.dev/what-is-heap?utm_source=hashnode&utm_medium=feed) [Apr 27, 2025](https://hashnode.com/posts/what-is-heap/680dd0b645d4d6f633f2457e) ### [Reverse Integer](https://khushaalan.hashnode.dev/reverse-integer?utm_source=hashnode&utm_medium=feed) Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range \[-2³¹, 2³¹ - 1\], then return 0. Assume the environment does not allow you to store... 1 min read · [khushaalan.hashnode.dev](https://khushaalan.hashnode.dev/reverse-integer?utm_source=hashnode&utm_medium=feed) [Feb 12, 2025](https://hashnode.com/posts/reverse-integer/67ac31e939fd7961179650f2) ### [Two Sum](https://khushaalan.hashnode.dev/two-sum?utm_source=hashnode&utm_medium=feed) Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the a... 1 min read · [khushaalan.hashnode.dev](https://khushaalan.hashnode.dev/two-sum?utm_source=hashnode&utm_medium=feed) [Feb 12, 2025](https://hashnode.com/posts/two-sum/67abe694a091178dcbf5b4c8) ### [Clear Digits](https://khushaalan.hashnode.dev/clear-digits?utm_source=hashnode&utm_medium=feed) You are given a string s. Your task is to remove all digits by doing this operation repeatedly: Delete the first digit and the closest non-digit character to its left. Return the resulting string after removing all digits. def clearDigits(self, s: ... 1 min read · [khushaalan.hashnode.dev](https://khushaalan.hashnode.dev/clear-digits?utm_source=hashnode&utm_medium=feed) [Feb 11, 2025](https://hashnode.com/posts/clear-digits/67abdf167e6d754d8ca561fb) ### [How to find \`n-th\` root of a given 'x' algorithmically](https://khushaalan.hashnode.dev/how-to-find-n-th-root-of-a-given-x-algorithmically?utm_source=hashnode&utm_medium=feed) def solve(x, n): if x == 0: return 0 lower = 0 upper = max(1, x) mid = (lower + upper) / 2 while ((mid-lower) >= 0.001): if (mid \*\* n > x): upper = mid else: lower = mid mid... 1 min read · [khushaalan.hashnode.dev](https://khushaalan.hashnode.dev/how-to-find-n-th-root-of-a-given-x-algorithmically?utm_source=hashnode&utm_medium=feed) [Jan 22, 2025](https://hashnode.com/posts/how-to-find-n-th-root-of-a-given-x-algorithmically/679116a5cca8fc79fb3c026a)