Achieving Success as an Android Developer: A Roadmap

Here is a roadmap for becoming an Android developer: 1. Learn the basics of programming: If you are new to programming, it is important to start by learning the basics. This includes concepts such as variables, loops, and data types. You can learn these concepts through online courses or by working through a textbook. 2. … Read more

Amortised Time complexity , and there method to find

What is amortised time complexity and method to calculate? Amortized time complexity is a measure of the efficiency of an algorithm that takes into account the average time taken by the algorithm over a sequence of operations, rather than just the worst-case or best-case time complexity. One method for calculating the amortized time complexity of … Read more

Binary Trees – Data structure – Nilesh

What are Binary Trees? A binary tree is a tree data structure in which each node has at most two children. The children are referred to as the left child and the right child.Binary trees are commonly used to implement binary search trees and binary heaps. They have several useful properties, such as the ability … Read more

How to Get a Job at Google: Tips and Strategies for Applying and Interviewing

How to Get a Job at Google If you’re looking for a job at Google, there are a few things you’ll need to do. What is the interview question in the SDE role at Google?.First, head over to their website and register for an account. now move toward each step to How to Get a … Read more

Amazon SDE Interview Experience | Amazon SDE interview question

Experience 1: There are just too many postings out there that describe the normal Amazon SDE beginner drill. But I’ll still tell you about my entire experience.7 Debugging Questions in the First Round I got 7 out of 7 correct. Two Coding Questions in the Second Round I completely solved one, and I’m quite confident … Read more

Tackling Jump I , II , III , IV Game Problems on LeetCode | Cpp ,Java ,Python – Day 3

leetcode question solution

In this post, we’ll look at two jump game difficulties offered on LeetCode. These are well-known coding tasks that might be difficult to complete in a single attempt.We’ll go over numerous approaches to solving both issues step by step using complexity analysis. So, let’s begin with the first. Day 3 Coding Challenge Problem 1 of … Read more

How to get 5✨ on Leet Code with my Own experience

I am currently a 4th year undergraduate at one of the new SIT. You can connect with me on LinkedIn – started my DSA journey on second Year. and i have 3 ✨ on Leetcode 1st Phase() 2nd Phase() 3rd Phase() Tips UpdateAs some of you were asking for my coding and LinkedIn handles so … Read more

Day 2 : FaceBook Asked interview Quetion :- Add Binary Sum – Java ,Python ,Cpp

leetcode question solution

If, you are preperaing for FACEBOOK Interview or will prepare. Then according to LeetCode premium it is no.4 most asked Question by Facebook as per now. Nilesh Most important QUOTE… So Ladies n Gentlemen without any further due let’s start,What question saying is, Given two binary strings a and b, return their sum as a binary string. Explanation of Approach: Explanation … Read more

Leet Code : Intersection of Two Linked ListsLeet Code – Java | Python | C++ | Dart | Easy Solution

leetcode question solution

Find the location where two linked lists intersect. Find the node where the two linked lists cross when there are two of them and the tail of the second list points to a node in the first list. Take into account the linked lists below, where the fourth node of the first list is connected … Read more

McAfee ,Google ,LionBridge ,Paypal ,Walmart ,Citi ,Goldmansachs ,Tata Strive , Clover Infotech ,Accenture Baker Huges Hiring – 2022

Lots Of Company is newly Hiring for Fresher and Passout Student , Dont Miss Chances Apply fast and get job . Latest Hiring Company Apply Link McAfee Google Opration Center LION BRIDGE (JR ENGG) Paypal (SDE )—2023-Graduate–Bachelor-s–Dual-Degree-or-Integrated-Master-s-_R0095516 Walmart (Analyst)–GLOBAL-BUSINESS-SERVICES_R-1326836?q=ANALYST,%20GLOBAL%20BUSINESS%20SERVICES&redirect=/WalmartExternal/job/IN-HR-GURGAON-Orchid-Center/ANALYST–GLOBAL-BUS Citi Congo AI Goldman Sachs Tata Strive … Read more

How to Prepare for a Google Software Engineer Interview – Nileshblog.Tech

Most engineers dream of working with Google at some point in their life. But preparing for the Google software engineer interview takes dedicated and consistent effort. Do you also want to know what it takes to join Google as a Software Engineer? Do you want to work for your dream company? Read on to know … Read more

Tips To Get Hired at FAANG Companies


how to get job in faang,how to get job in faang 2023,How ,did you get a job at FAANG?
,Which FAANG company is easiest to get into?,How can I join FAANG from India?,How do you get noticed by FAANG?,how to get job in maang,how to get job in maang 2023,How ,did you get a job at maang?
,Which maang company is easiest to get into?,How can I join maang from India?,How do you get noticed by maang?

Veritas (On Campus) Interview Experience -2022 | 2023

Veritas came to our college to hire students. An HR interview, two technical interviews, and aptitude +Technical tests were all part of the hiring process. Company name: Veritas Result: selected Position: STQA Rounds: 4 Connect with me on LinkedIn : HERE. Round 1 (Online Test) So, Guys, The first round was just a Qualifier test that shortlists the student … Read more

Leet Code : Trapping Rain Water Solution Java | CPP | JS

leetcode question solution

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. CPP solution … Read more

Leet Code : Validate Binary Search Tree Java | CPP | Python solution

leetcode question solution

Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: Input: root = [2,1,3] Output: true Solution : Java DFS : Python : CPP : Inorder solution :

Leet Code : Maximum Score from Performing Multiplication Operations Cpp | Java | Python solution

leetcode question solution

Two integer arrays, nums and multipliers, of sizes n and m, respectively, are provided to you, where n >= m. The arrays are all one-dimensional. You start with a score of zero. You need to carry out precisely m operations. On the ith (1-indexed) action, you will: Choose one integer x from the beginning or … Read more

Leet Code : Three (3) Sum Java | CPP | Python Solution

leetcode question solution

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. Example 1: Input: nums = [-1,0,1,2,-1,-4] Output: [[-1,-1,2],[-1,0,1]] Explanation: nums[0] + nums[1] + nums[2] = (-1) + 0 + … Read more

Leet Code : Longest Palindromic Substring Java | CPP | Java Script | Python Solution

leetcode question solution

Given a string s, return the longest palindromic substring in s. A string is called a palindrome string if the reverse of that string is the same as the original string. Example 1: Input: s = “babad” Output: “bab” Explanation: “aba” is also a valid answer. Example 2: Input: s = “cbbd” Output: “bb” Solution : JavaScript : CPP … Read more

Leet Code: Longest Substring Without Repeating Characters Java | JavaScript | CPP | Python Solution

leetcode question solution

Find the length of the longest substring without repeated characters given a string s. Example 1: Input: s = “abcabcbb” Output: 3 Explanation: The answer is “abc”, with the length of 3. Example 2: Input: s = “bbbbb” Output: 1 Explanation: The answer is “b”, with the length of 1. Example 3: Input: s = … Read more

Leet Code : Add Two List – Java | CPP | Javascript | Python

leetcode question solution

You are given two non-empty linked lists that each represent a non-negative integer. The digits are kept in reverse order, with each node containing only one digit. Add the two numbers together and return the total as a linked list. Except for the number 0 itself, you may presume that the two numbers do not … Read more

Leet Code : Median of two sorted array -CPP || java || Python || Java Script

leetcode question solution

Provide the median of the two sorted arrays given two sorted arrays of sizes m and n, respectively. The entire complexity of the run time should be O(log (m+n)). Eg 1: Numbers1 = [1,3], Numbers2 = [2] Result: 2.00000 Explanation: the merged array equals [1,2,3], and the median is 2. Eg 2: Numbers1 = [1,2], … Read more

EY – GDS (On campus) Interview Experience – 2022

Organization: Ernst and Young (EY-GDS) Designation:  Hey guys, I am Kavish Gidwani , placed in EY-GDS . sharing my interview experience. If you have any questions, please contact me on Linkedin: Link Round 1 (online test) The online test consists of the following sections for 65 minutes. It was organised through the AMCAT platform. Round 2 (Group Discussion) Duration … Read more

JIO Interview Experience Campus | reliance jio interview questions – 2022

 It was an on-campus hiring event for the JIO Sparks Program’s Graduate Engineer Trainee (GET) Role. jio spark hiring process ,reliance jio spark interview questions ,Pre-Placement discussions regarding the company and its requirements were followed by Round 1 of the Placement Drive. TIP: YOU CAN CONNECT WITH LINKDELIN : LINK jio interview rounds and process Round 1:  … Read more

leet code 1. Two sum (easy)

Leetcode 1. Two Sum

Sure, let’s solve the “Two Sum” problem using different approaches in C++, Python, Java, and JavaScript, and add some humor along the way! We’ll explore the bruteforce, hashmap, two hashmap, and two-pointer methods for each language. Time Complexity: C++: 1. Brute Force Approach: Notice: This approach has a time complexity of O(n^2), which isn’t very … Read more

 Binary Tree Level Order Traversal

Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level). Example 1: Input: root = [3,9,20,null,null,15,7] Output: [[3],[9,20],[15,7]] Example 2: Input: root = [1] Output: [[1]] Example 3:

Leet Code :Linked List Cycle II Java || Python || C++ solution

leetcode question solution

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail’s next pointer is connected … Read more