Splunk Interview Questions

Note: ensure you read the disclaimer on the previous page reading the accuracy and sourcing of these problems.

Reverse a String

Hey there, welcome to the **challenges** portion of the **AlgoDaily** technical interview course! Over the next few days, you'll get some hands on experience with the essential data structures and algorithms that will help you nail your interview, and land your dream software engineering job. The ...

Difficulty: 2/10

Generate All String Permutations

Write an algorithm that takes an input string like "abc" , and prints out all possible permutations of the string. A permutation of a group of elements is defined as one of the n! number possible arrangements the elements can take, where n is the number of elements in the range. We'd expect t...

Difficulty: 6/10

Contiguous Subarray Sum

Given an array of numbers, return true if there is a subarray that sums up to a certain number n . A subarray is a contiguous subset of the array. For example the subarray of 1,2,3,4,5 is 1,2,3 or 3,4,5 or 2,3,4 etc. js const arr 1, 2, 3 , sum 5 subarraySum arr, sum...

Difficulty: 4/10

Implement a Binary Search Tree

Let's implement a Binary Search Tree ! Recall that a binary search tree , or a BST , is a binary tree lessons an intro to binary trees and search trees that is ordered via these two properties: 1. The left sub tree of a node has a value less than or equal to its parent node's value. 2. The ...

Difficulty: 6/10

Fibonacci Sequence

Implement a function that returns the Fibonnaci number for a given integer input. In a Fibonacci sequence, each number is the sum of the two preceding ones. The simplest is the series: 1, 1, 2, 3, 5, 8, etc. This is because: fibonacci 0 0 fibonacci 1 1 fibonacci 2 1 fibonacci 3 ...

Difficulty: 4/10

Linked List to Binary Search Tree

We're given a sorted singly linked list that is, a linked list made of nodes with no pointers to the previous node where the elements are already arranged in ascending order. js 9 2 3 5 9 Linked List Node Definition: function Node val this.val val this...

Difficulty: 7/10

Delete Node From End

Removing the Nth Node From a Linked List's End: A Single Pass Approach Get ready to sail through a classic problem: Removing the n th node from the end of a linked list in a single pass. By the end of this lesson, you'll be able to wave goodbye to that pesky n th node and still maintain the lis...

Difficulty: 6/10

Reverse a Linked List

You're sent a linked list of numbers, but it's been received in the opposite order to what you need. This has happened multiple times now, so you decide to write an algorithm to reverse the lists as they come in. The list you've received is as follows: 7 2 21 6 42 10 Write ...

Difficulty: 6/10

Is A Subsequence

Given two strings, one named sub and the other str , determine if sub is a subsequence of str . js const str "barbell" const sub "bell" isASubsequence sub, str true For the sake of the exercise, let's assume that these strings only have lower case characters. W...

Difficulty: 5/10

Logging with the ELK Stack

A Comprehensive Guide to Centralized Logging with the ELK Stack Why Logging Matters The Vital Role of Logging Logging serves as the central nervous system of modern software applications. Think of it as the black box of an airplane it records every event, error, and transaction that oc...

Difficulty: 5/10

Monitoring and Logging

Introduction to Monitoring and Logging Monitoring and logging are crucial aspects of Java microservices. They provide visibility into the behavior and performance of these services, allowing developers and operators to identify issues, troubleshoot problems, and optimize the system. Logging ...

Difficulty: 5/10

Event-driven Microservices with Apache Kafka

Introduction to Event driven Architecture Event driven architecture is a software design pattern that allows components to communicate through events. In this architecture, events are messages that represent a change or an action in the system. The components, also known as event producers and e...

Difficulty: 5/10

People at Splunk Say

This information was sourced from reviews originally posted on Glassdoor.

Mostly everyone is really amiable and interested in you. Company is really focused on growth and pushing hard for it. Really great worksite right in the middle of Santana Row Kitchens. Always have something to eat. Company hack weeks! Lots of team outings Specifically for interns, the company is committed to making the experience awesome! It would be nice to have free food! Really enjoyed the well thought out intern program! Make what other companies are working on more obvious!

Amazing work culture, challenging but fun. Talented coworkers to work with and learn from. Industry leading product with a fun tech stack Company cares about its employees and organizes lots of events like movie nights, pub crawls Compensation is very competitive with industry. Improve the 401K plan because planning for retirement is important and should not be dependent on company performance. - Increase visibility and transparency into each org to increase inter-org communication and decrease siloing.

Great engineering culture, work environment, people I work with. Great opportunity for product growth. Splunk has an amazing potential for greatness. Company, especially engineering, keeps shooting itself in the foot. Can't get out of its own way. Senior executives are not team players, lots of turf wars. Anyone who suggests good engineering practices gets shot down by the long termers. Become team players. Recognize and encourage people who are doing things right. Take risks.

Very useful product, customers legitimately get a lot of value even with high prices. Fair amount of different technology problems to interact with. Individual contributors are often helpful. Overall this is about as good as you can imagine a mid-size enterprise software shop could be. There's a dream that it's still a fun company, but it's just a company, which isn't a bad thing. Pick some paths forward and fund them economically and politically to succeed.