Pinned

DSA,LLD & HLD

Latest update: For now I will be focussing more on DSA (Leetcode and other platforms) But for the other section, I would be adding the articles of other creators which are good to start. MyProfile: Linkedin , LeetCode , HackerRank , I'm just a problem solver looking to learn and contribute to the coding and developer community. I have recently moved from the SDET profile to the SDE role. Soon I will be starting a series that will cover all the basic/Advanced topics for an SDE. This would help the ones who are attending interviews.

Data Structure Algorithm

1 min read

Data Structure Algorithm

1 min read

DSA,LLD & HLD

Latest update: For now I will be focussing more on DSA (Leetcode and other platforms)

But for the other section, I would be adding the articles of other creators which are good to start.

MyProfile: Linkedin , LeetCode , HackerRank ,

I'm just a problem solver looking to learn and contribute to the coding and developer community. I have recently moved from the SDET profile to the SDE role. Soon I will be starting a series that will cover all the basic/Advanced topics for an SDE. This would help the ones who are attending interviews.

Please correct me by commenting on posts if I am wrong about the concepts or require any improvement.

I will be using JAVA as a Language, but the intuition and discussion will be language-agnostic.

Sep 19, 2022

1114. Print in Order

Easy Suppose we have a class: public class Foo { public void first() { print("first"); } public void second() { print("second"); } public void third() { print("third"); } } The same instance of Foo will be passed to three different threads. Thread A will call first(), thread B will call…

Concurrency

1 min read

Concurrency

1 min read

Aug 20, 2022

871. Minimum Number of Refueling Stops

Hard A car travels from a starting position to a destination which is target miles east of the starting position. There are gas stations along the way. The gas stations are represented as an array stations where stations[i] = [positioni, fueli] indicates that the ith gas station is positioni miles…

Leetcode

2 min read

Leetcode

2 min read

Aug 19, 2022

659. Split Array into Consecutive Subsequences

Medium You are given an integer array nums that is sorted in non-decreasing order. Determine if it is possible to split nums into one or more subsequences such that both of the following conditions are true: Each subsequence is a consecutive increasing sequence (i.e. …

Leetcode

1 min read

Leetcode

1 min read

Aug 19, 2022

13. Roman to Integer

Easy Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, 2 is written as II in Roman numeral, just two ones added together. 12 is…

Leetcode

2 min read

Leetcode

2 min read

Aug 19, 2022

387. First Unique Character in a String

Easy Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1. Example 1: Input: s = "leetcode" Output: 0 Example 2: Input: s = "loveleetcode" Output: 2 Example 3: Input: s = "aabb" Output: -1 Constraints: 1 <= s.length <= 105 s consists of only lowercase English letters.

Leetcode

1 min read

Leetcode

1 min read

387. First Unique Character in a String

Easy

Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1.

Example 1:

Input: s = "leetcode"
Output: 0

Example 2:

Input: s = "loveleetcode"
Output: 2

Example 3:

Input: s = "aabb"
Output: -1

Constraints:

1 <= s.length <= 105
s consists of only lowercase English letters.

Aug 19, 2022

804. Unique Morse Code Words

Easy International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: 'a' maps to ".-", 'b' maps to "-...", 'c' maps to "-.-.", and so on. For convenience, the full table for the 26 letters of the English alphabet…

Leetcode

1 min read

Leetcode

1 min read

Aug 19, 2022

1338. Reduce Array Size to The Half

Medium You are given an integer array arr. You can choose a set of integers and remove all the occurrences of these integers in the array. Return the minimum size of the set so that at least half of the integers of the array are removed. Example 1: Input: arr…

Dsa

1 min read

Dsa

1 min read

Aug 13, 2022

30. Substring with Concatenation of All Words

Hard You are given a string s and an array of strings words of the same length. Return all starting indices of substring(s) in s that is a concatenation of each word in words exactly once, in any order, and without any intervening characters. You can return the answer in any order. Example 1: Input: s = "barfoothefoobarman", words = ["foo","bar"] Output: [0,9] Explanation: Substrings starting at index 0 and 9 are "barfoo" and "foobar" respectively. The output order does not matter, returning [9,0] is fine too.

Data Structures

1 min read

Data Structures

1 min read

30. Substring with Concatenation of All Words

Hard

You are given a string s and an array of strings words of the same length. Return all starting indices of substring(s) in s that is a concatenation of each word in words exactly once, in any order, and without any intervening characters.

You can return the answer in any order.

Example 1:

Input: s = "barfoothefoobarman", words = ["foo","bar"]
Output: [0,9]
Explanation: Substrings starting at index 0 and 9 are "barfoo" and "foobar" respectively.
The output order does not matter, returning [9,0] is fine too.

Example 2:

Input: s = "wordgoodgoodgoodbestword", words = ["word","good","best","word"]
Output: []

Example 3:

Input: s = "barfoofoobarthefoobarman", words = ["bar","foo","the"]
Output: [6,9,12]

Constraints:

1 <= s.length <= 104
1 <= words.length <= 5000
1 <= words[i].length <= 30
s and words[i] consist of lowercase English letters.

Aug 12, 2022

235. Lowest Common Ancestor of a Binary Search Tree

Easy Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both…

Leetcode Easy

2 min read

Leetcode Easy

2 min read