4 results • Page 1 of 1
Showing : `Avalara`reset
[Offer] Avalara Interview Tips
3.9 years ago
1.4k
[Offer] Avalara SDE-1 | August 2019
1 Vote | 0 Replies
3.9 years ago
mod2
870
4 results • Page 1 of 1

Recent Replies

Answer: PhonePe , Recent online Assessment (11th August 2023 SET- 2) | PhonePe Team Form by Aditya Garg • 0
//Team Formation #include <bits/stdc++.h> using namespace std; int main() {        int n,k;   &nbs…
Answer: SAP Labs | SDE-1 | On Campus | 29th November 2020 by hehehaha • 10
Question1)  #include <bits/stdc++.h> using namespace std; void dfs(int node, vector<vector<int>>& adj, ve…
Comment: JP Morgan Chase, Recently Asked On-Campus Assessments conducted in IITs, Novembe by Naman Sharma • 10
The time complexity of the proposed solution is O (N4 ) as Time complexity = no. of states * work done per state  i.e N^2 * N^2&…
Answer: Airtel Payment's Bank, Recent Online Assessment Questions (25th August 2023) | M by hehehaha • 10
//PATH TO ELEMENT #include <bits/stdc++.h> using namespace std; string finder(vector<int> &v, int n, int idx){ &nbs…
Answer: Airtel, Online Assessment Bank (13th September 2023) | Superior Array element | by hehehaha • 10
//SUPERIOR ARRAY ELEMENT #include<bits/stdc++.h> using namespace std; int helper(vector<int> &v){     i…
Answer: DE shaw latest questions by Yash Vij • 0
#include <bits/stdc++.h> using namespace std; #define ll long long #define mod 1000000007 int f(int ind,int prev,vector&l…
Answer: Google | Complex Subsequence | Subtree XOR by Abhinav Ratna • 20
Approach for Problem 2:   Root the tree at node 1, then find sum[v] and sumWithXorApplied[v] for every node v then subtree of…
Answer: Google | Complex Subsequence | Subtree XOR by Keshav Jindal • 50
Approach for complex subsequences: Part 1: Efficient Range Updates To handle the range updates efficiently, we use a difference array. Th…
Answer: PhonePe , Recent online Assessment (11th August 2023 SET- 2) | PhonePe Team Form by Vaibhav Aggarwal • 0
TC O(10  *n*n) #include<bits/stdc++.h> #define null NULL using namespace std; string s; string fun(string str) { …
Answer: PhonePe , Recent online Assessment (11th August 2023 SET- 2) | PhonePe Team Form by Vaibhav Aggarwal • 0
TC O(n2) DP solution: #include<bits/stdc++.h> #define null NULL using namespace std; int n,k,x; map<int,int>mp; vecto…
Comment: PhonePe, Recent Online Assesment (19th August 2023) | Arjun's Birthday by Vaibhav Aggarwal • 0
TC (4*n) #include<bits/stdc++.h> #define null NULL using namespace std; int t,n,m,curr=0,mx1=0,mx2=0,mx3=0,x; vector<int>a1,a…